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.49027OpenAlexW4238030832MaRDI 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
discretizationalgorithmsglobal convergencesequential quadratic programmingsemi-infinite programminglocal convergenceline searchSQP methodmany constraintscontinuous minimax problems
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Semi-infinite programming (90C34)
Related Items (27)
Deriving priorities from fuzzy pairwise comparison judgements ⋮ Algorithms with adaptive smoothing for finite minimax problems ⋮ PyOpt: a python-based object-oriented framework for nonlinear constrained optimization ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization ⋮ Cubic spline interpolation with optimal end conditions ⋮ An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems ⋮ A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems ⋮ Solving kinematics problems by efficient interval partitioning ⋮ 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 ⋮ 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 ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems ⋮ Efficient interval partitioning for constrained global optimization ⋮ A spline smoothing Newton method for finite minimax problems ⋮ On solving large-scale finite minimax problems using exponential smoothing ⋮ A truncated aggregate smoothing Newton method for minimax problems ⋮ Numerical experiments in semi-infinite programming ⋮ New exact penalty function for solving constrained finite min-max problems ⋮ An active set smoothing method for solving unconstrained minimax problems ⋮ Error bounds of two smoothing approximations for semi-infinite minimax problems ⋮ Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization ⋮ Approximation in normed linear spaces ⋮ On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
This page was built for publication: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
