Lower complexity bounds for minimizing regularized functions

DOI10.1007/S11590-025-02237-XMaRDI QIDQ7289041zbMATH OpenFDO

Authors Nikita Doikov

Publication date 2 July 2026

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11590-025-02237-X

Mathematics Subject Classification ID

Numerical methods in optimal control (49Mxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Mathematical programming (90Cxx)

Cites work

• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Accelerated regularized Newton methods for minimizing composite convex functions
• Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
• Complementary composite minimization, small gradients in general norms, and applications
• Convex analysis and monotone operator theory in Hilbert spaces
• Cubic regularization of Newton method and its global performance
• Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
• Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
• Gradient methods for minimizing composite functions
• 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 3894826 (Why is no real title available?)
• Inexact accelerated high-order proximal-point methods
• Inexact high-order proximal-point methods with auxiliary search procedure
• Lectures on convex optimization
• Minimizing uniformly convex functions by cubic regularization of Newton method
• Monotone Operators and the Proximal Point Algorithm
• On lower complexity bounds for large-scale smooth convex optimization
• Optimal Algorithms for Stochastic Complementary Composite Minimization
• Optimal methods of smooth convex minimization
• Oracle complexity of second-order methods for smooth convex optimization
• Proximité et dualité dans un espace hilbertien
• Regularized Newton methods for minimizing functions with Hölder continuous hessians

Cited in

(1)

• Complexity of minimizing regularized convex quadratic functions

This page was built for publication: Lower complexity bounds for minimizing regularized functions

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