Accelerated adaptive cubic regularized quasi-Newton methods
From MaRDI portal
Cites work
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- A stochastic quasi-Newton method for large-scale optimization
- A sub-sampled tensor method for nonconvex optimization
- A Theoretical and Experimental Study of the Symmetric Rank-One Update
- 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
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- An interior-point method for large-scale l₁-regularized logistic regression
- Analysis of a Symmetric Rank-One Trust Region Method
- Application of interior-point methods to model predictive control
- Conditioning of Quasi-Newton Methods for Function Minimization
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Cubic regularization of Newton method and its global performance
- Deep unfolding of a proximal interior point method for image restoration
- Global convergence of online limited memory BFGS
- Greedy quasi-Newton methods with explicit superlinear convergence
- scientific article; zbMATH DE number 3121939 (Why is no real title available?)
- scientific article; zbMATH DE number 3148721 (Why is no real title available?)
- scientific article; zbMATH DE number 3579922 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3048044 (Why is no real title available?)
- scientific article; zbMATH DE number 3057606 (Why is no real title available?)
- scientific article; zbMATH DE number 3064462 (Why is no real title available?)
- scientific article; zbMATH DE number 3066178 (Why is no real title available?)
- Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization
- Implementable tensor methods in unconstrained convex optimization
- Inexact basic tensor methods for some classes of convex optimization problems
- Inexact high-order proximal-point methods with auxiliary search procedure
- Inexact tensor methods and their application to stochastic convex optimization
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Lectures on convex optimization
- Local convergence of tensor methods
- Near-optimal hyperfast second-order method for convex optimization
- New results on superlinear convergence of classical quasi-Newton methods
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Newton's method and its use in optimization
- Newton's method in general analysis.
- Newton-type methods for non-convex optimization under inexact Hessian information
- Numerical Optimization
- On inexact solution of auxiliary problems in tensor methods for convex optimization
- Optimal step length for the Newton method: case of self-concordant functions
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- Quasi-Newton Methods and their Application to Function Minimisation
- Quasi-Newton Methods, Motivation and Theory
- Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms
- Rates of superlinear convergence for classical quasi-Newton methods
- Regularized Newton method for unconstrained convex optimization
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence
- Set-limited functions and polynomial-time interior-point methods
- SGD-QN: careful quasi-Newton stochastic gradient descent
- Super-Universal Regularized Newton Method
- Superfast second-order methods for unconstrained convex optimization
- Trust Region Methods
This page was built for publication: Accelerated adaptive cubic regularized quasi-Newton methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6917662)
