``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methods

DOI10.1007/s10107-004-0545-4zbMath1079.90161OpenAlexW2143904249WikidataQ57392922 ScholiaQ57392922MaRDI QIDQ1771312

Arkadi Nemirovski, Tunçel, Levent

Publication date: 19 April 2005

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-004-0545-4

zbMATH Keywords

Interior-point methodsConvex optimizationPrimal-dual algorithmsSelf-concordant barriers

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Related Items

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, Self-concordant barriers for convex approximations of structured convex sets, Primal-Dual Interior-Point Methods for Domain-Driven Formulations, Towards non-symmetric conic optimization, Recursive construction of optimal self-concordant barriers for homogeneous cones, Spectral self-concordant functions in the space of two-by-two symmetric matrices

Cites Work

• Unnamed Item
• Entropy splitting for antiblocking corners and perfect graphs
• Entropy and sorting.
• Long-step strategies in interior-point primal-dual methods
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• On self-concordant barrier functions for conic hulls and fractional programming
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Lectures on Modern Convex Optimization
• Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods
• Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization
• Geometric Programming: Methods, Computations and Applications
• A set of geometric programming test problems and their solutions
• A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• On the Self-Concordance of the Universal Barrier Function
• Hyperbolic Polynomials and Interior Point Methods for Convex Programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• An Efficient Algorithm for Minimizing a Sum of p-Norms
• Generalization of primal-dual interior-point methods to convex optimization problems in conic form