scientific article; zbMATH DE number 1552283

MaRDI QIDQ4524522zbMATH OpenFDO

Authors Michael J. Nealon, V. Jeyakumar

Publication date 3 July 2001

zbMATH Keywords

asymptotic optimality conditionsinterior-point algorithmslinear matrix inequalitiesnumerical examplesemidefinite convex programmingsemidefinite Farkas' lemmastrong duality

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Optimality criteria without constraint qualifications for linear semidefinite problems
• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
• A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
• Optimality conditions for nonconvex semidefinite programming

Cited in

(20)

• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems
• Constraint qualifications characterizing Lagrangian duality in convex optimization
• A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
• Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
• A simplified treatment of Ramana's exact dual for semidefinite programming
• Characteristics of semi-convex frontier optimization
• Optimality conditions in semidefinite programming
• scientific article; zbMATH DE number 6500589 (Why is no real title available?)
• Knowledge-based semidefinite linear programming classifiers
• New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
• Optimality theorems for convex semidefinite vector optimization problems
• scientific article; zbMATH DE number 1139561 (Why is no real title available?)
• Strong duality conditions in semidefinite programming
• Exact Duality in Semidefinite Programming Based on Elementary Reformulations
• Empirical Properties of Optima in Free Semidefinite Programs
• Homogenized KKT systems and strict feasibility of semidefinite programs
• Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints

This page was built for publication:

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