A smooth method for the finite minimax problem
- 1 June 1993
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 60 (1) , 187-214
- https://doi.org/10.1007/bf01580609
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- A Regularization Method for Solving the Finite Convex Min-Max ProblemSIAM Journal on Numerical Analysis, 1990
- An exact penalty function method with global convergence properties for nonlinear programming problemsMathematical Programming, 1986
- A bundle type approach to the unconstrained minimization of convex nonsmooth functionsMathematical Programming, 1982
- A model algorithm for composite nondifferentiable optimization problemsPublished by Springer Nature ,1982
- Second order corrections for non-differentiable optimizationPublished by Springer Nature ,1982
- Acceleration of the leastpth algorithm for minimax optimization with engineering applicationsMathematical Programming, 1979
- A multiplier method with automatic limitation of penalty growthMathematical Programming, 1979
- An Algorithm for $l_1 $-Norm Minimization with Application to Nonlinear $l_1 $-ApproximationSIAM Journal on Numerical Analysis, 1979
- An Efficient Method to Solve the Minimax Problem DirectlySIAM Journal on Numerical Analysis, 1978
- Nondifferentiable optimization via approximationPublished by Springer Nature ,1975