On duality theory for non-convex semidefinite programming
From MaRDI portal
Publication:646659
DOI10.1007/s10479-011-0861-zzbMath1269.90075OpenAlexW1972790638MaRDI QIDQ646659
Chengjin Li, Raimundo J. B. de Sampaio, Wen-Yu Sun
Publication date: 17 November 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0861-z
Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- Successive linearization methods for nonlinear semidefinite programs
- Duality theories in nonlinear semidefinite programming
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- On filter-successive linearization methods for nonlinear semidefinite programming
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- A class of nonconvex functions and mathematical programming
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- Characterizations and applications of prequasi-invex functions.
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On duality theory for non-convex semidefinite programming