An improvement of adaptive cubic regularization method for unconstrained optimization problems
From MaRDI portal
Recommendations
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- On the use of iterative methods in cubic regularization for unconstrained optimization
- ARC\(_q\): a new adaptive regularization by cubics
Cites work
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- A new conjugate gradient algorithm with cubic Barzilai-Borwein stepsize for unconstrained optimization
- A new modified trust region algorithm for solving unconstrained optimization problems
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Accelerating the cubic regularization of Newton's method on convex problems
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- An efficient improvement of the Newton method for solving nonconvex optimization problems
- An efficient nonmonotone trust-region method for unconstrained optimization
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Cubic regularization of Newton method and its global performance
- Gradient descent finds the cubic-regularized nonconvex Newton step
- scientific article; zbMATH DE number 1186893 (Why is no real title available?)
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- On the use of iterative methods in cubic regularization for unconstrained optimization
- On the use of the energy norm in trust-region and adaptive cubic regularization subproblems
- Testing Unconstrained Optimization Software
- The watchdog technique for forcing convergence in algorithms for constrained optimization
- Trust Region Methods
- Updating the regularization parameter in the adaptive cubic regularization algorithm
Cited in
(15)- A cubic regularization of Newton's method with finite difference Hessian approximations
- An efficient nonmonotone adaptive cubic regularization method with line search for unconstrained optimization problem
- On the use of iterative methods in cubic regularization for unconstrained optimization
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques
- Non-monotone cubic regularization BB algorithm for unconstrained optimization
- ARC\(_q\): a new adaptive regularization by cubics
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization
- Effective nonmonotone trust region method based on a simple cubic model for unconstrained optimization problems
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- An adaptive cubic regularisation algorithm based on interior-point methods for optimization with general inequality constraints
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
This page was built for publication: An improvement of adaptive cubic regularization method for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031220)
