On self-concordant convex–concave functions

DOI10.1080/10556789908805755zbMath0972.90054OpenAlexW2022958739WikidataQ57392950 ScholiaQ57392950MaRDI QIDQ4504785

Arkadi Nemirovski

Publication date: 21 November 2001

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

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

zbMATH Keywords

semidefinite programmingpath-following interior point methodself-concordant convex-concave function

Mathematics Subject Classification ID

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

Related Items (3)

On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids ⋮ An interior-point method for a class of saddle-point problems ⋮ Minimum-volume enclosing ellipsoids and core sets

Cites Work

• Unnamed Item
• On the complexity of approximating the maximal inscribed ellipsoid for a polytope
• Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods
• Convex Analysis

This page was built for publication: On self-concordant convex–concave functions