An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
From MaRDI portal
Publication:4884046
Recommendations
Cited in
(29)- PyOpt: a python-based object-oriented framework for nonlinear constrained optimization
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- scientific article; zbMATH DE number 7338817 (Why is no real title available?)
- On solving large-scale finite minimax problems using exponential smoothing
- An active set smoothing method for solving unconstrained minimax problems
- On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax 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
- Deriving priorities from fuzzy pairwise comparison judgements
- Investigating a hybrid simulated annealing and local search algorithm for constrained optimization
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- Efficient interval partitioning-local search collaboration for constraint satisfaction
- A truncated aggregate smoothing Newton method for minimax problems
- Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems
- A superlinearly convergent sequential quadratic programming algorithm for minimax problems
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- Algorithms with adaptive smoothing for finite minimax problems
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- New exact penalty function for solving constrained finite min-max problems
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- A spline smoothing Newton method for finite minimax problems
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization
- Solving kinematics problems by efficient interval partitioning
- Cubic spline interpolation with optimal end conditions
- Numerical experiments in semi-infinite programming
This page was built for publication: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4884046)
