Global convergence and implementation of NGTN method for solving large-scale sparse nonlinear programming problems

Journal of Computational Mathematics

Volumn 19, Issue 4, 2001, Pages 337-346

  Ni, Q ^a  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

Author keywords

Large scale problem; Nonlinear programming; Sparse

Indexed keywords

CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; DATA STRUCTURES; GRADIENT METHODS; NONLINEAR PROGRAMMING; OPTIMIZATION;

LARGE-SCALE PROBLEM;

PROBLEM SOLVING;

EID: 0035392359     PISSN: 02549409     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. LANCELOT: A Fortran package for large-scale nonlinear optimization (release A)
2. A special Newton-type optimization method
3. A class of Newton type methods for equality and inequality constrained optimizatio
4. Test examples for nonlinear programming codes
5. On a class of hybrid methods for smooth constrained optimization
6. Hybrid methods for large sparse nonlinear least squares
7. General large-scale nonlinear programming using sequential quadratic programming methods
8. Truncated dual SQP method with limited memory
9. Truncated hybrid method for large-scale nonlinear sparse constrained optimization
10. A new efficient method for solving nonlinear programming problems with inequality constraints
11. A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs complementarity and variational inequality problems