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

JOURNAL ARTICLE published February 1997 in Mathematics of Operations Research

Authors: Yu. E. Nesterov | M. J. Todd

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

JOURNAL ARTICLE published May 1998 in SIAM Journal on Optimization

Authors: Yu. E. Nesterov | M. J. Todd

On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods

JOURNAL ARTICLE published 17 October 2002 in Foundations of Computational Mathematics

Authors: Yu. E. Nesterov | M. J. Todd

Interior-Point Polynomial Algorithms in Convex Programming

MONOGRAPH published January 1994

Authors: Yurii Nesterov | Arkadii Nemirovskii

5. How to Construct Self-Concordant Barriers

BOOK CHAPTER published January 1994 in Interior-Point Polynomial Algorithms in Convex Programming

Long-step strategies in interior-point primal-dual methods

JOURNAL ARTICLE published January 1997 in Mathematical Programming

Authors: Yu. Nesterov

Interior-point methods: An old and new approach to nonlinear programming

JOURNAL ARTICLE published October 1997 in Mathematical Programming

Authors: Yu. Nesterov

Interior-Point Methods for Convex Programming

REPORT published 1 November 1990

Authors: Florian Jarre

Interior Point Methods of Mathematical Programming

JOURNAL ARTICLE published 18 December 1997 in Journal of the Operational Research Society

Authors: T Talaky (Ed.)

Hyperbolic Polynomials and Interior Point Methods for Convex Programming

JOURNAL ARTICLE published May 1997 in Mathematics of Operations Research

Authors: Osman Güler

3. Path-Following Interior-Point Methods

BOOK CHAPTER published January 1994 in Interior-Point Polynomial Algorithms in Convex Programming

4. Potential Reduction Interior-Point Methods

BOOK CHAPTER published January 1994 in Interior-Point Polynomial Algorithms in Convex Programming

Affine-invariant contracting-point methods for Convex Optimization

JOURNAL ARTICLE published March 2023 in Mathematical Programming

Research funded by H2020 European Research Council (ERC Advanced Grant 788368)

Authors: Nikita Doikov | Yurii Nesterov

Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

JOURNAL ARTICLE published April 2001 in Mathematical Programming

Authors: E. Alper Yıldırım | Michael Todd

2. Background: Linear Programming and Interior-Point Methods

BOOK CHAPTER published January 1997 in Primal-Dual Interior-Point Methods

Interior-Point Methods for Classes of Convex Programs

BOOK CHAPTER published 1996 in Applied Optimization

Authors: Florian Jarre

A unified view of interior point methods for linear programming

JOURNAL ARTICLE published December 1990 in Annals of Operations Research

Authors: David F. Shanno | Ansuman Bagchi

Two interior-point algorithms for a class of convex programming problems

JOURNAL ARTICLE published January 1995 in Optimization Methods and Software

Authors: Stefano Herzel1 | Michael J. Todd

Interior-point methods for convex programming

JOURNAL ARTICLE published November 1992 in Applied Mathematics & Optimization

Authors: Florian Jarre

A new second-order corrector interior-point algorithm for semidefinite programming

JOURNAL ARTICLE published April 2012 in Mathematical Methods of Operations Research

Authors: Changhe Liu | Hongwei Liu