A truncated projected Newton-type algorithm for large-scale semi-infinite programming

SIAM Journal on Optimization

Volumn 16, Issue 4, 2006, Pages 1137-1154

  Ni, Qin ^a   Ling, Chen ^b   Qi, Liqun ^c   Teo, Kok Lay ^d  

^a NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS   (China)

^b ZHEJIANG UNIVERSITY OF FINANCE AND ECONOMICS   (China)

^c HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^d CURTIN UNIVERSITY   (Australia)

Author keywords

Karush kuhn tucker system; Large scale problem; Semi infinite programming

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; GRADIENT METHODS; LARGE SCALE SYSTEMS; PROBLEM SOLVING;

KARUSH KUHN TUCKER SYSTEM; LARGE SCALE PROBLEM; SEMI-INFINITE PROGRAMMING;

LINEAR PROGRAMMING;

EID: 33750897895     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/040619867     Document Type: Article

References (20)

1. P. H. CALAMAI AND J. J. MORÉ, Projected gradient methods for linear constrained problems, Math. Programming, 39 (1987), pp. 93-116.
2. J. E. DENNIS, Nonlinear least squares and equations, in The State of the Art in Numerical Analysis, D. A. H. Jacobs, ed., Academic Press, New York, 1975, pp. 269-312.
3. V. FRAYSSE, L. GIRAUD, S. GRATTON, AND J. LANGOU, A Set of GMRES Routines for Real and Complex Arithmetics on High Performance Computers, CERFACS Technical report TR/PA/03/3, Toulouse Cedex, France, 2003.
4. M. A. GOBERNA AND M. A. LÓPEZ, Semi-infinite Programming: Recent Advances, Kluwer Academic Publishers, Boston, 2001.
5. P. R. GRIBIK, Selected applications of semi-infinite programming, in Constructive Approaches to Mathematical Models, Academic Press, New York, 1979, pp. 171-187.
6. R. HETTICH AND K. O. KORTANEK, Semi-infinite programming: Theory, methods, and applications, SIAM Rev., 35 (1993), pp. 380-429.
7. P. J. HUBER, Robust regression: Asympotics, conjectures, and Monte Carlo, Ann. Statist., 1 (1973), pp. 799-821.
8. S. ITO, Y. LIU, AND K. L. TEO, A dual parametrization method for convex semi-infinite programming, Ann. Oper. Res., 98 (2000), pp. 189-214.
9. Q. NI, Global convergence and implementation of NGTN method for solving large scale nonlinear sparse nonlinear programming problems, J. Comput. Math., 19 (2001), pp. 337-346.
10. J.-S. PANG AND L. QI, Nonsmooth equations: Motivation and algorithms, SIAM J. Optim., 3 (1993), pp. 443-465.
11. E. POLAK, On the mathematical foundations of nondiffercntiable optimization in engineering design, SIAM Rev., 29 (1987), pp. 21-89.
12. E. POLAK, Optimization: Algorithms and Consistent Approximation, Springer-Verlag, New York, 1997.
13. L. QI, Convergence analysis of some algorithms for solving nonsmooth equations, Math. Oper. Res., 18 (1993), pp. 227-244.
14. L. QI, C. LING, X. J. TONG, AND G. L. ZHOU, A Smoothing Projected Newton-Type Algorithm for Semi-infinite Programming, Technical report, Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hum, Kowloon, Hong Kong, 2004.
15. R. REEMTSEN AND S. GÖRNER, Numerical methods for semi-infinite programming: A survey, in Semi-infinite Programming, R. Reemtsen and J. Rükmann, eds., Kluwer Academic Publishers, Boston, 1998, pp. 195-275.
16. E. W. SACHS, Semi-infinite programming in control, in Semi-infinite Programming, R. Reemtsen and J. Rukmann, eds., Kluwer Academic Publishers, Boston, 1998, pp. 389-411.
17. G. STILL, Discretization in semi-infinite programming: The rate of convergence, Math. Program., 91 (2001), pp. 53-69.
18. D. SUN, R. S. WOMERSLEY, AND H. QI, A feasible semismooth asymptotically Newton method for mixed complementarity problems, Math. Program., 94 (2002), pp. 167-187.
19. K. L. TEO, C. J. GOH, AND K. H. WONG, A Unified Computational Approach tu Optimal Control Problems, Longman Scientific and Technical, New York, 1991.
20. K. L. TEO, V. REHBOCK, AND L. S. JENNINGS, A new computational algorithm for functional inequality constrained optimization problems, Automatica, 29 (1993), pp. 789-792.