A projected Lagrangian algorithm for semi-infinite programming
The authors consider nonlinear semi-infinite optimization problems of type min\(\{\) f(a)\(|\) g(x,a)\(\leq 0\) for all \(x\in X\}\) with a box \(X\subset {\mathbb{R}}^ N\), and \(C^ 2\)-functions f, g. Under appropriate regularity assumptions one may consider the local maxima (w.r.t. variable x) of g(x,a) as functions \(x^ i(a)\) of a, and the problem can be replaced locally around every \(a^ o\) by a finite optimization problem min \(\{\) f(a)\(|\) \(g(x^ i(a),a)\leq 0\), \(i=1,...,k\}\). Here, the number k of functions \(x^ i(a)\) will depend on \(a^ o\), i.e. the number and form of the constraints in the finite problem depends on a. Therefore, each nonlinear programming algorithm may be applied to the semi-infinite problem if it is combined with a suitable active set strategy to detect changes in the set of local maxima of g(x,a). In the paper such an algorithm based on an exact penalty method is presented and discussed by a number of numerical examples.
- scientific article; zbMATH DE number 3950219
- Nonlinear Lagrangian functions and applications to semi-infinite programs
- An exact penalty function algorithm for semi-infinite programmes
- ImplementableL∞penalty-function method for semi-infinite optimization
- Investigating semi-infinite programs using penalty functions and Lagrangian methods
- A globally convergent method for nonlinear programming
- A lower bound for the controlling parameters of the exact penalty functions
- A New Approach to Lagrange Multipliers
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- Globally convergent methods for semi-infinite programming
- scientific article; zbMATH DE number 3644817 (Why is no real title available?)
- scientific article; zbMATH DE number 3814882 (Why is no real title available?)
- scientific article; zbMATH DE number 3822547 (Why is no real title available?)
- scientific article; zbMATH DE number 3744430 (Why is no real title available?)
- scientific article; zbMATH DE number 3632235 (Why is no real title available?)
- scientific article; zbMATH DE number 3634031 (Why is no real title available?)
- On the Computational Solution of a Class of Generalized Moment Problems
- Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
- A smoothing projected Newton-type algorithm for semi-infinite programming
- An interior semi-infinite programming method
- A comparative study of several semi-infinite nonlinear programming algorithms
- A barrier function method for minimax problems
- A purification algorithm for semi-infinite programming
- A globally convergent SQP method for semi-infinite nonlinear optimization
- A multi-local optimization algorithm
- New descent rules for solving the linear semi-infinite programming problem
- A smoothing Newton method for semi-infinite programming
- Global solution of semi-infinite programs
- Numerical experiments in semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- A review of reliable maximum likelihood algorithms for semiparametric mixture models
- A logarithmic barrier cutting plane method for convex programming
- Relaxation methods for solving linear inequality systems: converging results
- An augmented Lagrangian algorithm for solving semiinfinite programming
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- A homotopy interior point method for semi-infinite programming problems
- The constrained Fisher scoring method for maximum likelihood computation of a nonparametric mixing distribution
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- An exponent Lagrangian for solving semi-infinite programming problems
- Interior point filter method for semi-infinite programming problems
- Rate of convergence of a class of numerical methods solving linear inequality systems
- An iterative method for solving KKT system of the semi-infinite programming
- A reduction method for semi-infinite programming by means of a global stochastic approach†
- scientific article; zbMATH DE number 3950219 (Why is no real title available?)
- An exact penalty function for semi-infinite programming
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- scientific article; zbMATH DE number 16625 (Why is no real title available?)
- scientific article; zbMATH DE number 123651 (Why is no real title available?)
- Investigating semi-infinite programs using penalty functions and Lagrangian methods
- Solving semi-infinite programs by smoothing projected gradient method
- An extended projective formula and its application to semidefinite optimization
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- On Fast Computation of the Non-Parametric Maximum Likelihood Estimate of a Mixing Distribution
- Polynomial optimization relaxations for generalized semi-infinite programs
- A relaxation method for solving systems with infinitely many linear inequalities
- A global approach for generalized semi-infinite programs with polyhedral parameter sets
- An exact penalty function algorithm for semi-infinite programmes
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- A one-phase algorithm for semi-infinite linear programming
- Global convergence of a semi-infinite optimization method
- A parallel algorithm for semi-infinite programming
- A new smoothing Newton-type algorithm for semi-infinite programming
This page was built for publication: A projected Lagrangian algorithm for semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690591)