Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization

Journal of Global Optimization

Volumn 68, Issue 2, 2017, Pages 367-385

  Martinez J M ^a   Raydan, M ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

Cubic modeling; Newton type methods; Regularization; Smooth unconstrained minimization

Indexed keywords

COMPUTER APPLICATIONS;

ASYMPTOTIC CONVERGENCE; NEWTON-TYPE METHODS; NUMERICAL EXPERIMENTS; REGULARIZATION; SUFFICIENT DESCENT CONDITIONS; TRUST-REGION APPROACH; TRUST-REGION METHODS; UNCONSTRAINED MINIMIZATION;

GLOBAL OPTIMIZATION;

EID: 84991328710     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-016-0475-8     Document Type: Article

References (23)

1. Bianconcini, T., Liuzzi, G., Morini, B., Sciandrone, M.: On the use of iterative methods in cubic regularization for unconstrained optimization. Comput. Optim. Appl. 60(1), 35–57 (2015)
2. Birgin, E.G., Gardenghi, J.L., Martínez, J.M., Santos, S.A., Toint, PhL: Worst-Case Evaluation Complexity for Unconstrained Nonlinear Optimization using high-order regularized models, Technical Report naXys-05-2015, Namur Center for Complex Systems (naXys). University of Namur, Namur (2015)
3. Birgin, E.G., Martínez, J.M.: Practical Augmented Lagrangian Methods for Constrained Optimization. SIAM, Philadelphia (2014)
4. Birgin, E.G., Martínez, J.M., Raydan, M.: Spectral projected gradient methods: review and perspectives. J. Stat. Softw. 60(3) (2014)
5. Cartis, C., Gould, N.I.M., Toint, PhL: On the complexity of steepest descent, Newton’s and regularized Newton’s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20, 2833–2852 (2010)
6. Cartis, C., Gould, N.I.M., Toint, PhL: Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math. Program. Ser. A 127, 245–295 (2011)
7. Cartis, C., Gould, N.I.M., Toint, PhL: Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math. Program. Ser. A 130, 295–319 (2011)
8. Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust-region strategy for nonlinear equality constrained optimization. In: Boggs, P., Byrd, R., Schnabel, R., Publications, S.I.A.M. (eds.) Numerical Optimization, pp. 71–82. SIAM Publications, Philadelphia (1985)
9. - 3 / 2) for nonconvex optimization. Math. Program. (2016). doi:10.1007/s10107-016-1026-2
10. Dennis, J.E., El-Alem, M., Maciel, M.C.: A global convergence theory for general trust-region-based algorithms for equality constrained optimization. SIAM J. Optim. 7, 177–207 (1997)
11. Dussault,J.,P.: Simple unified convergence proofs for the trust-region methods and a new ARC variant, Technical Report, University of Sherbrooke, Sherbrooke, Canada (2015)
12. El-Alem, M.: A robust trust region algorithm with a nonmonotonic penalty parameter scheme for constrained optimization. SIAM J. Optim. 5, 348–378 (1995)
13. Gomes, F.M., Maciel, M.C., Martínez, J.M.: Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters. Math. Program. 84, 161–200 (1999)
14. Grapiglia, G.N., Yuan, J., Yuan, Y.-X.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152, 491–520 (2015)
15. Griewank, A.: The modification of Newton’s method for unconstrained optimization by bounding cubic terms, Technical Report NA/12. University of Cambridge, Department of Applied Mathematics and Theoretical Physics (1981)
16. Gould, N.I.M., Porcelli, M., Toint, PhL: Updating the regularization parameter in the adaptive cubic regularization algorithm. Comput. Optim. Appl. 53, 1–22 (2012)
17. Karas, E.W., Santos, S.A., Svaiter, B.F.: Algebraic rules for quadratic regularization of Newton’s method. Comput. Optim. Appl. 60(2), 343–376 (2015)
18. Lu, S., Wei, Z., Li, L.: A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. Comput. Optim. Appl. 51, 551–573 (2012)
19. Martínez, J.M.: Inexact restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J. Optim. Theory Appl. 111, 39–58 (2001)
20. Martínez, J.M., Raydan, M.: Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization. J. Glob. Optim. 63(2), 319–342 (2015)
21. Nesterov, Y., Polyak, B.T.: Cubic regularization of Newton’s method and its global performance. Math. Program. 108(1), 177–205 (2006)
22. Nesterov, Y.: Accelerating the cubic regularization of Newton’s method on convex problems. Math. Program. Ser. B 112, 159–181 (2008)
23. Toint, P.L.: Private communication (2015)