Search Results - 90C22 Mathematical Programming - semidefinite programming*

A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity.

Authors: Feng, Fuxiaoyue Ding, Chao Li, Xudong

Source: Mathematical Programming. Nov2025, Vol. 214 Issue 1/2, p643-683. 41p.

Subject Terms: *MATHEMATICAL optimization, *EMPIRICAL research, SEMIDEFINITE programming, OPTIMIZATION algorithms, NEWTON-Raphson method, JACOBIAN matrices

Local Duality of Nonlinear Semidefinite Programming

Authors: Qi, Houduo

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

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

New Upper Bounds for Kissing Numbers from Semidefinite Programming

Authors: Bachoc, Christine Vallentin, Frank

Source: Journal of the American Mathematical Society, 2008 Jul 01. 21(3), 909-924.

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

The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

Authors: Sun, Defeng

Source: Mathematics of Operations Research, 2006 Nov 01. 31(4), 761-776.

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

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

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

Finite convergence of the Moment-SOS hierarchy for polynomial matrix optimization.

Authors: Huang, Lei Nie, Jiawang

Source: Mathematical Programming. Nov2025, Vol. 214 Issue 1/2, p685-722. 38p.

Subject Terms: ARCHIMEDEAN property, SEMIDEFINITE programming, MOMENTS method (Statistics)

Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming.

Authors: Piccialli, Veronica Sudoso, Antonio M.

Source: Mathematical Programming. May2025, Vol. 211 Issue 1, p245-279. 35p.

Subject Terms: *SEMIDEFINITE programming, *GLOBAL optimization, *K-means clustering, *SUM of squares, *PRIOR learning

Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming.

Authors: Chen, Liang Chen, Ruoning Sun, Defeng et al.

Source: Mathematical Programming. Jun2025, p1-32.

Subject Terms: *MATHEMATICAL optimization, SEMIDEFINITE programming, CONSTRAINED optimization, CONVEX programming

Improved global guarantees for the nonconvex Burer–Monteiro factorization via rank overparameterization.

Authors: Zhang, Richard Y.¹ (AUTHOR) ryz@illinois.edu

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p1009-1038. 30p.

Subject Terms: *MATHEMATICAL optimization, NONCONVEX programming, MATHEMATICAL proofs, FACTORIZATION, NONNEGATIVE matrices

A Conic Programming Approach to Generalized Tchebycheff Inequalities

Authors: Zuluaga, Luis F. Peña, Javier F.

Source: Mathematics of Operations Research, 2005 May 01. 30(2), 369-388.

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

A hierarchy of eigencomputations for polynomial optimization on the sphere.

Authors: Lovitz, Benjamin Johnston, Nathaniel

Source: Mathematical Programming. Jul2025, p1-44.

Subject Terms: *MATHEMATICAL optimization, SEMIDEFINITE programming, SPHERES, CONSTRAINED optimization, SPECTRAL theory, SUM of squares, MATHEMATICAL bounds

A minimal face constant rank constraint qualification for reducible conic programming.

Authors: Andreani, Roberto Haeser, Gabriel Mito, Leonardo M. et al.

Source: Mathematical Programming. May2025, p1-27.

Subject Terms: *NONLINEAR programming, *MATHEMATICAL optimization, SEMIDEFINITE programming, CONSTRAINT satisfaction, LAGRANGE problem, LAGRANGE multiplier

Stable set polytopes with high lift-and-project ranks for the Lovász–Schrijver SDP operator.

Authors: Au, Yu Hin Tunçel, Levent

Source: Mathematical Programming. Jul2025, Vol. 212 Issue 1, p79-114. 36p.

Subject Terms: *INTEGER programming, SEMIDEFINITE programming, COMBINATORIAL optimization, SQUARE root

Automated tight Lyapunov analysis for first-order methods: Automated tight Lyapunov analysis...: M. Upadhyaya et al.

Authors: Upadhyaya, Manu Banert, Sebastian Taylor, Adrien B. et al.

Source: Mathematical Programming. Jan2025, Vol. 209 Issue 1, p133-170. 38p.

Subject Terms: COMPUTATIONAL mathematics, MATHEMATICAL functions, SEMIDEFINITE programming, CONSTRAINT programming, LINEAR operators

On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy.

Authors: Au, Yu Hin Tunçel, Levent

Source: Mathematical Programming. Sep2025, Vol. 213 Issue 1/2, p1169-1209. 41p.

Subject Terms: GRAPH theory, SEMIDEFINITE programming, GRAPH algorithms, POLYTOPES

The Chvátal–Gomory procedure for integer SDPs with applications in combinatorial optimization.

Authors: de Meijer, Frank Sotirov, Renata

Source: Mathematical Programming. Jan2025, Vol. 209 Issue 1, p323-395. 73p.

Subject Terms: *TRAVELING salesman problem, *MATHEMATICAL programming, COMPUTATIONAL mathematics, COMBINATORIAL optimization, SEMIDEFINITE programming

On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints.

Authors: Ai, Wenbao Liang, Wei Yuan, Jianhua

Source: Mathematical Programming. May2025, Vol. 211 Issue 1, p5-48. 44p.

Subject Terms: SEMIDEFINITE programming, QUADRATIC programming, CLASSICAL literature

A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem

Authors: Ding, Yichuan Wolkowicz, Henry

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

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

First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition.

Authors: Andreani, Roberto Haeser, Gabriel Mito, Leonardo M. et al.

Source: Mathematical Programming. Nov2023, Vol. 202 Issue 1/2, p473-513. 41p.

Subject Terms: *SEMIDEFINITE programming, *NONLINEAR programming, *GEOMETRIC approach, *LAGRANGE multiplier