Modifications and implementation of the ellipsoid algorithm for linear programming

Mathematical Programming

Volumn 23, Issue 1, 1982, Pages 1-19

  Goldfarb, Donald ^a   Todd, Michael J ^b  

^a CITY COLLEGE OF NEW YORK   (United States)

^b Cornell University ^*  (United States)

Author keywords

Ellipsoid Algorithm; Khachian's Method; Linear Inequalities; Linear Programming; Polynomial Boundedness

Indexed keywords

MATHEMATICAL PROGRAMMING, LINEAR;

EID: 0020132663     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/BF01583776     Document Type: Article

References (32)

1. The relaxation method for linear inequalities
2. Triangular factors of modified matrices
3. Methods of solution of nonlinear extremal problems
4. Khachiyan's algorithm for linear programming
5. Methods for modifying matrix factorizations
6. Methods for computing and modifying the LDV factors of a matrix
7. Extension of Davidon's variable metric method to maximization under linear inequality and equality constraints
8. On approximate solutions of systems of linear inequalities
9. A polynomial algorithm in linear programming
10. How good is the simplex algorithm?
11. The relaxation method for linear inequalities
12. Location of the maximum on unimodal surfaces
13. A general method for solving extremum problems
14. Minimization of unsmooth functionals
15. Subgradient methods: a survey of Soviet research
16. The gradient projection method for nonlinear programming, Part I, Linear constraints
17. The rate of convergence of the generalized gradient descent method
18. Utilization of the operation of space dilatation in the minimization of convex functions
19. Convergence rate of the gradient descent method with dilatation of the space
20. Cut-off method with space extension in convex programming problems
21. A bound on the informational complexity of mathematical programming problems
22. Informational complexity and effective methods of solution for convex extremal problems