An adaptive regularization algorithm for unconstrained optimization with inexact function and derivatives values
暂无分享,去创建一个
[1] Stefania Bellavia,et al. A Levenberg–Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients , 2018, Numerische Mathematik.
[2] Serge Gratton,et al. A note on solving nonlinear optimization problems in variable precision , 2018, Computational Optimization and Applications.
[3] P. Toint,et al. Strong Evaluation Complexity Bounds for Arbitrary-Order Optimization of Nonconvex Nonsmooth Composite Functions , 2020, 2001.10802.
[4] Yurii Nesterov. Cubic Regularization of Newton's Method for Convex Problems with Constraints , 2006 .
[5] P. Toint,et al. Adaptive cubic overestimation methods for unconstrained optimization. Part I: motivation, convergence and numerical results , 2008 .
[6] S. Bellavia,et al. Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization , 2018, SIAM J. Optim..
[7] Julien Langou,et al. Accelerating scientific computations with mixed precision algorithms , 2008, Comput. Phys. Commun..
[8] Richard G. Carter,et al. Numerical Experience with a Class of Algorithms for Nonlinear Optimization Using Inexact Function and Gradient Information , 1993, SIAM J. Sci. Comput..
[9] Mark Horowitz,et al. Energy-Efficient Floating-Point Unit Design , 2011, IEEE Transactions on Computers.