A comparative study of several semi-infinite nonlinear programming algorithms

DOI10.1016/0377-2217(88)90010-0zbMath0643.90079OpenAlexW1965209365MaRDI QIDQ1102202

Yoshihiro Tanaka, Masao Fukushima, Toshihide Ibaraki

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90010-0

zbMATH Keywords

global convergenceRobustnessrelative efficiencysuccessive quadratic programmingcomputational comparisonfeasible directionsemi-infinite nonlinear programming algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items

New descent rules for solving the linear semi-infinite programming problem, Identification of nonlinear systems using empirical data and prior knowledge -- An optimization approach, Solving nonlinear programming problems with very many constraints, On the numerical treatment of linearly constrained semi-infinite optimization problems, The stability of the maximum entropy method for nonsmooth semi-infinite programmings, A barrier function method for minimax problems, Computation of Lyapunov functions for smooth nonlinear systems using convex optimization, A reduction method for semi-infinite programming by means of a global stochastic approach†, Interior point filter method for semi-infinite programming problems, An \(\epsilon\)-active barrier-function method for solving minimax problems, Finite-termination schemes for solving semi-infinite satisfycing problems

Cites Work

• A recursive quadratic programming algorithm for semi-infinite optimization problems
• A globally convergent SQP method for semi-infinite nonlinear optimization
• A projected lagrangian algorithm for semi-infinite programming
• An exact penalty function for semi-infinite programming
• ImplementableL_∞penalty-function method for semi-infinite optimization
• An improved algorithm for optimization problems with functional inequality constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item