Sequential equality-constrained optimization for nonlinear programming

A novel idea is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of sequential quadratic programming and sequential linearly-constrained programming, the new proposed approach approximately solves, at each iteration, an equality-constrai...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational optimization and applications Ročník 65; číslo 3; s. 699 - 721
Hlavní autoři: Birgin, E. G., Bueno, L. F., Martínez, J. M.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.12.2016
Springer Nature B.V
Témata:
Algorithms
Applied mathematics
Computation
Convergence
Convex and Discrete Geometry
Experiments
Iterative methods
Linear programming
Management Science
Mathematical models
Mathematics
Mathematics and Statistics
Methods
Nonlinear programming
Operations Research
Operations Research/Decision Theory
Optimization
Optimization algorithms
Programming
Quadratic programming
Statistics
Studies
Sequential equality-constrained optimization
Nonlinear programming
Numerical experiments
Augmented Lagrangian
ISSN:0926-6003, 1573-2894
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A novel idea is proposed for solving optimization problems with equality constraints and bounds on the variables. In the spirit of sequential quadratic programming and sequential linearly-constrained programming, the new proposed approach approximately solves, at each iteration, an equality-constrained optimization problem. The bound constraints are handled in outer iterations by means of an augmented Lagrangian scheme. Global convergence of the method follows from well-established nonlinear programming theories. Numerical experiments are presented.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0926-6003
1573-2894
DOI:10.1007/s10589-016-9849-6