Interior methods for constrained optimization

Acta Numerica

Volumn 1, Issue , 1992, Pages 341-407

  Wright, Margaret H ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84971922797     PISSN: 09624929     EISSN: 14740508     Source Type: Journal    
DOI: 10.1017/S0962492900002300     Document Type: Article

References (60)

1. Arioli M., Duff I.S. and de Rijk P.P.M. (1989), ‘;On the augmented system approach to sparse least-squares problems’, Numer. Math. 55, 667–684.
2. Avriel M. (1976), Nonlinear Programming: Analysis and Methods, Prentice-Hall (Englewood Cliffs, NJ).0489892
3. Bayer D.A. and Lagarias J.C. (1989), ‘The nonlinear geometry of linear programming, I: Affine and projective scaling trajectories’ Trans. Am. Math. Soc. 314, 499–526.
4. Bayer D.A. and Lagarias J.C. (1991), ‘Karmarkar's linear programming algorithm and Newton's method’ Math. Program. 50, 291–330.
5. Bixby R. (1990), ‘Implementing the simplex method: the initial basis’ Report 90-32, Department of Mathematical Sciences, Rice University, Houston, Texas.
6. Björck A. (1991), ‘Least squares methods’ Institute of Technology, Linköping University, Linköping, Sweden.
7. Bunch J.R. and Kaufman L.C. (1977), ‘Some stable methods for calculating inertia and solving symmetric linear systems’ Math. Comput. 31, 162–179.
8. Choi I.C., Monma C.L. and Shanno D.F. (1990), ‘Further development of a primal-dual interior point method’, ORSA J. Comput. 2, 304–311.
9. Chvátal V. (1983), Linear Programming, W. H. Freeman (New York).
10. den Hertog D., Roos C. and Terlaky T. (1990), ‘On the classical logarithmic barrier function method for a class of smooth convex programming problems’ Report 90-01, Faculty of Technical Mathematics and Informatics, Delft University of Technology, Delft, Holland.
11. Duff I.S., Erisman A.M. and Reid J.K. (1986), Direct Methods for Sparse Matrices, Oxford University Press (London).
12. Fiacco A.V. (1979), ‘Barrier methods for nonlinear programming’ in Operations Research Support Methodology ( Holzman A.G., ed.), Marcel Dekker (New York), 377–440.
13. Fiacco A.V. and McCormick G.P. (1968). Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons (New York). Republished by SIAM (Philadelphia), 1990.
14. Fletcher R. (1987), Practical Methods of Optimization (second edition), John Wiley and Sons (Chichester).
15. Forrest J.J.H. and Tomlin J.A. (1990), ‘Vector processing in simplex and interior methods for linear programming’ Annals of Operations Research 22, 71–100.
16. Forrest J.J.H. and Tomlin J.A. (1991), ‘Implementing the simplex method for the Optimization Subroutine Library’ Research Report RJ 8174, IBM Almaden Research Centre, San Jose, California.
17. Fourer R. and Mehrotra S. (1990), ‘Performance of an augmented system approach for solving least-squares problems in an interior-point method for linear programming’ Report, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois.
18. Frisch K.R. (1955), ‘The logarithmic potential method of convex programming’ Report, University Institute of Economics, Oslo, Norway.
19. George J.A. and Liu J.W.H. (1981), Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall (Englewood Cliffs, NJ).
20. Gill P.E., Murray W., Ponceleón D.B., and Saunders M.A. (1990), ‘Preconditioners for indefinite systems arising in optimization’ Report SOL 90-8, Department of Operations Research, Stanford University, Stanford, California.
21. Gill P.E., Murray W., Ponceleón D.B., and Saunders M.A. (1991), ‘Solving reduced KKT systems in barrier methods for linear and quadratic programming’ Report SOL 91-7, Department of Operations Research, Stanford University, Stanford, California.
22. Gill P.E., Murray W., Saunders M.A., Tomlin J.A. and Wright M.H. (1986), ‘On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method’ Math. Program. 36, 183–209.
23. Gill P.E., Murray W. and Wright M.H. (1981), Practical Optimization, Academic Press (London and New York).
24. Goldfarb D. and Todd M.J. (1989), ‘Linear programming’ in Optimization ( Nemhauser G.L., Rinnooy Kan A.H.G. and Todd M.J., eds), North Holland (Amsterdam and New York), 73–170.
25. Gonzaga C.C. (1992), ‘Path following methods for linear programming’ SIAM Review 34, to appear.
26. Grünbaum B. (1967), Convex Polytopes, John Wiley and Sons (London).
27. Higham N.J. (1990), ‘Analysis of the Cholesky decomposition of a semi-definite matrix’ in Reliable Numerical Computation ( Cox M.G. and Hammarling S., eds), Clarendon Press (Oxford), 161–185.
28. Huard P. (1967), ‘Resolution of mathematical programming with nonlinear constraints by the method of centres’ in Nonlinear Programming ( Abadie J., ed.), North Holland (Amsterdam and New York), 207–219.
29. Jarre F. (1991), ‘Interior-point methods for convex programming’ Report SOL 90-16, Department of Operations Research, Stanford University, Stanford, California.
30. Jittorntrum K. (1978), Sequential Algorithms in Nonlinear Programming, Ph.D. thesis, Australian National University.
31. Karmarkar N.K. (1984), ‘A new polynomial time algorithm for linear programming’ Combinatorica 4, 373–395.
32. Karmarkar N.K. (1990), ‘Riemannian geometry underlying interior-point methods for linear programming’ in Mathematical Developments Arising from Linear Programming ( Lagarias J.C. and Todd M.J., eds), American Mathematical Society (Providence, RI), 51–75.
33. Khachian L.G. (1979), ‘A polynomial algorithm in linear programming’ Doklady Akademiia Nauk SSSR 244, 1093–1096 (in Russian); English translation in Sov. Math. Dokl. 20, 191–194.
34. Klee V. and Minty G.J. (1972), ‘How good is the simplex algorithm?’ in Inequalities III ( Shisha O., ed.), Academic Press (New York), 159–175.
35. Kranich E. (1991), ‘Interior point methods for mathematical programming: a bibliography’ Report 171, Universität Hagen, Hagen, Germany. This bibliography can be accessed electronically by sending email to ‘netlib@research.att.com’; with message ‘send intbib.tex from bib’ and/or ‘send intbib.bbl from bib’.
36. Luenberger D.G. (1984), Introduction to Linear and Nonlinear Programming, Addison-Wesley (Menlo Park, CA).
37. Lustig I., Marsten R.E. and Shanno D.F. (1990), ‘On implementing Mehrotra's predictor-corrector interior point method for linear programming’ Report SOR 90-03, Department of Civil Engineering and Operations Research, Princeton University, Princeton, New Jersey.
38. Marxen A. (1989), ‘Primal barrier methods for linear programming’ Ph.D. thesis, Stanford University, Stanford, California.
39. McCormick G.P. (1991), ‘The superlinear convergence of a nonlinear primal-dual algorithm’ Report T-550/91, Department of Operations Research, George Washington University, Washington, DC.
40. Megiddo N. (1987), ‘Pathways to the optimal set in linear programming’ in Progress in Mathematical Programming ( Megiddo N., ed.), Springer-Verlag (New York), 131–158.
41. Mehrotra S. (1990), ‘On the implementation of a (primal-dual) interior method’ Report 90-03, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois.
42. Mehrotra S. and Sun J. (1990), ‘An interior point algorithm for solving smooth convex programs based on Newton's method’ in Mathematical Developments Arising from Linear Programming ( Lagarias J.C. and Todd M.J., eds), American Mathematical Society (Providence, RI), 265–284.
43. Monteiro R.D.C. and Adler I. (1989a), ‘Interior path following primal-dual algorithms, Part I: Linear programming’ Math. Program. 44, 27–41.
44. Monteiro R.D.C. and Adler I. (1989b), ‘Interior path following primal-dual algorithms, Part II: Convex quadratic programming’ Math. Program. 44, 43–66.
45. Moré J.J. and Wright S.J. (1990), private communication.
46. Murray W. (1971), Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, J. Optim. Theory Appl. 7, 189–196.
47. Murray W. and Wright M.H. (1991), ‘Line search procedures for the logarithmic barrier function’ Manuscript, AT&T Bell Laboratories, Murray Hill, New Jersey.
48. Nesterov Y. and Nemirovsky A. (1989), Self-Concordant Functions and Polynomial-Time Methods in Convex Programming, USSR Academy of Science (Moscow).
49. Ortega J.M. and Rheinboldt W.C. (1970), Iterative Solution of Nonlinear Equations in Several Variables, Academic Press (London and New York).
50. Papadimitriou C.R. and Steiglitz K. (1982), Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall (Englewood Cliffs, NJ).
51. Ponceleón D.B. (1990), Barrier Methods for Large-scale Quadratic Programming, Ph.D. thesis, Stanford University, Stanford, California.
52. Powell M.J.D. (1972), ‘Problems related to unconstrained optimization’ in Numerical Methods for Unconstrained Optimization ( Murray W., ed.), Academic Press (London and New York), 29–55.
53. Powell M.J.D. (1990), ‘Karmarkar's algorithm: a view from nonlinear programming’ IMA Bulletin 26, 165–181.
54. Renegar J. (1988), ‘A polynomial-time algorithm based on Newton's method for linear programming’ Math. Program. 40, 59–94.
55. Rockafellar R. T. (1970), Convex Analysis, Princeton University Press (Princeton, NJ).
56. Roos C. and Vial J.-Ph. (1988), ‘A polynomial method of approximate centres for linear programming’ Report 88-68, Faculty of Mathematics and Informatics, Delft University of Technology, Delft, Holland. To appear in Math. Program.
57. Sonnevend G. (1986), ‘An analytic centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming’ in Lecture Notes in Control and Information Science, Vol. 84, Springer-Verlag (New York), 866–876.
58. Vanderbei R.J. (1991), ‘Symmetric quasi-definite matrices’ Report 91-10, Department of Civil Engineering and Operations Research, Princeton University, Princeton, New Jersey.
59. Wright M.H. (1976), Numerical Methods for Nonlinearly Constrained Optimization, Ph.D. thesis, Stanford University, California.
60. Wright M.H. (1991), ‘Determining subspace information from the Hessian of a barrier function’ Manuscript, AT&T Bell Laboratories, Murray Hill, New Jersey.