An inexact regularized Newton framework with a worst-case iteration complexity of O(ε−3/2) for nonconvex optimization
暂无分享,去创建一个
[1] Mokhtar S. Bazaraa,et al. Nonlinear Programming: Theory and Algorithms , 1993 .
[2] Stephen J. Wright,et al. Numerical Optimization (Springer Series in Operations Research and Financial Engineering) , 2000 .
[3] Jorge J. Moré,et al. Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .
[4] Nicholas I. M. Gould,et al. GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization , 2003, TOMS.
[5] Yurii Nesterov,et al. Cubic regularization of Newton method and its global performance , 2006, Math. Program..
[6] Katta G. Murty,et al. Nonlinear Programming Theory and Algorithms , 2007, Technometrics.
[7] S. Nash,et al. Linear and Nonlinear Optimization , 2008 .
[8] 採編典藏組. Society for Industrial and Applied Mathematics(SIAM) , 2008 .
[9] Nicholas I. M. Gould,et al. On solving trust-region and other regularised subproblems in optimization , 2010, Math. Program. Comput..
[10] Nicholas I. M. Gould,et al. On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems , 2010, SIAM J. Optim..
[11] P. Toint,et al. Optimal Newton-type methods for nonconvex smooth optimization problems , 2011 .
[12] Nicholas I. M. Gould,et al. Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results , 2011, Math. Program..
[13] Nicholas I. M. Gould,et al. Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity , 2011, Math. Program..
[14] Nicholas I. M. Gould,et al. Updating the regularization parameter in the adaptive cubic regularization algorithm , 2012, Comput. Optim. Appl..
[15] Ying Xiong. Nonlinear Optimization , 2014 .
[16] Nicholas I. M. Gould,et al. CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization , 2013, Computational Optimization and Applications.
[17] Jean-Pierre Dussault,et al. Scalable adaptative cubic regularization methods , 2015, 2103.16659.
[18] D. Gleich. TRUST REGION METHODS , 2017 .
[19] José Mario Martínez,et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models , 2017, Math. Program..
[20] Daniel P. Robinson,et al. An Inexact Regularized Newton Framework with a Worst-Case Iteration Complexity of $\mathcal{O}(\epsilon^{-3/2})$ for Nonconvex Optimization , 2017, 1708.00475.
[21] Daniel P. Robinson,et al. A trust region algorithm with a worst-case iteration complexity of O(ϵ-3/2)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{docume , 2016, Mathematical Programming.
[22] Nicholas I. M. Gould,et al. Evaluation complexity bounds for smooth constrained nonlinear optimisation using scaled KKT conditions, high-order models and the criticality measure $χ$ , 2017, ArXiv.
[23] José Mario Martínez,et al. The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization , 2017, SIAM J. Optim..
[24] Jean-Pierre Dussault. ARCq: a new adaptive regularization by cubics , 2018, Optim. Methods Softw..
[25] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .