Generalization of primal-dual interior-point methods to convex optimization problems in conic form

zbMath1017.90126MaRDI QIDQ5945646

Tunçel, Levent

Publication date: 14 October 2001

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

linear programmingconvex optimizationvariable metric methodssymmetric conesquasi-Newton methodspolynomial iteration-complexityprimal-dual interior-point methodsself-concordant barriers

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)

Related Items

An algorithm for nonsymmetric conic optimization inspired by MOSEK ⋮ On verified numerical computations in convex programming ⋮ A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ Linear optimization over homogeneous matrix cones ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ Unnamed Item ⋮ ``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods ⋮ Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming ⋮ Primal-Dual Interior-Point Methods for Domain-Driven Formulations ⋮ Newton polytopes and relative entropy optimization ⋮ A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions ⋮ An interior method for nonconvex semidefinite programs ⋮ On self-concordant barriers for generalized power cones