Two-phase simplex method for linear semidefinite optimization

DOI10.1007/s11590-018-1333-zzbMath1433.90109OpenAlexW2895761673WikidataQ129150323 ScholiaQ129150323MaRDI QIDQ2010151

Vitaliǐ Grigor'evich Zhadan

Publication date: 3 December 2019

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-018-1333-z

zbMATH Keywords

extreme pointslocal convergencetwo-phase methodlinear semidefinite programmingprimal simplex method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items (1)

Extension of the LP-Newton method to conic programming problems via semi-infinite representation

Cites Work

• Unnamed Item
• Linear programming with positive semi-definite matrices
• Complementarity and nondegeneracy in semidefinite programming
• Second-order cone programming
• Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation
• The Elimination Matrix: Some Lemmas and Applications
• Cone-LP's and semidefinite programs: Geometry and a simplex-type method
• Semidefinite Programming
• A pivoting procedure for a class of second-order cone programming
• ON MATRICES DEPENDING ON PARAMETERS
• Linear programming. Foundations and extensions
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: Two-phase simplex method for linear semidefinite optimization