scientific article; zbMATH DE number 1552283
From MaRDI portal
Publication:4524522
zbMATH Open0963.65061MaRDI QIDQ4524522FDOQ4524522
Authors: Michael J. Nealon, V. Jeyakumar 
Publication date: 3 July 2001
Title of this publication is not available (Why is that?)
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
linear matrix inequalitiesnumerical examplestrong dualityinterior-point algorithmsasymptotic optimality conditionssemidefinite convex programmingsemidefinite Farkas' lemma
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51) Semidefinite programming (90C22)
Cited In (20)
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- Title not available (Why is that?)
- Optimality theorems for convex semidefinite vector optimization problems
- Optimality conditions in semidefinite programming
- Empirical Properties of Optima in Free Semidefinite Programs
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Strong duality conditions in semidefinite programming
- Characteristics of semi-convex frontier optimization
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- Homogenized KKT systems and strict feasibility of semidefinite programs
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Knowledge-based semidefinite linear programming classifiers
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Title not available (Why is that?)
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)
