scientific article; zbMATH DE number 1552283
From MaRDI portal
Publication:4524522
zbMath0963.65061MaRDI QIDQ4524522
Michael J. Nealon, Vaithilingam Jeyakumar
Publication date: 3 July 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical exampleinterior-point algorithmslinear matrix inequalitiesstrong dualityasymptotic optimality conditionssemidefinite convex programmingsemidefinite Farkas' lemma
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Interior-point methods (90C51)
Related Items (7)
Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint ⋮ 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 ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Knowledge-based semidefinite linear programming classifiers
This page was built for publication:
