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):
Displaying 33 items.
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- Solving quality control problems with an algorithm for minimax programs with coupled constraints (Q336795) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Algorithms with adaptive smoothing for finite minimax problems (Q597184) (← links)
- 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)
- Error bounds of two smoothing approximations for semi-infinite minimax problems (Q1048250) (← links)
- First-order algorithms for generalized semi-infinite min-max problems (Q1294822) (← 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 adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems (Q1935267) (← 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)
- Global solution of semi-infinite programs with existence constraints (Q2031944) (← links)
- A spline smoothing Newton method for semi-infinite minimax problems (Q2336781) (← links)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Pattern search methods for finite minimax problems (Q2380874) (← 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)
- Variable programming: a generalized minimax problem. II: Algorithms (Q2488054) (← links)
- Second-order algorithms for generalized finite and semi-infinite min-max problems (Q2719234) (← links)
- An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
- A DIRECT SEARCH QUASI-NEWTON METHOD FOR NONSMOOTH UNCONSTRAINED OPTIMIZATION (Q4608945) (← links)
- Preface (Q5965505) (← links)
