Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems

Mathematical Programming, Series B

Volumn 84, Issue 2, 1999, Pages 227-267

  Todd, M J ^a  

^a School of Operations Research and Industrial Engineering   (United States)

Author keywords

Convex programming; Dual interior; Dual model; Homogeneous self; Infeasibility detection; Infeasible ; Point algorithms; Primal; Start methods

Indexed keywords

EID: 0010746895     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107980009a     Document Type: Article

References (2)

1. de Ghellink, G., Vial, J.-P. (1986): A polynomial Newton method for linear programming. Algorithmica 1, 425-453
2. den Hertog, D. (1994): Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity. Kluwer Academic Publishers, Dordrecht, The Netherlands