Smooth Optimization Methods for Minimax Problems
- 1 November 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 26 (6) , 1274-1286
- https://doi.org/10.1137/0326071
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- SMOOTH OPTIMIZATION METHODS IN DISCRETE MINIMAX PROBLEMSAnnals of the New York Academy of Sciences, 1983
- Combined lp and quasi-Newton methods for minimax optimizationMathematical Programming, 1981
- Variable metric methods for minimizing a class of nondifferentiable functionsMathematical Programming, 1981
- Acceleration of the leastpth algorithm for minimax optimization with engineering applicationsMathematical Programming, 1979
- Nonlinear leastpth optimization and nonlinear programmingMathematical Programming, 1977
- Approximation procedures based on the method of multipliersJournal of Optimization Theory and Applications, 1977
- A new algorithm for solution of resistive networks involving diodesIEEE Transactions on Circuits and Systems, 1976
- Combined Primal–Dual and Penalty Methods for Convex ProgrammingSIAM Journal on Control and Optimization, 1976
- Nondifferentiable optimization via approximationPublished by Springer Nature ,1975
- The multiplier method of Hestenes and Powell applied to convex programmingJournal of Optimization Theory and Applications, 1973