An Adaptive Smoothing Method for Continuous Minimax Problems
From MaRDI portal
Publication:5245835
DOI10.1142/S0217595915400011zbMath1311.90042MaRDI QIDQ5245835
Publication date: 15 April 2015
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
global convergencesmoothing methodpolynomial interpolationsteepest descent methodcautious BFGS methodsemi-infinite continuous minimax problem
Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Methods of quasi-Newton type (90C53) Stochastic network models in operations research (90B15) Production models (90B30) Semi-infinite programming (90C34) Optimality conditions for minimax problems (49K35)
Related Items
Generalization of hyperbolic smoothing approach for non-smooth and non-Lipschitz functions, On a new smoothing technique for non-smooth, non-convex optimization
Cites Work
- Algorithms with adaptive smoothing for finite minimax problems
- A smooth method for the finite minimax problem
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- Nondifferential optimization via adaptive smoothing
- A non-interior continuation method for generalized linear complementarity problems
- Superlinearly convergent algorithm for min-max problems
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- Smooth Optimization Methods for Minimax Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Acceleration of the leastpth algorithm for minimax optimization with engineering applications
- Variable metric methods for minimizing a class of nondifferentiable functions
- A smoothing-out technique for min—max optimization
- A surperlinearly convergent algorithm for constrained optimization problems
- An Efficient Method to Solve the Minimax Problem Directly
- Combined phase I—phase II methods of feasible directions
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- Smoothing method for minimax problems
- How good can polynomial interpolation on the sphere be?
