A sequential linear constraint programming algorithm for NLP

SIAM Journal on Optimization

Volumn 22, Issue 3, 2012, Pages 772-794

  Fletcher, Roger ^a  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

Author keywords

Filter; Linear constraint programming; Nonlinear programming; Robinson's method; Spectral gradient method

Indexed keywords

APPROXIMATE HESSIANS; FILTER; FIRST DERIVATIVE; LINEAR CONSTRAINTS; OPEN SOURCES; PRODUCTION QUALITY; REDUCED HESSIAN; ROBINSON; SPECTRAL GRADIENT METHOD; SUB-PROBLEMS; TEST PROBLEM; TRUST REGION;

COMPUTER PROGRAMMING; GRADIENT METHODS; NONLINEAR PROGRAMMING; OPEN SYSTEMS;

CONSTRAINT THEORY;

EID: 84867301119     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/110844362     Document Type: Article

References (12)

1. R. H. Byrd, N. I. M. Gould, J. Nocedal, and R. A. Waltz, An active-set algorithm for nonlinear programming using linear programming and equality constrained subproblems, Math. Programming B, 100 (2004), pp. 27-48.
2. C. M. Chin and R. Fletcher, On the global convergence of an SLP-filter algorithm that takes EQP steps, Math. Programming, 96 (2003), pp. 161-177.
3. R. Fletcher, Practical Methods of Optimization, Wiley, Chichester, 1987.
4. R. Fletcher, Dense factors of sparse matrices, in Approximation Theory and Optimization, M. D. Buhmann and A. Iserles, eds., Cambridge University Press, Cambridge, 1997.
5. R. Fletcher, Block triangular orderings and factors for sparse matrices in LP, in Numerical analysis 1997, D. F. Griffiths, D. J. Higham, and G. A. Watson, eds., Pitman Res. Notes in Math. 380, Longman, Harlow, 1998, pp. 91-110.
6. R. Fletcher, A limited memory steepest descent method, Math. Programming, DOI 10.1007/s10107-011-0479-6, (2011), 26 pp.
7. R. Fletcher and S. Leyffer, Nonlinear programming without a penalty function, Math. Programming, 91 (2002), pp. 239-270.
8. R. Fletcher, S. Leyffer, and Ph. L. Toint, On the global convergence of a filter-SQP algorithm, SIAM J. Optim., 13 (2002), pp. 44-59.
9. R. Fletcher and E. Sainz de la Maza, Nonlinear programming and nonsmooth optimization by successive linear programming, Math. Programming, 43 (1989), pp. 235-256.
10. B. A. Murtagh and M. A. Saunders, A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints, Math. Programming Stud., 16 (1982), pp. 84-117.
11. S. M. Robinson, A quadratically convergent method for general nonlinear programming problems, Math. Programming, 3 (1972), pp. 145-156.
12. P. Wolfe, A technique for resolving degeneracy in linear programming, J. Soc. Indust. Appl. Math., 11 (1963), pp. 205-211.