Search Results - 90C25 Mathematical Programming - convex programming*

Acceleration by stepsize hedging: Silver Stepsize Schedule for smooth convex optimization.

Authors: Altschuler, Jason M. Parrilo, Pablo A.

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p1105-1118. 14p.

Subject Terms: *MATHEMATICAL optimization, CONVEX programming, OPTIMIZATION algorithms, CONVEX functions

Penalty and Smoothing Methods for Convex Semi-Infinite Programming

Authors: Auslender, Alfred Gobema, Miguel A. López, Marco A.

Source: Mathematics of Operations Research, 2009 May 01. 34(2), 303-319.

Access URL: https://www.jstor.org/stable/40538384

A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions

Authors: Popescu, Ioana

Source: Mathematics of Operations Research, 2005 Aug 01. 30(3), 632-657.

Access URL: https://www.jstor.org/stable/25151674

A projection-free method for solving convex bilevel optimization problems.

Authors: Giang-Tran, Khanh-Hung Ho-Nguyen, Nam Lee, Dabeen

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p907-940. 34p.

Subject Terms: *LINEAR programming, BILEVEL programming, CONVEX programming, NUMERICAL analysis, CONVEX functions, OPTIMIZATION algorithms

P-split formulations: a class of intermediate formulations between big-M and convex hull for disjunctive constraints.

Authors: Kronqvist, Jan Misener, Ruth Tsay, Calvin

Source: Mathematical Programming. Jun2025, p1-38.

Subject Terms: *MATHEMATICAL optimization, *INTEGER programming, CONVEX sets, COMPARATIVE studies, DISJUNCTION (Logic)

Neural spectrahedra and semidefinite lifts: global convex optimization of degree-two polynomial activation neural networks in polynomial-time.

Authors: Bartan, Burak Pilanci, Mert

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p737-769. 33p.

Subject Terms: *ARTIFICIAL neural networks, SEMIDEFINITE programming, GLOBAL optimization, COST functions, COMPUTATIONAL complexity, CONVEX programming, BACK propagation

A slightly lifted convex relaxation for nonconvex quadratic programming with ball constraints.

Authors: Burer, Samuel¹ (AUTHOR) samuel-burer@uiowa.edu

Source: Mathematical Programming. May2025, Vol. 211 Issue 1, p157-179. 23p.

Subject Terms: *NONCONVEX programming, *QUADRATIC programming, *CONSTRAINT programming, *ELLIPSOIDS, *COLLECTIONS

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient.

Authors: Latafat, Puya Themelis, Andreas Stella, Lorenzo et al.

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p433-471. 39p.

Subject Terms: CONVEX programming, LIPSCHITZ continuity, SMOOTHNESS of functions, COMPUTER simulation, SUBGRADIENT methods

Accelerated stochastic approximation with state-dependent noise.

Authors: Ilandarideva, Sasila Juditsky, Anatoli Lan, Guanghui et al.

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p239-280. 42p.

Subject Terms: *ESTIMATION theory, CONVEX programming, OPTIMIZATION algorithms, STOCHASTIC programming

Unconstrained Convex Minimization in Relative Scale

Authors: Nesterov, Yurii

Source: Mathematics of Operations Research, 2009 Feb 01. 34(1), 180-193.

Access URL: https://www.jstor.org/stable/40538372

Simulated Annealing for Convex Optimization

Authors: Kalai, Adam Tauman Vempala, Santosh

Source: Mathematics of Operations Research, 2006 May 01. 31(2), 253-266.

Access URL: https://www.jstor.org/stable/25151723

A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis

Authors: Fujishige, Satoru Tamura, Akihisa

Source: Mathematics of Operations Research, 2007 Feb 01. 32(1), 136-155.

Access URL: https://www.jstor.org/stable/25151777

Interior Gradient and Epsilon-Subgradient Descent Methods for Constrained Convex Minimization

Authors: Auslender, A. Teboulle, M.

Source: Mathematics of Operations Research, 2004 Feb 01. 29(1), 1-26.

Access URL: https://www.jstor.org/stable/30035629

Simple bilevel programming and extensions.

Authors: Dempe, Stephan Dinh, Nguyen Dutta, Joydeep et al.

Source: Mathematical Programming. Jul2021, Vol. 188 Issue 1, p227-253. 27p.

Subject Terms: *BILEVEL programming, *MATHEMATICAL programming, *ALGORITHMS, *CONVEX functions

Convergence of a Hybrid Projection-Proximal Point Algorithm Coupled with Approximation Methods in Convex Optimization

Authors: Alvarez, Felipe Carrasco, Miguel Pichard, Karine

Source: Mathematics of Operations Research, 2005 Nov 01. 30(4), 966-984.

Access URL: https://www.jstor.org/stable/25151697

Homogeneous second-order descent framework: a fast alternative to Newton-type methods.

Authors: He, Chang Jiang, Yuntian Zhang, Chuwen et al.

Source: Mathematical Programming. May2025, p1-62.

Subject Terms: *MATHEMATICAL optimization, NONCONVEX programming, OPTIMIZATION algorithms, CONVEX programming

Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model

Authors: Freund, Robert M. Vera, Jorge R.

Source: Mathematics of Operations Research, 2009 Nov 01. 34(4), 869-879.

Access URL: https://www.jstor.org/stable/40538404

A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization

Authors: Beck, Amir Teboulle, Marc

Source: Mathematics of Operations Research, 2006 May 01. 31(2), 398-417.

Access URL: https://www.jstor.org/stable/25151732

Error Bound Moduli for Conic Convex Systems on Banach Spaces

Authors: Zheng, Xi Yin Ng, Kung Fu

Source: Mathematics of Operations Research, 2004 May 01. 29(2), 213-228.

Access URL: https://www.jstor.org/stable/30035678

Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces

Authors: Kung Fu Ng Xi Yin Zheng

Source: Mathematics of Operations Research, 2004 Feb 01. 29(1), 45-63.

Access URL: https://www.jstor.org/stable/30035631