A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming

DOI10.1080/10556789908805746zbMath0957.90104OpenAlexW2085419063MaRDI QIDQ4504775

Masayuki Shida, Kojima, Masakazu, Susumu Shindoh

Publication date: 14 September 2000

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789908805746

zbMATH Keywords

semidefinite programminginterior-point methodsearch direction

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items

On the long-step path-following method for semidefinite programming, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

Cites Work

• Unnamed Item
• Unnamed Item
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• On the Nesterov--Todd Direction in Semidefinite Programming
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP