Interior-point method for non-linear non-convex optimization

Numerical Linear Algebra with Applications

Volumn 11, Issue 5-6, 2004, Pages 431-453

  Lukšan, Ladislav ^a,b   Matonoha, Ctirad ^c   Vlček, Jan ^c  

^a INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

^b TECHNICAL UNIVERSITY OF LIBEREC   (Czech Republic)

^c NONE

Author keywords

Algorithms; Computational experiments; Indefinite preconditioners; Indefinite systems; Interior point methods; Merit functions; Non linear programming; Preconditioned conjugate gradient method

Indexed keywords

EID: 10044222210     PISSN: 10705325     EISSN: None     Source Type: Journal    
DOI: 10.1002/nla.354     Document Type: Article

References (33)

1. El-Bakry A, Tapia R, Tsuchiya T, Zhang Y. On the formulation and theory of Newton interior-point method for non-linear programming. Journal of Optimization Theory and Applications 1996; 89:507-541.
2. Wright MH. Interior methods for constrained optimization. Acta Numerica 1992; 1:341-407.
3. Ye Y. Interior Point Algorithms - Theory and Analysis. Wiley-Interscience Publication: New York, 1997.
4. Benson HY, Shanno DF, Vanderbei J. Interior-point methods for non-convex non-linear programming: jamming and numerical testing. Report No. ORFE-00-02, Operations Research and Financial Engineering, Princeton University, August 2000.
5. Shanno DF, Vanderbei J. Interior-point methods for non-convex non-linear programming: orderings and higher-order methods. Mathematical Programming 2000; 87:303-316.
6. Vanderbei J, Shanno DF. An interior point algorithm for non-convex non-linear programming. Computational Optimization and Applications 1999; 13:231-252.
7. Vanderbei J, Shanno DF. Interior-point methods for non-convex non-linear programming: filter methods and merit functions. Report No. ORFE-00-06, Operations Research and Financial Engineering, Princeton University, December 2000.
8. Lukšan L, Tüma M, Šiška M, Vlček J, Ramešová N. UFO 2002-Interactive system for universal functional optimization. Technical Report V-883, Institute of Computer Science, Academy of Sciences, Prague, ICS AS CR, 2002.
9. Lukšan L, Vlček J. Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems. Numerical Linear Algebra with Applications 1998; 5:219-247.
10. Lukšan L, Vlček J. Numerical experience with iterative methods for equality constrained non-linear programming problems. Optimization Methods and Software 2001; 16:257-287.
11. Axelsson O, Neytcheva M. Preconditioning methods for linear systems with saddle point matrices. Lecture Notes in Computer Science 2002; 2331:784-793.
12. Axelsson O, Neytcheva M. Preconditioning methods for linear systems arising in constrained optimization problems. Numerical Linear Algebra with Applications 2003; 10:1-26.
13. Bergamaschi L, Gondzio J, Zilli G. Preconditioning indefinite systems in interior point methods for optimization. Report No. MS-02-001, Department of Mathematics and Statistics, University of Edinburgh, July 2002.
14. Durazzi C, Ruggiero V. Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems. Numerical Linear Algebra with Applications 2003; 10:673-688.
15. Keller C, Gould NIM, Wathen AJ. Constraint preconditioning for indefinite linear systems. SIAM Journal on Matrix Analysis and Applications 2000; 21:1300-1317.
16. Perugia I, Simoncini V. Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations. Numerical Linear Algebra with Applications 2000; 7:1-32.
17. Rozložník M, Simoncini V. Short-term recurrences for indefinite preconditioning of saddle point problems. Report No. SAM 2000-08, SAM, ETH Zurich, 2000.
18. Lukšan L, Vlček J. Interior-point method for non-linear non-convex optimization. Technical Report v-836, Prague, ICS AS CR, 2001 (see http://www.cs.cas.cz/̃luksan/reports.html).
19. Dembo RS, Steihaug T. Truncated Newton algorithms for large-scale optimization. Mathematical Programming 1983; 26:190-212.
20. Tikhonov AN, Arsenin VY. Solutions of Ill-posed Problems. Winston: Washington, DC, 1977.
21. Gill PE, Murray W. Newton type methods for nconstrained and linearly constrained optimization. Mathematical Programming 1974; 7:311-350.
22. Duff IS, Munksgaard M, Nielsen HB, Reid JK. Direct solution of sets of linear equations whose matrix is sparse and indefinite. Journal of the Institute of Mathematics and its Applications 1979; 23:235-250.
23. Vassilevski PS, Lazarov D. Preconditioning mixed finite element saddle-point elliptic problems. Numerical Linear Algebra with Applications 1996; 3:1-20.
24. Axelsson O. Preconditioning of indefinite problems by regularization. SIAM Journal on Numerical Analysis 1979; 16:58-69.
25. Baryamureeba V, Steihaug T. On the convergence of an inexact primal-dual interior point method for linear programming. Report No. 188, Department of Informatics, University of Bergen, 2000.
26. Bellavia S. Inexact interior point method. Journal of Optimization Theory and Applications 1998; 96:109-121.
27. Argaez M, Tapia RA, Velasquez L. Numerical comparison of path-following strategies for a basic interior-point method for non-linear programming. Report No. CRPC-TR9777-S, Center for Research on Parallel Computation, Rice University, Houston 1998.
28. Byrd RH, Liu G, Nocedal J. On the local behavior of an interior point method for non-linear programming. In Numerical Analysis 1997, Griffiths DF, Higham DJ (eds). Addison-Wesley, Longman: Reading, MA, New York, 1998; 37-56.
29. Curtis AR, Powell MJD, Reid JK. On the estimation of sparse Jacobian matrices. IMA Journal of Applied Mathematics 1974; 13:117-119.
30. Lukšan L, Vlček J. Sparse and partially separable test problems for unconstrained and equality constrained optimization. Report V-767. Prague, ICS AS CR, 1998.
31. Bongartz I, Conn AR, Gould N, Toint PL. CUTE: constrained and unconstrained testing environment. ACM Transactions on Mathematical Software 1995; 21:123-160.
32. Vicente LN, Wright SJ. Local convergence of a primal-dual method for degenerate non-linear programming. SIAM Journal on Optimization 2002; 22:311-328.
33. Byrd RH, Nocedal J, Waltz RA. Feasible interior methods using slacks for non-linear optimization. Report No. OTC 2000/11, Optimization Technology Center, December 2000.