On duality theory for non-convex semidefinite programming

DOI10.1007/S10479-011-0861-ZMaRDI QIDQ646659zbMATH OpenOpenAlexFDO

Authors Chengjin Li, Raimundo J. B. de Sampaio, Wenyu 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

zbMATH Keywords

convex-like functiondualityinvex functionnonconvex semidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Duality theories in nonlinear semidefinite programming
• The optimality conditions and duality theory for multiobjective semidefinite programming
• Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming
• The conjugate duality of nonlinear semidefinite programming
• Optimality conditions for nonconvex semidefinite programming

Cites work

• A class of nonconvex functions and mathematical programming
• A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
• An equivalency condition of nonsingularity in nonlinear semidefinite programming
• Characterizations and applications of prequasi-invex functions.
• Duality theories in nonlinear semidefinite programming
• Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming
• scientific article; zbMATH DE number 5583532 (Why is no real title available?)
• scientific article; zbMATH DE number 3261766 (Why is no real title available?)
• On filter-successive linearization methods for nonlinear semidefinite programming
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Successive linearization methods for nonlinear semidefinite programs
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

Cited in

(10)

• Convergence of a weighted barrier algorithm for stochastic convex quadratic semidefinite optimization
• Local Duality of Nonlinear Semidefinite Programming
• Generalized Farkas lemma and optimality conditions for nonconvex semidefinite programming
• Duality in nonlinear programming involving semilocally convex and related functions
• The conjugate duality of nonlinear semidefinite programming
• Duality formulations in semidefinite programming
• The nonconvex second-order cone: algebraic structure toward optimization
• Lossless convexification and duality
• Duality theories in nonlinear semidefinite programming
• Comments on ``Dual methods for nonconvex spectrum optimization of multicarrier systems

This page was built for publication: On duality theory for non-convex semidefinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646659)