Penalty and smoothing methods for convex semi-infinite programming

Mathematics of Operations Research

Volumn 34, Issue 2, 2009, Pages 303-319

  Auslender, Alfred ^a,b   Goberna, Miguel A ^c   López, Marco A ^c  

^a UNIVERSITÉ LYON 1   (France)

^b ECOLE POLYTECHNIQUE   (France)

^c UNIVERSITY OF ALICANTE   (Spain)

Author keywords

Asymptotic functions; Convex semi infinite programming; Duality; Penalty methods; Smoothing methods

Indexed keywords

CONSTRAINED OPTIMIZATION;

ASYMPTOTIC FUNCTIONS; DUALITY; PENALTY METHODS; SEMI INFINITE PROGRAMMING; SMOOTHING METHODS;

MATHEMATICAL PROGRAMMING;

EID: 67649994303     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0362     Document Type: Article

References (31)

1. Alvarez, F. 1998. Absolute minimizer and exponential penalty. Ph.D. thesis, Montpellier 2, France.
2. Auslender, A. 1970. Méthodes et théorèmes de dualité. Rev. Française Informat. Recherche Opérationnelle 4 9-45.
3. Auslender, A. 1999. Penalty and barrier methods: A unified framework. SIAM J. Optim. 10 653-671.
4. Auslender, A., M. Teboulle. 2003. Asymptotic Cones and Functions in Optimization and Variational Inequalities. Springer-Verlag, New York.
5. Auslender, A., R. Cominetti, M. Haddou. 1997. Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22 43-62.
6. Ben-Tal, A., M. Teboulle. 1989. A smoothing technique for nondifferentiable optimization problems. Lecture Notes Math. 1405 1-11.
7. Bertsekas, D. P. 1977. Approximation procedures based on the method of multipliers. J. Optim. Theory Appl. 23 487-510.
8. Bonnans, J. F., A. Shapiro. 2000. Perturbation Analysis of Optimization Problems. Springer-Verlag, New York.
9. Chen, C., O. L. Mangasarian. 1996. A class of smoothing functions for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 5 97-138.
10. Cheney, E., A. A. Goldstein. 1959. Newton's method for convex programming and Tchebycheff approximation. Numer. Math. 1, 253-268.
11. Elzinga, J., T. G. Moore. 1975. A central cutting plane algorithm for the convex programming problem. Math. Programming 8 34-145.
12. Fang, S. C., S. Y. Wu. 1996. Solving min-max problems and linear semi-infinite programs. Comput. Math. Appl. 32 87-93.
13. Gigola, C., S. Gomez. 1990. A regularization method for solving finite convex min-max problems. SIAM J. Numer. Anal. 27 1621-1634.
14. Kaplan, A. A., R. Tichatschke. 1992. Adaptative methods of solving ill-posed semi-infinite convex optimization problems. Soviet Math. Dokl. 45 119-123.
15. Kelley, J. E. 1960. The cutting-plane method for solving convex programs. SIAM J. Control Optim. 8 703-712.
16. Lin, C. J., S. C. Fang, S. Y. Wu. 1998. An unconstrained convex programming approach to linear semi-infinite programming. SIAM J. Optim. 8 443-456.
17. Martinet, B. 1972. Algorithmes pour la resolution des problèmes d'optimisation et de minimax. Thèse Universite Scientifique et Medicale de Grenoble, France.
18. Nesterov, Y 2005. Smooth minimization of nonsmooth functions. Math. Programming 103A 127-152.
19. Polak, E., J. O. Royset. 2003. Algorithms for finite and semi-infinite min-max-min problems using adaptative smoothing techniques. J. Optim. Theory Appl. 119 421-457.
20. Polak, E., J. E. Higgins, D. Q. Mayne. 1992. A barrier function method for minimax problems. Math. Programming 54A 155-176.
21. Polak, E., J. O. Royset, R. S. Womersley. 2003. Algorithms with adaptative smoothing for finite and semi-infinite min-max problems. J. Optim. Theory Appl. 119 459-484.
22. Reemtsen, R., S. Görner. 1998. Numerical methods for semi-infinite programming: A survey. Nonconvex Optim. Appl. 25 195-275.
23. Remez, E. 1934. Sur la détermination des polynômes d'approximation de degré donne. Comm. Soc. Math. Kharkoff et Inst. Sci. Math. et Mecan. 10 41-63.
24. Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
25. Schattler, U. 1996. An interior-point method for semi-infinite programming problems. Annals Oper. Res. 62 277-301.
26. Sheu, R. L., J. Y Lin. 2004. Solving continuous min-max problems by an iterative entropic regularization method. J. Optim. Theory Appl. 121 597-612.
27. Sheu, R. L., S. Y. Wu. 1999. Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints. J. Optim. Theory Appl. 101 167-190.
28. Teboulle, M. 1990. Nonlinear perturbation for linear semi-infinite optimization problems. Proc. 29th IEEE Conf. Decision and Control, Vol. 4. IEEE, Honolulu, 2477-2478.
29. Teo, K. L., C. J. Goh. 1987. A simple computational procedure for optimization problems with functional inequality constraints. IEEE Trans. Automat. Control 32 940-941.
30. Teo, K. L., V. Rehbock, L. S. Jennings. 1993. A new computational algorithm for functional inequality constrained optimization problems. Automatica J. International Federation of Automatic Control 29 789-792.
31. Veinott, A. F. 1967. The supporting hyperplane method for unimodal programming. Oper. Res. 15 147-152.