A new class of polynomial primal-dual methods for linear and semidefinite optimization

European Journal of Operational Research

Volumn 143, Issue 2, 2002, Pages 234-256

  Peng, Jiming ^a   Roos, Cornelis ^b   Terlaky, Tamás ^a,b  

^a MCMASTER UNIVERSITY   (Canada)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Interior point method; Linear optimization; Polynomial complexity; Primal dual Newton method; Semidefinite optimization

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; LINEAR EQUATIONS; OPTIMIZATION; POLYNOMIALS;

INTERIOR POINT METHODS (IPM);

OPERATIONS RESEARCH;

EID: 0036883765     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00275-8     Document Type: Conference Paper

References (25)

1. Implementation of interior-point methods for large scale linear programming
2. An asymptotically O(√nL√)-iteration path-following linear programming algorithm that uses long steps
3. Primal-dual algorithms for linear programming based on the logarithmic barrier method
4. Improved complexity using higher order correctors for primal-dual Dikin affine scaling
5. A new polynomial-time algorithm for linear programming
6. A unified approach to interior point algorithms for linear complementarity problems
7. Pathways to the optimal set in linear programming
8. On the implementation of a (primal-dual) interior point method
9. On finding the optimal facet of linear programs
10. A primal-dual affine scaling potential reduction algorithm for linear programming
11. A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series
12. Self-scaled barriers and interior-point methods for convex programming
13. New complexity analysis of the primal-dual Newton method for linear optimization
14. An "analytic center" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
15. Symmetric primal-dual path following algorithms for semidefinite programming
16. A study of search directions in primal-dual interior-point methods for semidefinite programming
17. On the Nesterov-Todd direction in semidefinite programming
18. On the finite convergence of interior-point algorithms for linear programming
19. Interior point algorithms
20. On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
21. Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path