``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods
type: Item
instance of: scholarly article
title: ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods
zbMATH Open document ID: 1079.90161
author: Arkadi Nemirovski
author: Levent Tunçel
published in: Mathematical Programming. Series A. Series B
publication date: 2005-04-19T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 2159482
zbMATH Keywords: Convex optimization
zbMATH Keywords: Interior-point methods
zbMATH Keywords: Primal-dual algorithms
zbMATH Keywords: Self-concordant barriers
Wikidata QID: Q57392922
MaRDI profile type: Publication
full work available at URL: s10107-004-0545-4
OpenAlex ID: W2143904249
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Entropy splitting for antiblocking corners and perfect graphs
cites work: A set of geometric programming test problems and their solutions
cites work: Geometric Programming: Methods, Computations and Applications
cites work: On self-concordant barrier functions for conic hulls and fractional programming
cites work: On the Self-Concordance of the Universal Barrier Function
cites work: Hyperbolic Polynomials and Interior Point Methods for Convex Programming
cites work: Entropy and sorting.
cites work: An infeasible interior-point algorithm for solving primal and dual geometric programs
cites work: Long-step strategies in interior-point primal-dual methods
cites work: Q4324980
cites work: Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
cites work: Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
cites work: A Quadratically Convergent Polynomial Algorithm for Solving Entropy Optimization Problems
cites work: Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization
cites work: Generalization of primal-dual interior-point methods to convex optimization problems in conic form
cites work: An Efficient Algorithm for Minimizing a Sum of p-Norms
DOI: 10.1007/S10107-004-0545-4
description: scientific article; zbMATH DE number 2159482