{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/complexity-of-minimizing-regularized-convex","title":"Complexity of Minimizing Regularized Convex Quadratic Functions","arxiv_id":"2404.17543","date":"2024-04-26","proceeding":null,"authors":["Daniel Berg Thomsen","Nikita Doikov"],"abstract":"In this work, we study the iteration complexity of gradient methods for minimizing convex quadratic functions regularized by powers of Euclidean norms. We show that, due to the uniform convexity of the objective, gradient methods have improved convergence rates. Thus, for the basic gradient descent with a novel step size, we prove a convergence rate of $O(N^{-p/(p - 2)})$ for the functional residual, where $N$ is the iteration number and $p > 2$ is the power of the regularization term. We also show that this rate is tight by establishing a corresponding lower bound for one-step first-order methods. Then, for the general class of all multi-step methods, we establish that the rate of $O(N^{-2p/(p-2)})$ is optimal, providing a sharp analysis of the minimization of uniformly convex regularized quadratic functions. This rate is achieved by the fast gradient method. A special case of our problem class is $p=3$, which is the minimization of cubically regularized convex quadratic functions. It naturally appears as a subproblem at each iteration of the cubic Newton method. Therefore, our theory shows that the rate of $O(N^{-6})$ is optimal in this case. We also establish new lower bounds on minimizing the gradient norm within our framework.","url_abs":"https://arxiv.org/abs/2404.17543v2","url_pdf":"https://arxiv.org/pdf/2404.17543v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"complexity-of-minimizing-regularized-convex","repo_url":"https://github.com/danielbergthomsen/regularized-quadratics","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2404.17543","atlas_url":"https://app.syntology.ai/?focus=2404.17543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17543"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/danielbergthomsen/regularized-quadratics","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":3,"unverified":1},"by_repo_kind":{"official":{"samples":4,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"cc6ee9ea13eb000c","entry":"chebyshev_extrema","repo":"danielbergthomsen/regularized-quadratics","repo_kind":"official","path":"experiment/regularized_quadratic.py","file_url":"https://github.com/danielbergthomsen/regularized-quadratics/blob/HEAD/experiment/regularized_quadratic.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cc6ee9ea13eb000c"}},{"code_sha256_prefix":"13a1de6900ab62b4","entry":"lanczos_method","repo":"danielbergthomsen/regularized-quadratics","repo_kind":"official","path":"experiment/krylov_solvers.py","file_url":"https://github.com/danielbergthomsen/regularized-quadratics/blob/HEAD/experiment/krylov_solvers.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"13a1de6900ab62b4"}},{"code_sha256_prefix":"8ae52f60ece2f982","entry":"projection_simplex_sort","repo":"danielbergthomsen/regularized-quadratics","repo_kind":"official","path":"experiment/regularized_quadratic.py","file_url":"https://github.com/danielbergthomsen/regularized-quadratics/blob/HEAD/experiment/regularized_quadratic.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"8ae52f60ece2f982"}},{"code_sha256_prefix":"53261d620bc646e7","entry":"problem_generator","repo":"danielbergthomsen/regularized-quadratics","repo_kind":"official","path":"experiment/regularized_quadratic.py","file_url":"https://github.com/danielbergthomsen/regularized-quadratics/blob/HEAD/experiment/regularized_quadratic.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"53261d620bc646e7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}