Primal central paths and Riemannian distances for convex sets
DOI10.1007/s10208-007-9019-4zbMath1179.52013OpenAlexW2080809355WikidataQ115385154 ScholiaQ115385154MaRDI QIDQ1029546
Arkadi Nemirovski, Yu. E. Nesterov
Publication date: 13 July 2009
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10208-007-9019-4
convex optimizationRiemannian geometrystructural optimizationinterior-point methodspath-following methodsself-concordant functionspolynomial-time methods
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Interior-point methods (90C51) Convex functions and convex programs in convex geometry (52A41) Geodesics in global differential geometry (53C22)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A geometric method in nonlinear programming
- Introductory lectures on convex optimization. A basic course.
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- Positivitatsbereiche Im R n
- The Geometry of Algorithms with Orthogonality Constraints
- Domains of positivity
This page was built for publication: Primal central paths and Riemannian distances for convex sets