# Self-Scaled Barriers and Interior-Point Methods for Convex Programming

@article{Nesterov1997SelfScaledBA, title={Self-Scaled Barriers and Interior-Point Methods for Convex Programming}, author={Y. Nesterov and M. J. Todd}, journal={Math. Oper. Res.}, year={1997}, volume={22}, pages={1-42} }

This paper provides a theoretical foundation for efficient interior-point algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are self-scaled. For such problems we devise long-step and symmetric primal-dual methods. Because of the special properties of these cones and barriers, our algorithms can take steps that go typically a large fraction of the way to the boundary of the feasible region, rather than being confined to a ball of unit… CONTINUE READING

#### Topics from this paper.

619 Citations

Primal-Dual Interior-Point Methods for Self-Scaled Cones

- Computer Science, Mathematics
- SIAM J. Optim.
- 1998

527- PDF

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

- Computer Science, Mathematics
- Math. Oper. Res.
- 1998

40 Highly Influenced

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

- Mathematics, Computer Science
- Math. Program.
- 2005

15- PDF

Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions

- Mathematics, Computer Science
- Optim. Methods Softw.
- 2013

1

Interior-point algorithms for convex optimization based on primal-dual metrics

- Mathematics
- 2014

7 Highly Influenced- PDF

Convergence of infeasible-interior-point methods for self-scaled conic programming

- Computer Science
- 2003

8- PDF

Primal-dual interior-point algorithm for convex quadratic semi-definite optimization

- Mathematics
- 2009

24

Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone

- Mathematics
- 2014

4

A Polynomial-Time Interior-Point Method for Conic Optimization, With Inexact Barrier Evaluations

- Mathematics, Computer Science
- SIAM J. Optim.
- 2009

1- PDF

Extension of primal-dual interior point methods to diff-convex problems on symmetric cones

- Mathematics
- 2013

4 Highly Influenced- PDF

#### References

SHOWING 1-10 OF 15 REFERENCES

Barrier Functions in Interior Point Methods

- Mathematics, Computer Science
- Math. Oper. Res.
- 1996

163 Highly Influential- PDF

Interior-point polynomial algorithms in convex programming

- Mathematics, Computer Science
- Siam studies in applied mathematics
- 1994

3,111- PDF

A Centered Projective Algorithm for Linear Programming

- Computer Science, Mathematics
- Math. Oper. Res.
- 1990

158- PDF

Potential Reduction Polynomial Time Method for Truss Topology Design

- Mathematics, Computer Science
- SIAM J. Optim.
- 1994

53

Polynomial affine algorithms for linear programming

- Mathematics, Computer Science
- Math. Program.
- 1991

62

A polynomial method of approximate centers for linear programming

- Mathematics, Computer Science
- Math. Program.
- 1992

96

An O(n3L) potential reduction algorithm for linear programming

- Mathematics, Computer Science
- Math. Program.
- 1991

250

An
$$O(\sqrt n L)$$
iteration potential reduction algorithm for linear complementarity problems

- Mathematics, Computer Science
- Math. Program.
- 1991

150 Highly Influential