Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
In this paper, we propose an augmented Lagrangian method with Backtracking Line Search for solving nonconvex composite optimization problems including both nonlinear equality and inequality constraints. In case the variable spaces are homogeneous, our setting yields a generic nonlinear mathematical programming model. When some variables belong to the real Hilbert space and others to the integer space, one obtains a nonconvex mixed-integer/-binary nonlinear programming model for which the nonconvexity is not limited to the integrality constraints. Together with the formal proof of its iteration complexity, the proposed algorithm is then numerically evaluated to solve a multi-constrained network design problem. Extensive numerical executions on a set of instances extracted from the SNDlib repository are then performed to study its behavior and performance as well as identify potential improvement of this method. Finally, analysis of the results and their comparison against those obtained when solving its convex relaxation using mixed-integer programming solvers are reported.
An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
In this paper, we propose an augmented Lagrangian method with Backtracking Line Search for solving nonconvex composite optimization problems including both nonlinear equality and inequality constraints. In case the variable spaces are homogeneous, our setting yields a generic nonlinear mathematical programming model. When some variables belong to the real Hilbert space and others to the integer space, one obtains a nonconvex mixed-integer/-binary nonlinear programming model for which the nonconvexity is not limited to the integrality constraints. Together with the formal proof of its iteration complexity, the proposed algorithm is then numerically evaluated to solve a multi-constrained network design problem. Extensive numerical executions on a set of instances extracted from the SNDlib repository are then performed to study its behavior and performance as well as identify potential improvement of this method. Finally, analysis of the results and their comparison against those obtained when solving its convex relaxation using mixed-integer programming solvers are reported.
An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
Optim Eng
Papadimitriou, Dimitri (Autor:in) / Vũ, Bằng Công (Autor:in)
Optimization and Engineering ; 25 ; 1921-1990
01.12.2024
70 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Nonlinear optimization , Constrained optimization , Augmented Lagrangian , Nonconvex , Mixed-integer , Network design Mathematics , Optimization , Engineering, general , Systems Theory, Control , Environmental Management , Operations Research/Decision Theory , Financial Engineering , Mathematics and Statistics
An augmented Lagrangian optimization method for inflatable structures analysis problems
| British Library Online Contents | 2006
Block-separable linking constraints in augmented Lagrangian coordination
| British Library Online Contents | 2009
An augmented Lagrangian optimization method for contact analysis problems, 2: numerical evaluation
| British Library Online Contents | 2004