An augmented Lagrangian algorithm for solving semiinfinite programming
Summary: We present a smooth augmented Lagrangian algorithm for semiinfinite programming (SIP). For this algorithm, we establish a perturbation theorem under mild conditions. As a corollary of the perturbation theorem, we obtain the global convergence result, that is, any accumulation point of the sequence generated by the algorithm is the solution of SIP. We get this global convergence result without any boundedness condition or coercive condition. Another corollary of the perturbation theorem shows that the perturbation function at zero point is lower semi-continuous if and only if the algorithm forces the sequence of objective function convergence to the optimal value of SIP. Finally, numerical results are given.
- On the convergence of a smoothed penalty algorithm for semi-infinite programming
- Augmented lagrangians in semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
- Global convergence of a class of smooth penalty methods for semi-infinite programming
- A projected lagrangian algorithm for semi-infinite programming
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A smoothing Newton method for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- An exact penalty function for semi-infinite programming
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Augmented lagrangians in semi-infinite programming
- Differentiability and semismoothness properties of integral functions and their applications
- Discretization in semi-infinite programming: the rate of convergence
- Global solution of semi-infinite programs
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3331230 (Why is no real title available?)
- Nonlinear Lagrangian functions and applications to semi-infinite programs
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On the convergence of the exponential multiplier method for convex programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semismooth Newton methods for solving semi-infinite programming problems
- The smoothed-penalty algorithm for state constrained optimal control problems for partial differential equations
- Exact augmented Lagrangian functions for nonlinear semidefinite programming
- Global convergence of a class of smooth penalty methods for semi-infinite programming
- Continuous regularized least squares polynomial approximation on the sphere
- On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming
- A proximal augmented method for semidefinite programming problems
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems
- On the cost of solving augmented Lagrangian subproblems
- An exponent Lagrangian for solving semi-infinite programming problems
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
- On the convergence of a smoothed penalty algorithm for semi-infinite programming
- scientific article; zbMATH DE number 1322760 (Why is no real title available?)
- scientific article; zbMATH DE number 2068039 (Why is no real title available?)
- Smoothing approximation to the new exact penalty function with two parameters
- A note on embeddings for the Augmented Lagrange Method
- An Augmented Lagrangian‐Based Approach to the Oseen Problem
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- Augmented lagrangians in semi-infinite programming
This page was built for publication: An augmented Lagrangian algorithm for solving semiinfinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1952762)
