A Line-Search Algorithm Inspired by the Adaptive Cubic Regularization Framework and Complexity Analysis
- 10 July 2018
- journal article
- research article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 178 (3) , 885-913
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Recent advances in trust region algorithmsMathematical Programming, 2015
- CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimizationComputational Optimization and Applications, 2014
- Worst-case evaluation complexity of non-monotone gradient-related algorithms for unconstrained optimizationOptimization, 2013
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexityMathematical Programming, 2010
- Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical resultsMathematical Programming, 2009
- Recursive Trust-Region Methods for Multiscale Nonlinear OptimizationSIAM Journal on Optimization, 2008
- Cubic regularization of Newton method and its global performanceMathematical Programming, 2006
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimizationACM Transactions on Mathematical Software, 2003
- Benchmarking optimization software with performance profilesMathematical Programming, 2002
- Solution of Sparse Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1975