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}
}
  • Y. Nesterov, M. J. Todd
  • Published 1997
  • Mathematics, Computer Science
  • Math. Oper. Res.
  • 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
    619 Citations

    Topics from this paper.

    Primal-Dual Interior-Point Methods for Self-Scaled Cones
    • 527
    • PDF
    Primal-Dual Symmetry and Scale Invariance of Interior-Point Algorithms for Convex Optimization
    • L. Tunçel
    • Computer Science, Mathematics
    • Math. Oper. Res.
    • 1998
    • 40
    • Highly Influenced
    Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
    • 1
    Interior-point algorithms for convex optimization based on primal-dual metrics
    • 7
    • Highly Influenced
    • PDF
    Convergence of infeasible-interior-point methods for self-scaled conic programming
    • 8
    • PDF
    Extension of primal-dual interior point methods to diff-convex problems on symmetric cones
    • 4
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 15 REFERENCES
    Barrier Functions in Interior Point Methods
    • O. Güler
    • Mathematics, Computer Science
    • Math. Oper. Res.
    • 1996
    • 163
    • Highly Influential
    • PDF
    Interior-point polynomial algorithms in convex programming
    • 3,111
    • PDF
    A Centered Projective Algorithm for Linear Programming
    • 158
    • PDF
    Convex analysis and variational problems
    • 3,901
    • PDF
    Potential Reduction Polynomial Time Method for Truss Topology Design
    • 53
    Polynomial affine algorithms for linear programming
    • C. Gonzaga
    • Mathematics, Computer Science
    • Math. Program.
    • 1991
    • 62
    Domains of positivity
    • 44
    • Highly Influential
    • PDF
    A polynomial method of approximate centers for linear programming
    • 96
    An O(n3L) potential reduction algorithm for linear programming
    • Y. Ye
    • Mathematics, Computer Science
    • Math. Program.
    • 1991
    • 250
    An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems
    • 150
    • Highly Influential