A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem

DOI10.1134/S0965542516070186zbMath1416.90032MaRDI QIDQ519124

Yong-Cai Geng, Sumit K. Garg

Publication date: 4 April 2017

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

steepest descentdual affine scaling methodlinear semidefinite programming problem

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Linear programming with positive semi-definite matrices
• On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
• Dual interior point methods for linear semidefinite programming problems
• The Elimination Matrix: Some Lemmas and Applications
• ON MATRICES DEPENDING ON PARAMETERS

This page was built for publication: A feasible dual affine scaling steepest descent method for the linear semidefinite programming problem