Numerical experiments in semi-infinite programming

DOI10.1007/BF00249645zbMath0860.90118OpenAlexW2029721662MaRDI QIDQ1816403

Ian D. Coope, Price, C. J.

Publication date: 26 November 1996

Published in: Computational Optimization and Applications (Search for Journal in Brave)

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

zbMATH Keywords

quasi-Newton algorithm\(L_ \infty\) exact penalty function

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items

A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems, On the convergence of a smoothed penalty algorithm for semi-infinite programming, Global convergence of a class of smooth penalty methods for semi-infinite programming, On the numerical treatment of linearly constrained semi-infinite optimization problems, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems, Generalized semi-infinite programming: Theory and methods, A multi-local optimization algorithm, A reduction method for semi-infinite programming by means of a global stochastic approach†, Interior point filter method for semi-infinite programming problems, Approximation in normed linear spaces, A fast algorithm for the optimal design of high accuracy windows in signal processing

Cites Work

• An exact penalty function algorithm for semi-infinite programmes
• On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals
• The obstacle problem for an elastoplastic body
• Globally convergent methods for semi-infinite programming
• A globally convergent SQP method for semi-infinite nonlinear optimization
• Discretization methods for the solution of semi-infinite programming problems
• A two-parameter exact penalty function for nonlinear programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
• A projected lagrangian algorithm for semi-infinite programming
• An implementation of a discretization method for semi-infinite programming
• An exact penalty function for semi-infinite programming
• An improved algorithm for optimization problems with functional inequality constraints
• A surperlinearly convergent algorithm for constrained optimization problems
• An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions