Interior-point polynomial algorithms in convex programming

@inproceedings{Nesterov1994InteriorpointPA,
  title={Interior-point polynomial algorithms in convex programming},
  author={Y. Nesterov and A. Nemirovski},
  booktitle={Siam studies in applied mathematics},
  year={1994}
}
Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the… Expand
On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence
Interior-point methods provide one of the most popular ways of solving convex optimization problems. Two advantages of modern interior-point methods over other approaches are: (i) robust globalExpand
Cones and interior-point algorithms for structured convex optimization involving powers andexponentials
Optimization is an important field of applied mathematics with many applications in various domains, ranging from mechanical and electrical engineering to finance and operations research. InExpand
Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form
  • L. Tunçel
  • Computer Science, Mathematics
  • Found. Comput. Math.
  • 2001
TLDR
It is shown that essentially all primal—dual interior-point algorithms for LP can be extended easily to the general setting of convex optimization problems, and makes a very strong connection to quasi-Newton methods by expressing the square of the symmetric primal-dual linear transformation as a quasi- newton update in the case of the least sophisticated framework. Expand
Interior-point methods for unconstrained geometric programming and scaling problems
TLDR
The condition numbers are natural geometric quantities associated with the Newton polytope of the geometric program, and lead to diameter bounds on approximate minimizers, which generalize the iteration complexity of recent interior-point methods for matrix scaling and matrix balancing. Expand
An interior point-proximal method of multipliers for convex quadratic programming
TLDR
This paper combines an infeasible Interior Point Method (IPM) with the Proximal Method of Multipliers (PMM) and shows that IP-PMM inherits the polynomial complexity of IPMs, as well as the strict convexity of the PMM sub-problems. Expand
Optimization on linear matrix inequalities for polynomial systems control
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and realExpand
Interior-point methods
TLDR
This work reviews some of the key developments in the modern era of interior-point methods, including comments on both the complexity theory and practical algorithms for linear programming, semide nite programming, monotone linear complementarity, and convex programming over sets that can be characterized by self-concordant barrier functions. Expand
Primal-Dual Interior-Point Methods for Self-Scaled Cones
TLDR
This paper presents efficiency estimates for several symmetric primal-dual methods that can loosely be classified as path-following methods for convex programming problems expressed in conic form when the cone and its associated barrier are self-scaled. Expand
Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra
TLDR
The perspective reformulation lends itself to simple coordinate descent and bisection algorithms utilizing the simplex method for quadratic programming, which makes the solution methods amenable to warm starts and suitable for branch-and-bound algorithms. Expand
A new perspective on the complexity of interior point methods for linear programming
In a dynamical systems paradigm, many optimization algorithms are equivalent to applying forward Euler method to the system of ordinary differential equations defined by the vector field of theExpand
...
1
2
3
4
5
...