Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
From MaRDI portal
Publication:5148399
Recommendations
- scientific article; zbMATH DE number 3969997
- Solving regularized total least squares problems based on eigenproblems
- Solving the cubic regularization model by a nested restarting Lanczos method
- A cubic regularization method for solving nonsmooth equations
- Solving regularized total least squares problems via a sequence of eigenvalue problems
- On regularization in multiparameter eigenvalue problems
- A cubically convergent method for solving the largest eigenvalue of a nonnegative irreducible tensor
- Regularized total least squares based on quadratic eigenvalue problem solvers
- A generalized conjugate gradient method for eigenvalue problems
- Large-scale structured eigenvalue problems
Cites work
- Accelerated methods for nonconvex 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
- ARPACK Users' Guide
- Computing a Trust Region Step
- Cubic regularization of Newton method and its global performance
- Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
- Finding approximate local minima faster than gradient descent
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Gradient descent finds the cubic-regularized nonconvex Newton step
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- Manopt, a Matlab toolbox for optimization on manifolds
- MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
- On solving trust-region and other regularised subproblems in optimization
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Solving the trust-region subproblem by a generalized eigenvalue problem
Cited in
(15)- An accelerated first-order method with complexity analysis for solving cubic regularization subproblems
- On local nonglobal minimum of trust-region subproblem and extension
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization
- Solving the cubic regularization model by a nested restarting Lanczos method
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization
- A Riemannian dimension-reduced second-order method with application in sensor network localization
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- Homogeneous second-order descent framework: a fast alternative to Newton-type methods
- An extended sequential quadratic method with extrapolation
- Regularized methods via cubic model subspace minimization for nonconvex optimization
- A line-search filter adaptive regularization algorithm using cubics based on affine scaling interior-point methods for constrained optimization
- An adaptive cubic regularisation algorithm based on interior-point methods for optimization with general inequality constraints
- Escaping saddle points in distributed nonconvex optimization via cubic regularization
- Solving regularized total least squares problems based on eigenproblems
This page was built for publication: Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5148399)
