Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional

DOI10.1137/S1052623494270741MaRDI QIDQ4717554zbMATHOpenAlexFDO

Authors L. Faybusovich

Publication date 1 December 1996

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s1052623494270741

zbMATH Keywords

interior-point methodscomplexity estimatespath-following algorithmssemidefinite problemslinear-quadratic functionals

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25) Dynamical systems and ergodic theory (37-XX)

Recommendations

• scientific article; zbMATH DE number 1182576
• A new primal-dual path-following algorithm for convex quadratic semidefinite programming
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• scientific article; zbMATH DE number 1091399

Cited in

(5)

• Trajectory-following methods for large-scale degenerate convex quadratic programming
• Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
• Long-step path-following algorithm for solving symmetric programming problems with nonlinear objective functions
• Gradient methods and conic least-squares problems
• scientific article; zbMATH DE number 1182576 (Why is no real title available?)

This page was built for publication: Semidefinite Programming: A Path-Following Algorithm for a Linear–Quadratic Functional

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717554)