Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

Computers and Mathematics with Applications

Volumn 38, Issue 3, 1999, Pages 23-33

  Wu, Soon Yi ^a   Fang, S C ^b  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; CONSTRAINT THEORY; ITERATIVE METHODS; NUMERICAL METHODS; SET THEORY;

CONVEX SEMI INFINITE PROGRAMMING; CUTTING PLANE METHOD; DUALITY METHOD;

MATHEMATICAL PROGRAMMING;

EID: 0033177456     PISSN: 08981221     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0898-1221(99)00203-5     Document Type: Article

References (16)

1. R. Hettich and K.O. Kortanek, Semi-infinite programming: Theory, method and applications, SIAM Review 35, 380-429, (1993).
2. R. Reemtsen and S. Görne, Numerical methods for semi-infinite programming: A survey, In Semi-Infinite Programming, (Edited by R. Reemtsen and J.-J. Rueckmann), pp. 195-275, Kluwer Academic, Boston, MA, (1998).
3. S.A. Gustafson and K.O. Kortanek, Semi-infinite programming and applications, In Mathematical Programming: The State and Art, (Edited by A. Bachem, M. Grotschel and B. Korte), pp. 132-157, Springer-Verlag, (1983).
4. D.G. Luenberger, Optimization by Vector Space Methods, Wiley, New York, (1969).
5. S.-C. Fang, J.r. Rajasekera and H.-S.J. Tsao, Entropy Optimization and Mathematical Programming, Kluwer Academic, Norwell, MA, (1997).
6. K. Glashoff and S.A. Gustafson, Linear Optimization and Approximation, Springer-Verlag, New York, (1982).
7. S.A. Gustafson and K.O. Kortanek, Numerical treatment of a class of semi-infinite programming problems, Naval Research Logistics Quarterly 20, 473-504, (1973).
8. P.R. Gribik, A central cutting plane algorithm for SIP, In Semi-Infinite Programming, (Edited by R. Hettich), Springer-Verlag, (1979).
9. R. Tichatschke and V. Nebeling, A cutting plane algorithm for solving quadratic semi-infinite programs, Optimization 19, 803-817, (1988).
10. S.-C. Fang, C.-J. Lin and S.-Y. Wu, Combined relaxations of the cutting plane method for quadratic semi-infinite programming problems, Journal of Computational and Applied Mathematics, (submitted).
11. C.-J. Lin, S.-C. Fang and S.-Y. Wu, An unconstrained convex programming approach to linear semi-infinite programming, SIAM Journal on Optimization 8, 443-456, (1998).
12. S.-Y. Wu, S.-C. Fang and C.-J. Lin, Relaxed cutting plane method for solving linear semi-infinite programming problems, Journal of Optimization Theory and Applications 99, 759-779, (1998).
13. S.-C. Fang and S.-Y. Wu, An inexact approach to solving linear semi-infinite programming problems, Optimization 28, 291-299, (1994).
14. S.-C. Fang, C.-J. Lin and S.-Y. Wu, On solving convex quadratic semi-infinite programming problems, Optimization 31, 107-125, (1994).
15. K. Roleff, A stable multiple exchange algorithm for linear SIP, In Semi-Infinite Programming, (Edited by R. Hettich), Springer-Verlag, (1979).
16. H.-C. Lai and S.-Y. Wu, On linear semi-infinite programming problems - An algorithm, Numerical Functional Analysis and Optimization 13, 287-304, (1992).