Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
From MaRDI portal
Recommendations
- Algorithms with adaptive smoothing for finite minimax problems
- A smoothing algorithm for finite min-max-min problems
- scientific article; zbMATH DE number 2068041
- An adaptive smoothing method for continuous minimax problems
- A smooth method for the finite minimax problem
- A smoothing iterative method for the finite minimax problem
- A smoothing scheme for optimization problems with max-min constraints
- Smooth Optimization Methods for Minimax Problems
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- Adaptive methods for solvings minimax problems∗
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 2068041 (Why is no real title available?)
- scientific article; zbMATH DE number 1421092 (Why is no real title available?)
- scientific article; zbMATH DE number 2221947 (Why is no real title available?)
- A cut-map algorithm for design problems with parameter tolerances and tuning
- A nonlinear programming approach to optimal design centering, tolerancing, and tuning
- Algorithms for optimization problems with exclusion constraints
- Algorithms with adaptive smoothing for finite minimax problems
- On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
- On the optimal design centering, tolerancing, and tuning problem
- Optimization. Algorithms and consistent approximations
- Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem
- Variational Analysis
Cited in
(36)- Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Diagonal bundle method for nonsmooth sparse optimization
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- An adaptive smoothing method for continuous minimax problems
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- A direct search quasi-Newton method for nonsmooth unconstrained optimization
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- Pattern search methods for finite minimax problems
- scientific article; zbMATH DE number 2068041 (Why is no real title available?)
- Variable programming: a generalized minimax problem. II: Algorithms
- Reference variable methods of solving min-Max optimization problems
- Global solution of semi-infinite programs with existence constraints
- Interval method for global solutions of a class of min-max-min problems
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
- A smoothing algorithm for finite min-max-min problems
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming
- An efficient algorithm for \(\min\)-\(\max\) convex semi-infinite programming problems
- Algorithms with adaptive smoothing for finite minimax problems
- Convergence of an interior point algorithm for continuous minimax
- Sufficient optimality and sensitivity analysis of a parameterized min-max programming
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- A spline smoothing Newton method for semi-infinite minimax problems
- A new trust region method for nonsmooth nonconvex optimization
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems
- Second-order algorithms for generalized finite and semi-infinite min-max problems
- An effective adaptive trust region algorithm for nonsmooth minimization
- Solving quality control problems with an algorithm for minimax programs with coupled constraints
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints
- Preface
This page was built for publication: Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q597183)
