暂无分享,去创建一个
Stefania Bellavia | Benedetta Morini | Philippe L. Toint | Gianmarco Gurioli | P. Toint | S. Bellavia | G. Gurioli | B. Morini
[1] Yurii Nesterov,et al. Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.
[2] A Stochastic Line Search Method with Convergence Rate Analysis , 2018, 1807.07994.
[3] J. Dussault. Simple unified convergence proofs for Trust Region and a new ARC variant , 2015 .
[4] Stefania Bellavia,et al. A Levenberg–Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients , 2018, Numerische Mathematik.
[5] Serge Gratton,et al. Minimizing convex quadratic with variable precision Krylov methods , 2018, ArXiv.
[6] P. Toint,et al. Trust-region and other regularisations of linear least-squares problems , 2009 .
[7] Cho-Jui Hsieh,et al. Stochastic Second-order Methods for Non-convex Optimization with Inexact Hessian and Gradient , 2018, ArXiv.
[8] Stephen A. Vavasis,et al. Black-Box Complexity of Local Minimization , 1993, SIAM J. Optim..
[9] Peng Xu,et al. Newton-type methods for non-convex optimization under inexact Hessian information , 2017, Math. Program..
[10] Yurii Nesterov,et al. Cubic regularization of Newton method and its global performance , 2006, Math. Program..
[11] Philippe L. Toint,et al. WORST-CASE EVALUATION COMPLEXITY AND OPTIMALITY OF SECOND-ORDER METHODS FOR NONCONVEX SMOOTH OPTIMIZATION , 2017, Proceedings of the International Congress of Mathematicians (ICM 2018).
[12] Peng Xu,et al. Second-Order Optimization for Non-Convex Machine Learning: An Empirical Study , 2017, SDM.
[13] Peng Xu,et al. Inexact Nonconvex Newton-Type Methods , 2018, INFORMS Journal on Optimization.
[14] Joel A. Tropp,et al. An Introduction to Matrix Concentration Inequalities , 2015, Found. Trends Mach. Learn..
[15] Serge Gratton,et al. Recursive Trust-Region Methods for Multiscale Nonlinear Optimization , 2008, SIAM J. Optim..
[16] Nicholas I. M. Gould,et al. Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints , 2018, SIAM J. Optim..
[17] P. Toint,et al. Adaptive cubic overestimation methods for unconstrained optimization , 2007 .
[18] Vyacheslav Kungurtsev,et al. A Subsampling Line-Search Method with Second-Order Results , 2018, INFORMS J. Optim..
[19] José Mario Martínez,et al. Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models , 2017, Math. Program..
[20] Katya Scheinberg,et al. Convergence Rate Analysis of a Stochastic Trust-Region Method via Supermartingales , 2016, INFORMS Journal on Optimization.
[21] Michael I. Jordan,et al. Stochastic Cubic Regularization for Fast Nonconvex Optimization , 2017, NeurIPS.
[22] Katya Scheinberg,et al. Global convergence rate analysis of unconstrained optimization methods based on probabilistic models , 2015, Mathematical Programming.
[23] Tianyi Lin,et al. On Adaptive Cubic Regularized Newton's Methods for Convex Optimization via Random Sampling , 2018 .