An Incremental Method for Solving Convex Finite Min-Max Problems

References

• Bertsekas D. P., Tsitsiklis J. N.Neuro-Dynamic Programming (1996) (Athena Scientific, Belmont, MA) Google Scholar
• Cheney E. W., Goldstein A. A. Newton’s method for convex programming and Tchebycheff approximation. Numerische Mathematik (1959) 1:253–268Crossref, Google Scholar
• Demyanov V. F., Malozemov V. N.Introduction to Minimax (1974) (John Wiley and Sons)Google Scholar
• Di Pillo G., Grippo L., Lucidi S. A smooth method for the finite minimax problem. Math. Programming (1993) 60:187–214Crossref, Google Scholar
• Di Pillo G., Grippo L., Lucidi S. Smooth transformation of the generalized minimax problem. J. Optim. Theory Appl. (1997) 95:1–24Crossref, Google Scholar
• Gaudioso M., Resende M. G. C., Pardalos P. Nonsmooth optimization. Handbook of Applied Optimization (2002) (Oxford University Press, New York) 299–310Google Scholar
• Goldfarb D., Idnani A. A numerically stable dual method for solving strictly convex quadratic program. Math. Programming (1983) 27:1–33Crossref, Google Scholar
• Grippo L. Convergent on-line algorithms for supervised learning in neural networks. IEEE Trans. Neural Networks (2000) 11:1284–1295Crossref, Google Scholar
• Hald J., Madsen K. Combined LP and quasi-Newton methods for minimax optimization. Math. Programming (1981) 20:49–62Crossref, Google Scholar
• Hiriart-Urruty J. B., Lemaréchal C.Convex Analysis and Minimization AlgorithmsVol. 2(Springer-Verlag, Berlin, Germany) Google Scholar
• Kelley J. E. The cutting-plane method for solving convex programs. J. SIAM (1960) 8(4):703–712Google Scholar
• Kiwiel K. C.Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics (1985) Vol. 1133(Springer-Verlag, Vienna, Austria) Google Scholar
• Lukšan L., Vlček J. Test problems for nonsmooth unconstrained and linearly constrained optimization. (2000) . Technical Report 798. Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech RepublicGoogle Scholar
• Mäkelä M., Neittaanmäki P.Nonsmooth Optimization (1992) (World Scientific, Singapore) Crossref, Google Scholar
• Nedić A., Bertsekas D. P. Incremental Subgradient Methods for Nondifferentiable Optimization. SIAM J. Optim. (2001) 12(1):109–138Crossref, Google Scholar
• Polak E. On the mathematical foundations of nondifferentiable optimization in engineering design. SIAM Rev. (1987) 29:21–89Crossref, Google Scholar