Penalty and Smoothing Methods for Convex Semi-Infinite Programming

References

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