Pages that link to "Item:Q597183"
From MaRDI portal
The following pages link to Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques (Q597183):
Displayed 14 items.
- An aggregate deformation homotopy method for min-max-min problems with max-min constraints (Q616792) (← links)
- Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming (Q836067) (← links)
- A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems (Q839044) (← links)
- Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
- A smoothing algorithm for finite min-max-min problems (Q1001326) (← links)
- Reference variable methods of solving min-Max optimization problems (Q1024824) (← links)
- Sufficient optimality and sensitivity analysis of a parameterized min-max programming (Q1760808) (← links)
- Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints (Q1762397) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- An entropy based central cutting plane algorithm for convex min-Max semi-infinite programming problems (Q1935707) (← links)
- Convergence of an interior point algorithm for continuous minimax (Q1956470) (← links)
- Interval method for global solutions of a class of min-max-min problems (Q2479123) (← links)
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)