Combined Entropic Regularization and Path-Following Method for Solving Finite Convex Min-max Problems Subject to Infinitely Many Linear Constraints-Reference-Cited by-同舟云学术

Combined Entropic Regularization and Path-Following Method for Solving Finite Convex Min-max Problems Subject to Infinitely Many Linear Constraints

Published:1999-04 Issue:1 Volume:101 Page:167-190
ISSN:0022-3239
Container-title:Journal of Optimization Theory and Applications
language:en
Short-container-title:Journal of Optimization Theory and Applications

Author:

Sheu R. L.,Wu S. Y.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Management Science and Operations Research,Control and Optimization

Link

http://link.springer.com/content/pdf/10.1023/A:1021727228957.pdf

Reference26 articles.

1. Di Pillo, G., Grippo, L., and Lucidi, S., A Smooth Method for the Finite Minimax Problem, Mathematical Programming, Vol. 60, pp. 187–214, 1993.

2. Demyanov, V. F., and Malozemov, V. N., Introduction to Minimax, John Wiley and Sons, New York, New York, 1974.

3. Shor, N. Z., Minimization Methods for Nondifferentiable Functions, Translated from the Russian by K. C. Kiwiel and A. Ruszczynski, Springer Verlag, Berlin, Germany, 1985.

4. Anderson, E. J., and Nash, P., Linear Programming in Infinite-Dimensional Spaces: Theory and Applications, John Wiley and Sons, New York, New York, 1987.

5. Ferris, M. C., and Philpott, A. B., An Interior-Point Algorithm for Semi-Infinite Linear Programming, Mathematical Programming, Vol. 43, pp. 257–276, 1989.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Penalty and Smoothing Methods for Convex Semi-Infinite Programming;Mathematics of Operations Research;2009-05

2. Solving Continuous Min-Max Problems by an Iterative Entropic Regularization Method;Journal of Optimization Theory and Applications;2004-06