An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
From MaRDI portal
Publication:4884046
DOI10.1137/0806025zbMath0858.49027MaRDI QIDQ4884046
No author found.
Publication date: 19 March 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/5427
discretization; algorithms; global convergence; sequential quadratic programming; semi-infinite programming; local convergence; line search; SQP method; many constraints; continuous minimax problems
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C34: Semi-infinite programming
Related Items
Algorithms with adaptive smoothing for finite minimax problems, On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems, Efficient interval partitioning for constrained global optimization, A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming, Approximation in normed linear spaces, Numerical experiments in semi-infinite programming, Deriving priorities from fuzzy pairwise comparison judgements, On the numerical treatment of linearly constrained semi-infinite optimization problems, Efficient interval partitioning-local search collaboration for constraint satisfaction, A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming, Investigating a hybrid simulated annealing and local search algorithm for constrained optimization, Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization, Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
