An accelerated regularized Chebyshev-Halley method for unconstrained optimization
From MaRDI portal
Recommendations
- Implementable tensor methods in unconstrained convex optimization
- On the use of third-order models with fourth-order regularization for unconstrained optimization
- A new regularized quasi-Newton method for unconstrained optimization
- A regularized Newton method without line search for unconstrained optimization
- On inexact solution of auxiliary problems in tensor methods for convex optimization
Cites work
- A proximal stochastic gradient method with progressive variance reduction
- A unified adaptive tensor approximation scheme to accelerate composite convex optimization
- Accelerated regularized Newton methods for minimizing composite convex functions
- Accelerating the cubic regularization of Newton's method on convex problems
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- Cubic regularization of Newton method and its global performance
- Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization
- Higher order necessary conditions in abstract mathematical programming
- Implementable tensor methods in unconstrained convex optimization
- On a semi-smooth Newton method and its globalization
- Oracle complexity of second-order methods for smooth convex optimization
- Structured diagonal Gauss-Newton method for nonlinear least squares
- Unified acceleration of high-order algorithms under general Hölder continuity
- Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods
This page was built for publication: An accelerated regularized Chebyshev-Halley method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542872)
