Linear programming with positive semi-definite matrices
From MaRDI portal
Publication:1286269
DOI10.1155/S1024123X96000452zbMath0919.90108OpenAlexW2099235735MaRDI QIDQ1286269
Publication date: 3 May 1999
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/48215
duality gapsufficient conditionexistence of optimal solutionscone of positive semidefinite matricessimplex-like algorithm
Related Items (5)
A variant of the dual simplex method for a linear semidefinite programming problem ⋮ Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems ⋮ A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem ⋮ Two-phase simplex method for linear semidefinite optimization ⋮ A pivoting procedure for a class of second-order cone programming
This page was built for publication: Linear programming with positive semi-definite matrices
