A trust region method for semi-infinite programming problems

International Journal of Systems Science

Volumn 30, Issue 2, 1999, Pages 199-204

  Tanaka, Yoshihiro ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING;

MARATOS EFFECTS; SEMI-INFINITE PROGRAMMING PROBLEMS; SUCCESSIVE QUADRATIC PROGRAMMING (SQP) METHODS; TRUST REGION METHODS;

QUADRATIC PROGRAMMING;

EID: 0033078752     PISSN: 00207721     EISSN: 14645319     Source Type: Journal    
DOI: 10.1080/002077299292542     Document Type: Article

References (16)

1. Coope, I. D., and Watson, G. A., 1985, An projected Lagrangian algorithm for semi-infinite programming. Mathematical Programming, 32, 337-356.
2. Dennis Jr., J. E., Li, S. B. B., and Tapia, R. A., 1995, A unified approach to global convergence of trust region methods for nonsmooth optimization. Mathematical Programming, 68, 319-346.
3. Ferris, M. C., and Philpott, A. B., 1992, On affine scaling and semiinfinite programming. Mathematical Programming, 56, 361-364.
4. Fletcher, R., 1981, Practical Methods of Optimization: Constrained Optimization (New York: John Wiley).
5. Fukushima, M., 1986, A successive quadratic programming algorithm with global and superlinear convergence properties. Mathematical Programming, 35, 253-264.
6. Gill, P. E., Murray, W., Saunders, M. A., and Wright, M. H., 1989, Constrained nonlinear programming, Handbooks in OR & MS 1, edited by G. L. Nemhauser, A. H. G. Rinnoy Kan and M. J. Todd, pp. 171-210.
7. Hettich, R., 1979, A comparison of some numerical methods for semi-infinite programming, Semi-Infinite Programming, edited by R. Hettich (Berlin: Springer), pp. 112-125.
8. Maratos, N., 1978, Exact penalty function algorithms for finite dimensional and control optimization problems. PhD thesis, University of London.
9. Mayne, D. Q., andPolak, E., 1982, A superlinearly convergent algorithm for constrained optimization problems. Mathematical Programming Study, 16, 45-61.
10. Mine, H., Fukushima, M., and Tanaka, Y., 1984, On the use of e-most-active constraints in an exact penalty function method for nonlinear optimization. IEEE Transactions on Automatic Control, AC-29, 1040-1042.
11. Polak, E., 1987, On the mathematical foundations of nondifferenti-able optimization in engineering design. SIAMReview, 29, 21-89.
12. Powell, M. J. D., 1983, Variable metric methods for constrained optimization. Mathematical Programming: The State of the Art, Bonn 1982, edited by A. Bachem, M. Grotschel and B. Korte (Berlin: Springer), pp. 288-311.
13. Price, C. J., and Coope, I. D., 1990, An exact penalty function algorithm for semi-infinite programmes. BIT, 30, 724-734.
14. Reemtsen, R., 1991, Discretization methods for the solution of semiinfinite programming. Journal of Optimization Theory and Applications, 71, 85-103.
15. Tanaka, Y., Fukushima, M., and Ibaraki, T., 1988, A globally convergent SQP method for semi-infinite nonlinear optimization. Journal of Computational and Applied Mathematics, 23, 141-153.
16. Todd, M. J., 1994, Interior-point algorithms for semi-infinite programming. Mathematical Programming, 65, 217-245.