Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization

DOI10.1287/moor.23.3.708zbMath0977.90037OpenAlexW2125815834MaRDI QIDQ2757561

Tunçel, Levent

Publication date: 26 November 2001

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.23.3.708

zbMATH Keywords

automorphism groupdualityscalingself-dualbarrier functionshomogeneous conesprimal-dual

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Convex functions and convex programs in convex geometry (52A41)

Related Items

Linear optimization over homogeneous matrix cones, A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones, Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems, ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods, Similarity and other spectral relations for symmetric cones, A study of search directions in primal-dual interior-point methods for semidefinite programming