An exact penalty function for semi-infinite programming

DOI10.1007/BF02591681zbMath0623.90069OpenAlexW2069149672MaRDI QIDQ3762085

Nicholas I. M. Gould, Andrew R. Conn

Publication date: 1987

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

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

zbMATH Keywords

merit functionnonlinear semi-infinite programmingquadratic approximationsexact penalty functionnonconvex case

Mathematics Subject Classification ID

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

Related Items

Exact penalty functions in single-stage stochastic programming¹, Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function, Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions, Solving air traffic conflict problems via local continuous optimization, A comparative study of several semi-infinite nonlinear programming algorithms, A homotopy interior point method for semi-infinite programming problems, On the convergence of a smoothed penalty algorithm for semi-infinite programming, On nondifferentiable semi-infinite multiobjective programming with interval-valued functions, A one-phase algorithm for semi-infinite linear programming, An augmented Lagrangian algorithm for solving semiinfinite programming, Global convergence of a semi-infinite optimization method, The stability of the maximum entropy method for nonsmooth semi-infinite programmings, A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming, A barrier function method for minimax problems, Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems, A globally convergent SQP method for semi-infinite nonlinear optimization, An exact penalty function algorithm for semi-infinite programmes, Numerical experiments in semi-infinite programming, Distributionally robust optimization. A review on theory and applications

Cites Work

• Globally convergent methods for semi-infinite programming
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• The potential method for conditional maxima in the locally compact metric spaces
• A note on the computation of an orthonormal basis for the null space of a matrix
• A projected lagrangian algorithm for semi-infinite programming
• A Penalty Function Method Converging Directly to a Constrained Optimum
• An Exact Potential Method for Constrained Maxima
• Convex Analysis
• Approximate reduction of the problem of determining a maximin to the problem of determining a maximum by means of penalty functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item