A superlinearly convergent primal-dual algorithm model for constrained optimization problems with bounded variables

Optimization Methods and Software

Volumn 14, Issue 1-2, 2000, Pages 49-73

  Di Pillo, G ^a   Lucidi, S ^a   Palagi, L ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Bound constraints; Nonlinear programming; Primal dual algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS; NONLINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

BOUND CONSTRAINTS; PRIMAL-DUAL ALGORITHMS;

CONSTRAINT THEORY;

EID: 0034451411     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780008805793     Document Type: Conference Paper

References (28)

1. Development of recursive quadratic programming methods based on the augmented Lagrangian
2. On the convergence of some constrained minimization algorithm based on the recursive quadratic programming
3. On the local behavior of an interior point method for nonlinear programming
4. A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
5. Truncated Newton algorithms for large scale unconstrained optimization
6. A characterization of superlinear convergence and its application to quasi-Newton methods
7. Exact penalty methods
8. An augmented Lagrangian for inequality constraints in nonlinear programming problems
9. A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems
10. An exact penalty function method with global convergence properties for nonlinear programming problems
11. Globally convergent exact penalty algorithms for constrained optimization
12. On exact augmented Lagrangian functions in nonlinear programming
13. An exact penalty-Lagrangian approach for a class of constrained optimization problems with bounded variables
14. A shifted-barrier primal-dual algorithm model for linearly constrained optimization problems
15. A superlinearly convergent primal-dual algorithm for constrained optimization problems with bounded variables
16. Minimization of SC1 functions and the Maratos effect
17. A class of methods for optimization problems with simple bounds
18. Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problem
19. A differentiable exact penalty function for bound constrained quadratic programming problems
20. On the class of hybrid methods for smooth constrained optimization
21. Differentiable piecewise quadratic exact penalty function for quadratic programs with simple bound constraints
22. New results on a continuously differentiable exact penalty function
23. A nonsmooth version of Newton's method
24. Superlinear convergence of a stabilized SQP method to a degenerate solution