Interior-point methods for nonconvex nonlinear programming: Jamming and numerical testing

Mathematical Programming

Volumn 99, Issue 1, 2004, Pages 35-48

  Benson, Hande Y ^a   Shanno, David F ^b   Vanderbei, Robert J ^a  

^a PRINCETON UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Interior point methods; Jamming; Nonconvex optimization; Nonlinear programming

Indexed keywords

DIAGONAL MATRIX; HEURISTIC RESOLUTION; INTERIOR POINT METHODS (IPM); NONCONVEX OPTIMIZATION;

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; OPTIMIZATION;

NONLINEAR PROGRAMMING;

EID: 21044431770     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-003-0418-2     Document Type: Article

References (18)

1. Benson, H.Y., Shanno, D.F., Vanderbei, R.J.: Benchmarks comparing LOQO with SNOPT and NITRO on most problems in the cute/schittkowski test set.
2. Benson, H.Y., Shanno, D.F., Vanderbei, R.J.: LOQO parameter tuning on problems in the cute/schittkowski test set. www.princeton.edu/~rvdb/tuned.table.pdf
3. Bongartz, I., Conn, A.R., Gould, N., Toint, Ph.L.: Constrained and unconstrained testing environment. ACM Trans. MAth. Soft. 21(1), 123-160 (1995)
4. Byrd, R.H., Hribar, M.E., Nocedal, J.: An interior point algorithm for large scale nonlinear programming. SIAM J. Opt. 9(4), 877-900 (1999)
5. El-Bakry, A., Tapia, R., Tsuchiya, T., Zhang, Y.: On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optim. Theory and Appl. 89, 507-541 (1996)
6. Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrainted Minimization Techniques. Research Analysis Corporation, McLean Virginia, 1968. Republished in 1990 by SIAM, Philadelphia.
7. Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming. Scientific Press, 1993
8. Lustig, I.J., Marsten, R.E., Shanno, D.F.: Interior point methods for linear programming: computational state of the art. ORSA J. on Computing 6, 1-14 (1994)
9. Marazzi, M., Nocedal, J.: Feasibility control in nonlinear optimization. In A. DeVore, A. Iserles, and E. Suli, editors, Foundations of Computational Mathematics. London Mathematical Society Lecture Note Series 284, pages 125-154. Cambridge University Press, 2001
10. Polyak, R.A.: Modified barrier functions (theory and methods). Math. Prog. 54, 177-222 (1992)
11. Schittkowski, K.: More Test Samples for Nonlinear Programming codes. Springer Verlag, Berlin-Heidelberg-New York, 1987
12. Shanno, D.F., Vanderbei, R.J.: Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods. Math. Prog. 87(2), 303-316 (2000)
13. Simantiraki, E.M., Shanno, D.F.: An infeasible-interior-point method for linear complimentarity problems. SIAM J. Optimization 7, 620-640 (1997)
14. Simantiraki, E.M., Shanno, D.F.: An infeasible-interior-point method for solving mixed complimentarity problems. In M.C. Ferris and J.S. Pang, editors, Complementarity and Variational Problems: State of the Art, pages 366-400. SIAM, Philadelphia, 1997
15. Vanderbei, R.J.: AMPL models. www.sor.princeton.edu/~rvdb/ampl/nlmodels.
16. Vanderbei, R.J., Shanno, D.F.: An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231-252 (1999)
17. Wächter, A., Biegler, L.: Failure of global convergence for a class of interior point methods for nonlinear programming. Math. Prog. Series A 88(3), 565-574 (2000)
18. Ye, Y., Todd, M.J., Mizuno, S.: An o(√nl)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19, 53-67 (1994)