Global solution of semi-infinite programs

Mathematical Programming

Volumn 103, Issue 2, 2005, Pages 283-307

  Bhattacharjee, B ^a   Lemonidis, P ^a   Green Jr , W H ^a   Barton, P I ^a  

^a Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; DECISION MAKING; PROBLEM SOLVING; RELAXATION PROCESSES;

BRANCH AND BOUND ALGORITHMS; DISCRETIZED ALGORITHM; FINITE NUMBER; SEMI-INFINITE PROGRAMS;

GLOBAL OPTIMIZATION;

EID: 21144438789     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-005-0583-6     Document Type: Conference Paper

References (19)

1. Alefeld, G., Mayer, G.: Interval analysis: theory and applications. J. Comput. Appl. Math. 121, 421-464 (2000)
2. Baumann, E.: Optimal centered forms. BIT 28, 80-87 (1988)
3. Bhattacharjee, B.: Kinetic Model Reduction using Integer and Semi-Infinite Programming. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, December 2003
4. Bhattacharjee, B., Green, W.H. Jr., Barton, P.I.: Interval methods for semi-infinite programs. Comput. Optim. Appl. 30 (1), 63-94 (2005)
5. Coope, I.D., Watson, G.A.: Projected Lagrangian algorithm for semi-infinite programming. Math. Program. 32, 337-256 (1985)
6. Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: User's Guide for NPSOL 5.0: A FORTRAN Package for Nonlinear Programming. 1998
7. Hettich, R., Kortanek, K.O.: Semi-infinite programming: Theory, methods and applications. SIAM Review 35, 380-429 (1993)
8. Horst, R.: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization. J. Optim. Theory Appl. 51, 271-291 (1986)
9. Horst, R.: Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reverse convex constraints, DC-programming,and Lipschitzian optimization. J. Optim. Theory Appl. 58, 11-37 (1988)
10. Horst, R., Tuy, H.: Global Optimization: Deterministic approaches. Springer-Verlag, 1996. 3rd Edition
11. McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I: Convex underestimating problems. Math. Program. 10, 147-175 (1976)
12. Moore, R.: Methods and Applications of Interval Analysis. SIAM, Philadelphia PA, 1979
13. Polak, E.: Optimization Algorithms and Consistent Approximations. Springer-Verlag, New York, New York, 1997
14. Ratschek, H., Rokne, J.: Computer Methods for the Range of Functions. Ellis Horwood Limited, Chichester, England, 1984
15. Reemsten, R., Gorner, S.: Numerical methods for semi-infinite programming: A survey. In: R. Reemsten, J. Ruckmann (eds.), Semi-infinite Programming, Kluwer Academic Publishers, Dordrecht, Netherlands, 1998, pp. 195-275
16. Singer, A.B.: LibBandB.a Version 3.1 Manual. Massachusetts Institute of Technology, Cambridge, MA, 2003
17. Singer, A.B., Barton, P.I.: Global Solution of Optimization Problems with Parameter-Embedded Linear Dynamic Systems. J. Optim. Theory Appl. 121 (3), 613-646 (2004)
18. Stein, O.: Bi-level Strategies in Semi-infinite Programming. Kluwer, 2003
19. Still, G.: Generalized semi-infinite programming: Theory and Methods. European J. Oper. Res. 119, 303-313 (1999)