A projected lagrangian algorithm for semi-infinite programming
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- A New Approach to Lagrange Multipliers
- A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization
- A globally convergent method for nonlinear programming
- A lower bound for the controlling parameters of the exact penalty functions
- Globally convergent methods for semi-infinite programming
- 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
Cited in
(48)- A parallel algorithm for semi-infinite programming
- A reduction method for semi-infinite programming by means of a global stochastic approach†
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- Investigating semi-infinite programs using penalty functions and Lagrangian methods
- A relaxation method for solving systems with infinitely many linear inequalities
- An exact penalty function for semi-infinite programming
- Numerical experiments in semi-infinite programming
- A multi-local optimization algorithm
- scientific article; zbMATH DE number 16625 (Why is no real title available?)
- A logarithmic barrier cutting plane method for convex programming
- Interior point filter method for semi-infinite programming problems
- Solving semi-infinite programs by smoothing projected gradient method
- scientific article; zbMATH DE number 123651 (Why is no real title available?)
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- Global convergence of a robust smoothing SQP method for semi-infinite programming
- The constrained Fisher scoring method for maximum likelihood computation of a nonparametric mixing distribution
- A one-phase algorithm for semi-infinite linear programming
- A review of reliable maximum likelihood algorithms for semiparametric mixture models
- A new smoothing Newton-type algorithm for semi-infinite programming
- A smoothing projected Newton-type algorithm for semi-infinite programming
- An extended projective formula and its application to semidefinite optimization
- An exponent Lagrangian for solving semi-infinite programming problems
- A globally convergent SQP method for semi-infinite nonlinear optimization
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- An exact penalty function algorithm for semi-infinite programmes
- A smoothing Newton method for semi-infinite programming
- Global solution of semi-infinite programs
- Relaxation methods for solving linear inequality systems: converging results
- Global convergence of a semi-infinite optimization method
- Rate of convergence of a class of numerical methods solving linear inequality systems
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- An augmented Lagrangian algorithm for solving semiinfinite programming
- On Fast Computation of the Non-Parametric Maximum Likelihood Estimate of a Mixing Distribution
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A purification algorithm for semi-infinite programming
- Polynomial optimization relaxations for generalized semi-infinite programs
- scientific article; zbMATH DE number 3950219 (Why is no real title available?)
- A homotopy interior point method for semi-infinite programming problems
- A barrier function method for minimax problems
- New descent rules for solving the linear semi-infinite programming problem
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
- Logarithmic Barrier Decomposition Methods for Semi-infinite Programming
- An iterative method for solving KKT system of the semi-infinite programming
- An interior semi-infinite programming method
- A comparative study of several semi-infinite nonlinear programming algorithms
- A global approach for generalized semi-infinite programs with polyhedral parameter sets
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)
