A variant of the dual simplex method for a linear semidefinite programming problem

DOI10.1134/S0081543817090267zbMath1395.90197OpenAlexW2792764488MaRDI QIDQ1744997

Xianqiang Yang

Publication date: 20 April 2018

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0081543817090267

zbMATH Keywords

dual problemextreme pointsdual simplex methodlinear semidefinite programming problem

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear programming with positive semi-definite matrices
• The general theory of stability in linear programming
• Cone-LP's and semidefinite programs: Geometry and a simplex-type method
• Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A variant of the dual simplex method for a linear semidefinite programming problem