Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
From MaRDI portal
Publication:4924105
DOI10.1080/10556788.2011.610458zbMath1270.90078WikidataQ58185680 ScholiaQ58185680MaRDI QIDQ4924105
Publication date: 30 May 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.610458
90C30: Nonlinear programming
Related Items
On the Quadratic Convergence of the Cubic Regularization Method under a Local Error Bound Condition, A Flexible Framework for Cubic Regularization Algorithms for Nonconvex Optimization in Function Space, ARCq: a new adaptive regularization by cubics, A note on the worst-case complexity of nonlinear stepsize control methods for convex smooth unconstrained optimization, On High-Order Multilevel Optimization Strategies, Three-steps modified Levenberg-Marquardt method with a new line search for systems of nonlinear equations, Complexity bound of trust-region methods for convex smooth unconstrained multiobjective optimization, A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression, On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation, On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization, Nonlinear stepsize control algorithms: complexity bounds for first- and second-order optimality, Concise complexity analyses for trust region methods, Regional complexity analysis of algorithms for nonconvex smooth optimization, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary, An efficient two-step trust-region algorithm for exactly determined consistent systems of nonlinear equations, Recent advances in trust region algorithms, A modified two steps Levenberg-Marquardt method for nonlinear equations, On the use of iterative methods in cubic regularization for unconstrained optimization, Adaptive augmented Lagrangian methods: algorithms and practical numerical experience, On the worst-case complexity of nonlinear stepsize control algorithms for convex unconstrained optimization, A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
Cites Work
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- An improved trust region algorithm for nonlinear equations
- Convergence rate of the trust region method for nonlinear equations under local error bound condition
- Convergence properties of trust region methods for linear and convex constraints
- A retrospective trust-region method for unconstrained optimization
- Trust-region and other regularisations of linear least-squares problems
- A new trust region method for nonlinear equations
- Cubic regularization of Newton method and its global performance
- A modified trust region algorithm for nonlinear equations with new updating rule of trust region radius
- Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- A Family of Trust-Region-Based Algorithms for Unconstrained Minimization with Strong Global Convergence Properties
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints
- Affine conjugate adaptive Newton methods for nonlinear elastomechanics
- Modified Gauss–Newton scheme with worst case guarantees for global performance
