A projected lagrangian algorithm for semi-infinite programming

From MaRDI portal

Revision as of 08:19, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3690591

Jump to:navigation, search

DOI10.1007/BF01582053zbMath0572.90082OpenAlexW2086016098MaRDI QIDQ3690591

Ian D. Coope, G. Alistair Watson

Publication date: 1985

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582053

zbMATH Keywords

global convergence second order convergence exact penalty method active set strategy descent algorithm nonlinear semi-infinite optimization projected Lagrangian algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Semi-infinite programming (90C34)

Related Items (38)

New descent rules for solving the linear semi-infinite programming problem ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Global convergence of a robust smoothing SQP method for semi-infinite programming ⋮ Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming ⋮ An interior semi-infinite programming method ⋮ A comparative study of several semi-infinite nonlinear programming algorithms ⋮ A homotopy interior point method for semi-infinite programming problems ⋮ A review of reliable maximum likelihood algorithms for semiparametric mixture models ⋮ A logarithmic barrier cutting plane method for convex programming ⋮ An exact penalty function for semi-infinite programming ⋮ Relaxation methods for solving linear inequality systems: converging results ⋮ 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 one-phase algorithm for semi-infinite linear programming ⋮ Global convergence of a semi-infinite optimization method ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ Solving semi-infinite programs by smoothing projected gradient method ⋮ A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ⋮ A barrier function method for minimax problems ⋮ A purification algorithm for semi-infinite programming ⋮ A parallel algorithm for semi-infinite programming ⋮ A relaxation method for solving systems with infinitely many linear inequalities ⋮ Logarithmic Barrier Decomposition Methods for Semi-infinite Programming ⋮ A new smoothing Newton-type algorithm for semi-infinite programming ⋮ A smoothing Newton method for semi-infinite programming ⋮ Global solution of semi-infinite programs ⋮ Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems ⋮ A smoothing projected Newton-type algorithm for semi-infinite programming ⋮ An iterative method for solving KKT system of the semi-infinite programming ⋮ A globally convergent SQP method for semi-infinite nonlinear optimization ⋮ A multi-local optimization algorithm ⋮ An exact penalty function algorithm for semi-infinite programmes ⋮ Numerical experiments in semi-infinite programming ⋮ A reduction method for semi-infinite programming by means of a global stochastic approach† ⋮ An extension of the simplex algorithm for semi-infinite linear programming ⋮ Interior point filter method for semi-infinite programming problems ⋮ Rate of convergence of a class of numerical methods solving linear inequality systems ⋮ On Fast Computation of the Non-Parametric Maximum Likelihood Estimate of a Mixing Distribution

Cites Work

This page was built for publication: A projected lagrangian algorithm for semi-infinite programming

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3690591&oldid=17174329"