Smooth Optimization Methods for Minimax Problems

Recommendations

scientific article; zbMATH DE number 3911152
scientific article; zbMATH DE number 4164577
Smoothing method for minimax problems
Optimal methods of smooth convex minimization
A smooth method for the finite minimax problem
A smoothing scheme for optimization problems with max-min constraints
scientific article; zbMATH DE number 2068041
Minimization methods for smooth nonconvex functions
Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
A smoothing iterative method for the finite minimax problem

Cited in

(55)

Error bounds of two smoothing approximations for semi-infinite minimax problems
Solution of minimax problems using equivalent differentiable functions
Modified barrier functions (theory and methods)
Nondifferentiable optimization via smooth approximation: General analytical approach
Smooth minimization of non-smooth functions
Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
Nonmonotone line search for minimax problems
A new computational method for the functional inequality constrained minimax optimization problem
On the entropic regularization method for solving min-max problems with applications
Perturbing the dual feasible region for solving convex quadratic programs
Smooth transformation of the generalized minimax problem
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
Solving minimax problems: local smoothing versus global smoothing
An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems
A dual algorithm for minimax problems
Solving min-max problems and linear semi-infinite programs
Finite-sum smooth optimization with SARAH
Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions
Robust equilibrium in transportation networks
A nonlinear Lagrangian based on Fischer-Burmeister NCP function
Pattern search methods for finite minimax problems
On the resolution of certain discrete univariate max-min problems
Further study on a dual algorithm
Variable programming: a generalized minimax problem. II: Algorithms
An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
Minimal realization and dynamic properties of optimal smoothers
Adaptive methods for solvings minimax problems^∗
Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique
A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
scientific article; zbMATH DE number 4164577 (Why is no real title available?)
A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM
Robust optimal control: Low-error operation for the longest time
A derivative-free approximate gradient sampling algorithm for finite minimax problems
scientific article; zbMATH DE number 3911152 (Why is no real title available?)
Dual Techniques for Minimax
On smooth reformulations and direct non-smooth computations for minimax problems
A nonlinear augmented Lagrangian for constrained minimax problems
Provably robust directional vertex relaxation for geometric mesh optimization
scientific article; zbMATH DE number 1421256 (Why is no real title available?)
Optimal minimax rates against nonsmooth alternatives
An adaptive smoothing method for continuous minimax problems
A spline smoothing Newton method for finite minimax problems
A sequential quadratic programming algorithm for nonlinear minimax problems
Optimal Affine-Invariant Smooth Minimization Algorithms
Primal–dual exterior point method for convex optimization
Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
Algorithms with adaptive smoothing for finite minimax problems
A computational algorithm for selecting robust designs in safety and quality critical processes
A smooth method for the finite minimax problem
Solving continuous min-max problems by an iterative entropic regularization method.
Effect of time stepping strategy on adjoint-based production optimization
An active set smoothing method for solving unconstrained minimax problems
Optimal covering of plane domains by circles via hyperbolic smoothing
A modified SQP algorithm for minimax problems
A truncated aggregate smoothing Newton method for minimax problems

This page was built for publication: Smooth Optimization Methods for Minimax Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806995)