A trust region method based on a new affine scaling technique for simple bounded optimization

Optimization Methods and Software

Volumn 28, Issue 4, 2013, Pages 871-888

  Wang, Xiao ^a   Yuan, Ya Xiang ^a  

^a INSTITUTE OF COMPUTATIONAL MATHEMATICS AND SCIENTIFIC ENGINEERING COMPUTING   (China)

Author keywords

affine scaling; bound constrained optimization; interior point; trust region

Indexed keywords

AFFINE SCALING; AFFINE SCALING METHOD; BOUND CONSTRAINED OPTIMIZATION; INTERIOR POINT; MATLAB OPTIMIZATION TOOLBOX; NUMERICAL PERFORMANCE; QUADRATIC APPROXIMATION; TRUST REGION;

ALGORITHMS; NONLINEAR PROGRAMMING; NUMERICAL METHODS; OPTIMIZATION;

LINEAR PROGRAMMING;

EID: 84880247784     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556788.2011.622378     Document Type: Conference Paper

References (37)

1. E.R. Barnes, A variation on Karmarkar's algorithm for solving linear programming problems, Math. Program. 36 (1986), pp. 174-182.
2. S. Bellavia, M. Macconi, and B. Morini, An affine scaling trust-region approach to bound-constrained nonlinear systems Appl. Numer. Math. 44 (2003), PP. 257-280.
3. E.G. Birgin and J.M. Martinez, Large-scale active-set box-constrained optimization method with spectral projected gradients, Comput. Optim. Appl. 23 (2002), pp. 101-125.
4. J. Bonnans and M. Bouhtou, The trust region affine interior point algorithm for convex and nonconvex quadratic programming, RAIRO Rech. Opér. 29 (1995), pp. 195-217.
5. R.H. Byrd, P. Lu, J. Nocedal, and C. Zhu, A limited memory algorithm for bound constrained optimization, SIAM J. Sci. Comput. 16 (1995), pp. 1190-1208.
6. T.F. Coleman andY. Li, On the convergence of interior-reflection Newton methods for nonlinear minimization subject to bounds, Math. Program. 67 (1994), pp. 189-224.
7. T.F. Coleman and Y. Li, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim. 6 (1996), pp. 418-445.
8. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, Global convergence of a class of trust region algorithms for optimization with simple bounds, SIAM J. Numer. Anal. 25 (1988), pp. 433-460; 26 (1989), pp. 764-767.
9. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer, Heidelberg, NewYork, 1992.
10. A.R. Conn, N.I.M. Gould, and Ph.L.Toint, Trust-Region Methods, Number 01 in MPS-SIAM Series on Optimization, SIAM, Philadelphia, PA, 2000.
11. Y.H. Dai and R. Fletcher, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, Numer. Math. 100 (2005), pp. 21-47.
12. J.E. Dennis and L.N.Vicente, Trust-region interior-point algorithms for minimization problems with simple bounds, in Applied Mathematics and Paralle Computing, K. Ritter, H. Fisher, H. Riedmüller and S. Schäffler, eds., Physica- Verlag, Springer, Berlin, 1996, pp. 97-107.
13. I.I. Dikin, Iterative solution of problems of linear and quadratic programming, Dokl. Akad. Nauk SSSR 174 (1967), pp. 747-748. (Transl. Soviet Math. Dokl. 8 (1967), pp. 674-675.)
14. I.I. Dikin and V.I. Zorkaltsev, Iterative Solutions of Mathematical Programming Problems, Nauka, Novosibirsk, 1980.
15. E.D. Dolan and J.J. Moré, Benchmarking optimization software with performance profiles, Math. Program. 91 (2002), pp. 201-213.
16. F. Facchinei, J. Júdice, and J. Soares, An active set Newton's algorithm for large-scale nonlinear programs with box constraints, SIAM J. Optim. 8 (1998), pp. 158-186.
17. F. Facchinei, S. Lucidi, and L. Palagi, A truncated Newton algorithm for large scale box constrained optimization, SIAM J. Optim. 12 (2002), pp. 1100-1125.
18. A. Friedlander, J.M. Martinez, and S. Santos, A new trust region algorithm for bound constrained minimization, Appl. Math. Optim. 30 (1994), pp. 235-266.
19. N.I.M. Gould, D. Orban, and Ph.L. Toint, CUTEr, a constrained and unconstrained testing environment (revisited), ACM Trans. Math. Softw. 29 (2003), pp. 373-394.
20. S. Gratton, M. Mouffe, Ph.L. Toint, and M. Weber-Mendonça, A recursive l∞-trust-region method for boundconstrained nonlinear optimization, IMA. J. Numer. Anal. 28 (2008), pp. 827-861.
21. W.W. Hager and H.C. Zhang, A new active set algorithm for box constrained optimization, SIAM J. Optim. 17 (2006), pp. 526-557.
22. M. Heinkenschloss, M. Ulbrich, and S. Ulbrich, Superlinear and quadratic convergence of affine-scaling interiorpoint Newton methods for problems with simple bounds without strict complementarity assumption, Math. Program. 86 (1999), pp. 615-635.
23. C. Kanzow and A. Klug, On affine scaling interior-point Newton methods for nonlinear minimization with bound constraints, Comput. Optim. Appl. 35 (2006), pp. 177-197.
24. M. Lescrenier, Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold, SIAM J. Numer. Anal. 28 (1991), pp. 476-495.
25. C. Lin and J.J. Moré, Newton's method for large bound-constrained optimization problem, SIAM J. Optim. 9 (1999), pp. 1100-1127.
26. R.D.C. Monteiro and T. Tsuchiya, Global convergence of the affine scaling algorithm for convex quadratic programmming, SIAM J. Optim. 8 (1998), pp. 26-58.
27. R.D.C. Monteiro and Y. Wang, Trust region affine scaling algorithms for linearly constrained convex and concave programs, Math. Program. 80 (1998), pp. 283-313.
28. J.J. Moré and G. Toraldo, On the solution of large quadratic programming problems with bound constraints, SIAM J. Optim. 1 (1991), pp. 93-113.
29. Q. Ni and Y.Yuan, A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization, Math. Comput. 66 (1997), pp. 1509-1520.
30. M.J.D. Powell, The BOBYQA algorithm for bound constrained optimization without derivatives, Technical Report, Department of Applied Mathematics and Theoretical Physics, NA2009/06, Cambridge, 2009.
31. A. Schwartz and E. Polak, Family of projected descent methods for optimization problems with simple bounds, J. Optim. Theory Appl. 92 (1997), pp. 1-31.
32. J. Sun, A convergence analysis for a convex version of Dikin's algorithm, Ann. Oper. Res. 62 (1996), pp. 357-374.
33. P. Tseng, Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization, J. Glob. Optim. 30 (2004), pp. 285-300.
34. M. Ulbrich, S. Ulbrich, and M. Heinkenschloss, Global convergence of trust-region interior-point algorithms for infinite-dimensional nonconvex minimization subject to point-wise bounds, SIAM J. Control Optim. 37 (1999), pp. 731-764.
35. R.J. Vanderbei, M.S. Meketon, and B.A. Freedman, A modification of Karmarkar's linear programming algorithm, Algorithmica 1 (1986), pp. 395-407.
36. Y.Yuan, Computational Methods for Nonlinear Optimization (in Chinese), Science Press, Beijing, China, 2007.
37. C. Zhu, R.H. Byrd, P. Lu, and J. Nocedal, L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization, ACM Trans. Math. Softw. 23 (1997), pp. 550-560.