Citations (26)
Keep up to date with the latest research on this topic with citation updates for this article.
Read on this site (6)
R. Garmanjani. (2022) A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization. Optimization 71:6, pages 1709-1719.
Read now
Read now
Anton Schiela. (2019) A Flexible Framework for Cubic Regularization Algorithms for Nonconvex Optimization in Function Space. Numerical Functional Analysis and Optimization 40:1, pages 85-118.
Read now
Read now
Jean-Pierre Dussault. (2018) ARCq: a new adaptive regularization by cubics. Optimization Methods and Software 33:2, pages 322-335.
Read now
Read now
Tommaso Bianconcini & Marco Sciandrone. (2016) A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques. Optimization Methods and Software 31:5, pages 1008-1035.
Read now
Read now
G.N. Grapiglia, J. Yuan & Y. Yuan. (2016) On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization. Optimization Methods and Software 31:3, pages 591-604.
Read now
Read now
Frank E. Curtis, Nicholas I.M. Gould, Hao Jiang & Daniel P. Robinson. (2016) Adaptive augmented Lagrangian methods: algorithms and practical numerical experience. Optimization Methods and Software 31:1, pages 157-186.
Read now
Read now
Articles from other publishers (20)
R. Garmanjani. (2022) Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization. Optimization Letters 17:5, pages 1161-1179.
Crossref
Crossref
Zahra Rezaeiparsa & Ali Ashrafi. (2023) A new adaptive Levenberg–Marquardt parameter with a nonmonotone and trust region strategies for the system of nonlinear equations. Mathematical Sciences.
Crossref
Crossref
Stefania Bellavia, Tommaso Bianconcini, Nataša Krejić & Benedetta Morini. 2023. Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging. Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging
61
95
.
Rémi Chan–Renous-Legoubin & Clément W. Royer. (2022) A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression. EURO Journal on Computational Optimization 10, pages 100044.
Crossref
Crossref
Henri Calandra, Serge Gratton, Elisa Riccietti & Xavier Vasseur. (2021) On High-Order Multilevel Optimization Strategies. SIAM Journal on Optimization 31:1, pages 307-330.
Crossref
Crossref
Stefania Bellavia, Tommaso Bianconcini, Nataša Krejić & Benedetta Morini. 2021. Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging. Handbook of Mathematical Models and Algorithms in Computer Vision and Imaging
1
35
.
Frank E. Curtis & Daniel P. Robinson. (2020) Regional complexity analysis of algorithms for nonconvex smooth optimization. Mathematical Programming.
Crossref
Crossref
Somayeh Bahrami & Keyvan Amini. (2020) An efficient two-step trust-region algorithm for exactly determined consistent systems of nonlinear equations. Journal of Computational and Applied Mathematics 367, pages 112470.
Crossref
Crossref
Gabriel Haeser, Hongcheng Liu & Yinyu Ye. (2018) Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary. Mathematical Programming 178:1-2, pages 263-299.
Crossref
Crossref
Man-Chung Yue, Zirui Zhou & Anthony Man-Cho So. (2019) On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition. SIAM Journal on Optimization 29:1, pages 904-932.
Crossref
Crossref
Frank E. Curtis, Zachary Lubberts & Daniel P. Robinson. (2018) Concise complexity analyses for trust region methods. Optimization Letters 12:8, pages 1713-1724.
Crossref
Crossref
Jiyang Dong, Ke Lu, Jian Xue, Shuangfeng Dai, Rui Zhai & Weiguo Pan. (2018) Accelerated nonrigid image registration using improved Levenberg–Marquardt method. Information Sciences 423, pages 66-79.
Crossref
Crossref
Geovani Nunes Grapiglia, Jinyun Yuan & Ya-xiang Yuan. (2016) Nonlinear Stepsize Control Algorithms: Complexity Bounds for First- and Second-Order Optimality. Journal of Optimization Theory and Applications 171:3, pages 980-997.
Crossref
Crossref
Keyvan Amini & Faramarz Rostami. (2016) Three-steps modified Levenberg–Marquardt method with a new line search for systems of nonlinear equations. Journal of Computational and Applied Mathematics 300, pages 30-42.
Crossref
Crossref
S. Bellavia, B. Morini & E. Riccietti. (2015) On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation. Computational Optimization and Applications 64:1, pages 1-30.
Crossref
Crossref
Keyvan Amini & Faramarz Rostami. (2015) A modified two steps Levenberg–Marquardt method for nonlinear equations. Journal of Computational and Applied Mathematics 288, pages 341-350.
Crossref
Crossref
Geovani N. Grapiglia, Jinyun Yuan & Ya-xiang Yuan. (2014) On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Mathematical Programming 152:1-2, pages 491-520.
Crossref
Crossref
Frank E. Curtis, Hao Jiang & Daniel P. Robinson. (2014) An adaptive augmented Lagrangian method for large-scale constrained optimization. Mathematical Programming 152:1-2, pages 201-245.
Crossref
Crossref
Ya-xiang Yuan. (2015) Recent advances in trust region algorithms. Mathematical Programming 151:1, pages 249-281.
Crossref
Crossref
Tommaso Bianconcini, Giampaolo Liuzzi, Benedetta Morini & Marco Sciandrone. (2014) On the use of iterative methods in cubic regularization for unconstrained optimization. Computational Optimization and Applications 60:1, pages 35-57.
Crossref
Crossref