Smooth Optimization Methods for Minimax Problems
From MaRDI portal
Publication:3806995
DOI10.1137/0326071zbMath0657.90075OpenAlexW2010929020MaRDI QIDQ3806995
Publication date: 1988
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0326071
Numerical methods involving duality (49M29) Quadratic programming (90C20) Existence of solutions for minimax problems (49J35)
Related Items
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities, A modified SQP algorithm for minimax problems, A nonlinear Lagrangian based on Fischer-Burmeister NCP function, Pattern search methods for finite minimax problems, A sequential quadratic programming algorithm for nonlinear minimax problems, A new computational method for the functional inequality constrained minimax optimization problem, A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints, On the entropic regularization method for solving min-max problems with applications, Perturbing the dual feasible region for solving convex quadratic programs, A derivative-free approximate gradient sampling algorithm for finite minimax problems, On the resolution of certain discrete univariate max-min problems, Algorithms with adaptive smoothing for finite minimax problems, Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions, Optimal covering of solid bodies by spheres via the hyperbolic smoothing technique, Provably Robust Directional Vertex Relaxation for Geometric Mesh Optimization, An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems, Robust equilibrium in transportation networks, A nonlinear augmented Lagrangian for constrained minimax problems, A computational algorithm for selecting robust designs in safety and quality critical processes, A CLASS OF NONLINEAR LAGRANGIANS: THEORY AND ALGORITHM, An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems, Modified barrier functions (theory and methods), A spline smoothing Newton method for finite minimax problems, A smooth method for the finite minimax problem, Robust optimal control: low-error operation for the longest time, Nondifferentiable optimization via smooth approximation: General analytical approach, Further study on a dual algorithm, Variable programming: a generalized minimax problem. II: Algorithms, A dual algorithm for minimax problems, Solving continuous min-max problems by an iterative entropic regularization method., A truncated aggregate smoothing Newton method for minimax problems, Effect of time stepping strategy on adjoint-based production optimization, Primal–dual exterior point method for convex optimization, Solving min-max problems and linear semi-infinite programs, An active set smoothing method for solving unconstrained minimax problems, Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints, An Adaptive Smoothing Method for Continuous Minimax Problems, Error bounds of two smoothing approximations for semi-infinite minimax problems, Nonmonotone line search for minimax problems, Optimal covering of plane domains by circles via hyperbolic smoothing
