An unconstrained convex programming approach to linear semi-infinite programming

SIAM Journal on Optimization

Volumn 8, Issue 2, 1998, Pages 443-456

  Lin, Chih Jen ^a   Fang, Shu Cherng ^b   Wu, Soon Yi ^c  

^a UNIVERSITY OF MICHIGAN   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

^c NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Convex programming; Entropy optimization; Linear programming; Semi infinite programming

Indexed keywords

EID: 0032222094     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349427621X     Document Type: Article

References (21)

1. M. AVRIEL, Nonlinear Programming: Analysis and Methods, Prentice-Hall, Englewood Cliffs, NJ, 1976.
2. J. M. BORWEIN AND A. S. LEWIS, Convergence of best entropy estimates, SIAM J. Optim., 1 (1991), pp. 191-205.
3. 1and the existence of maximum entropy estimates, SIAM J. Optim., 3 (1993), pp. 248-267.
4. J. M. BORWEIN AND A. S. LEWIS, A survey of convergence results for maximum entropy methods, in Maximum Entropy and Bayesian Methods, A. Mohammad-Djafari and G. Demoments. eds., Kluwer Academic Publishers, Norwell, MA, 1993, pp. 39-48.
5. D. BOUKARI AND A. V. FIACCO, Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993, Optimization, 32 (1995), pp. 301-334.
6. A. R. CONN AND N. I. M. COULD, An exact penalty function for semi-infinite programming, Math. Programming, 37 (1987), pp. 19-40.
7. I. D. COOPE AND G. A. WATSON, A projected Lagrangian algorithm for semi-infinite programming, Math. Programming, 32 (1985), pp. 337-356.
8. J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
9. J. P. EVANS AND F. J. GOULD, An existence theorem for penalty function theory, SIAM J. Control Optim., 12 (1974), pp. 509-516.
10. S.-C. FANG AND S. PUTHENPURA, Linear Optimization and Extensions: Theory and Algorithms, Prentice-Hall, Englewood Cliffs, NJ, 1993.
11. S.-C. FANG AND H.-S. J. TSAO, Linear programming with entropic perturbation, Z. Oper. Res., 37 (1993), pp. 171-186.
12. S.-C. FANG AND H.-S. J. TSAO, On the entropic perturbation and exponential penalty methods for linear programming, J. Optim. Theory Appl., 89 (1996), pp. 461-466.
13. S.-C. FANG AND S.-Y. WU, An inexact approach to solving linear semi-infinite programming problems, Optimization, 28 (1994), pp. 291-299.
14. M. C. FERRIS AND A. B. PHILPOTT, An interior point algorithm for semi-infinite linear programming, Math. Programming, 43 (1989), pp. 257-276.
15. K. GLASHOFF AND S. Å. GUSTAFSON, Linear Optimization and Approximation, Springer-Verlag, New York, 1982.
16. S. Å. GUSTAFSON, On the computational solution of a class of generalized moment problems SIAM J. Numer. Anal., 7 (1970), pp. 343-357.
17. R. HETTICH AND K. KORTANEK, Semi-infinite programming: Theory, method, and applications, SIAM Rev., 35 (1993), pp. 380-429.
18. C.-J. LIN, S.-C. FANG, AND S.-Y. WU, A dual affine scaling based algorithm for solving linear semi-infinite programming problems, in Advances in Optimization and Approximation, Ding-Zhu Du and Jie Sun, eds., Kluwer Academic Publishers, Norwell MA 1994 pp. 217-234.
19. T. PIETRZYKOWSKI, The potential method for conditional maxima in the locally compact metric spaces, Numer. Math., 14 (1970), pp. 325-329.
20. R. T. ROCKFALLER, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
21. C. ZHU, R. H. BYRD, P. LU, AND J. NOCEDAL, L-BFGS-B Fortran subroutines for large-scale bound constrained optimization, Tech. report, Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, 1994.