A reduction method for semi-infinite programming by means of a global stochastic approach†

DOI10.1080/02331930701764072zbMath1167.90658OpenAlexW2048797438MaRDI QIDQ3391897

Ana Isabel P. N. Pereira, Edite M. G. P. Fernandes

Publication date: 13 August 2009

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1822/9681

zbMATH Keywords

exponential functionsimulated annealingsemi-infinite programmingreduction methodpenalty method

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56) Semi-infinite programming (90C34)

Related Items

Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ Reservoir computing for forecasting large spatiotemporal dynamical systems ⋮ Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints ⋮ Interior point filter method for semi-infinite programming problems

Cites Work

• An exact penalty function algorithm for semi-infinite programmes
• A comparative study of several semi-infinite nonlinear programming algorithms
• Globally convergent methods for semi-infinite programming
• Global optimization and simulated annealing
• A globally convergent SQP method for semi-infinite nonlinear optimization
• A multi-local optimization algorithm
• Simulated annealing for constrained global optimization
• Numerical experiments in semi-infinite programming
• Objective function stretching to alleviate convergence to local minima.
• Semi-Infinite Programming: Theory, Methods, and Applications
• A projected lagrangian algorithm for semi-infinite programming
• Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
• Local Convergence of SQP Methods in Semi-Infinite Programming
• Nonlinear programming without a penalty function.