Publication:4524522
From MaRDI portal
zbMath0963.65061MaRDI QIDQ4524522
Vaithilingam Jeyakumar, Michael J. Nealon
Publication date: 3 July 2001
numerical example; interior-point algorithms; linear matrix inequalities; strong duality; asymptotic optimality conditions; semidefinite convex programming; semidefinite Farkas' lemma
65K05: Numerical mathematical programming methods
90C22: Semidefinite programming
90C25: Convex programming
90C51: Interior-point methods
Related Items
\(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints, 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, Knowledge-based semidefinite linear programming classifiers