A trust region method for nonlinear programming based on primal interior-point techniques

SIAM Journal on Scientific Computing

Volumn 20, Issue 1, 1998, Pages 282-305

  Plantenga, Todd ^a  

^a SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Barrier methods; Constrained optimization; Interior point algorithms; Large scale optimization; Nonlinear optimization; Trust region methods

Indexed keywords

PRIMAL INTERIOR-POINT TECHNIQUES;

ALGORITHMS; CODES (SYMBOLS); COMPUTER SOFTWARE; CONSTRAINT THEORY; MATRIX ALGEBRA; PROBLEM SOLVING;

NONLINEAR PROGRAMMING;

EID: 0032131454     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827595284403     Document Type: Article

References (6)

1. I. ADLER, M. G. C. RESENDE, AND G. VEIGA, An implementation of Karmarkar's algorithm for linear programming, Math. Programming (Ser. A), 44 (1989), pp. 297-335.
2. E. R. BARNES, A variation on Karmarkar's algorithm for solving linear programming problems, Math. Programming, 36 (1986), pp. 174-182.
3. J. T. BETTS AND P. D. FRANK, A sparse nonlinear optimization algorithm, J. Optim. Theory Appl., 82 (1994), pp. 519-541.
4. I. BONGARTZ, A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
5. R. H. BYRD, Robust trust region methods for constrained optimization, in Proc. Third SIAM Conference on Optimization, Houston, TX, May 1987.
6. R. H. BYRD, J. CH. GILBERT, AND J. NOCEDAL, A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming, Tech. Report OTC 96/02, Optimization Technology Center, Argonne National Laboratory and Northwestern University, Evanston, IL, 1996.