An admissible dual internal point method for a linear semidefinite programming problem

DOI10.1134/S0005117912020038zbMath1307.90132OpenAlexW2027260604MaRDI QIDQ2261706

Vitaliǐ Grigor'evich Zhadan, Aleksandr Alehseevich Orlov

Publication date: 13 March 2015

Published in: Automation and Remote Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Using conical regularization in calculating Lagrangian estimates in quadratic optimization problems

Cites Work

• Unnamed Item
• Affine scaling algorithm fails for semidefinite programming
• Complementarity and nondegeneracy in semidefinite programming
• First- and second-order methods for semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Semidefinite optimization
• A primal interior point method for the linear semidefinite programming problem
• The Elimination Matrix: Some Lemmas and Applications
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Semidefinite Programming

This page was built for publication: An admissible dual internal point method for a linear semidefinite programming problem