Complexity of minimizing regularized convex quadratic functions

DOI10.1137/25M1736578MaRDI QIDQ7305212zbMATH OpenFDO

Authors Daniel Berg Thomsen, Nikita Doikov

Publication date 29 July 2026

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/25M1736578

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25)

Cites work

• A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
• A linear-time algorithm for trust region problems
• A Subspace Minimization Method for the Trust-Region Step
• Accelerated regularized Newton methods for minimizing composite convex functions
• Accelerating the cubic regularization of Newton's method on convex problems
• Acceleration by stepsize hedging: silver stepsize schedule for smooth convex optimization
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Complementary composite minimization, small gradients in general norms, and applications
• Cubic regularization of Newton method and its global performance
• Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
• Evaluation complexity of algorithms for nonconvex optimization. Theory, computation and perspectives
• First-Order Methods for Nonconvex Quadratic Minimization
• Forward-backward splitting with Bregman distances
• scientific article; zbMATH DE number 3850830 (Why is no real title available?)
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 1249730 (Why is no real title available?)
• scientific article; zbMATH DE number 3336895 (Why is no real title available?)
• Implementable tensor methods in unconstrained convex optimization
• Inexact basic tensor methods for some classes of convex optimization problems
• Lectures on convex optimization
• Lower complexity bounds for minimizing regularized functions
• Minimizing uniformly convex functions by cubic regularization of Newton method
• On Lagrange multipliers of trust-region subproblems
• On lower complexity bounds for large-scale smooth convex optimization
• On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces
• On Richardson's Method for Solving Linear Systems with Positive Definite Matrices
• On solving trust-region and other regularised subproblems in optimization
• Optimal methods of smooth convex minimization
• Oracle complexity of second-order methods for smooth convex optimization
• Primal subgradient methods with predefined step sizes
• Regularized Newton methods for minimizing functions with Hölder continuous hessians
• Relatively smooth convex optimization by first-order methods, and applications
• Solving the Trust-Region Subproblem using the Lanczos Method
• The Elements of Statistical Learning
• Trust Region Methods

This page was built for publication: Complexity of minimizing regularized convex quadratic functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305212)