{"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/accelerated-gradient-methods-for-nonconvex","title":"Accelerated Gradient Methods for Nonconvex Nonlinear and Stochastic Programming","arxiv_id":"1310.3787","date":"2013-10-14","proceeding":null,"authors":["Saeed Ghadimi","Guanghui Lan"],"abstract":"In this paper, we generalize the well-known Nesterov's accelerated gradient (AG) method, originally designed for convex smooth optimization, to solve nonconvex and possibly stochastic optimization problems. We demonstrate that by properly specifying the stepsize policy, the AG method exhibits the best known rate of convergence for solving general nonconvex smooth optimization problems by using first-order information, similarly to the gradient descent method. We then consider an important class of composite optimization problems and show that the AG method can solve them uniformly, i.e., by using the same aggressive stepsize policy as in the convex case, even if the problem turns out to be nonconvex. We demonstrate that the AG method exhibits an optimal rate of convergence if the composite problem is convex, and improves the best known rate of convergence if the problem is nonconvex. Based on the AG method, we also present new nonconvex stochastic approximation methods and show that they can improve a few existing rates of convergence for nonconvex stochastic optimization. To the best of our knowledge, this is the first time that the convergence of the AG method has been established for solving nonconvex nonlinear programming in the literature.","url_abs":"https://arxiv.org/abs/1310.3787v1","url_pdf":"https://arxiv.org/pdf/1310.3787v1.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":"accelerated-gradient-methods-for-nonconvex","repo_url":"https://github.com/Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=1310.3787","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1310.3787"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+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/Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"listed":{"samples":4,"ran":0,"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":"c9d53379cc45ccf8","entry":"MTL_ClusterBoosted_data_extract_auto","repo":"Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL","repo_kind":"listed","path":"MD_MTL/functions/utils.py","file_url":"https://github.com/Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL/blob/HEAD/MD_MTL/functions/utils.py","link_basis":"harvester_set","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":"c9d53379cc45ccf8"}},{"code_sha256_prefix":"e3e2b34e396dc7d1","entry":"MTL_data_extract","repo":"Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL","repo_kind":"listed","path":"MD_MTL/functions/utils.py","file_url":"https://github.com/Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL/blob/HEAD/MD_MTL/functions/utils.py","link_basis":"harvester_set","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":"e3e2b34e396dc7d1"}},{"code_sha256_prefix":"814dc9deee942e6e","entry":"MTL_data_split","repo":"Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL","repo_kind":"listed","path":"MD_MTL/functions/utils.py","file_url":"https://github.com/Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL/blob/HEAD/MD_MTL/functions/utils.py","link_basis":"harvester_set","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":"814dc9deee942e6e"}},{"code_sha256_prefix":"f3a1afd85bf46764","entry":"init_opts","repo":"Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL","repo_kind":"listed","path":"MD_MTL/functions/init_opts.py","file_url":"https://github.com/Interactive-Media-Lab-Data-Science-Team/Vampyr-MTL/blob/HEAD/MD_MTL/functions/init_opts.py","link_basis":"harvester_set","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":"f3a1afd85bf46764"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}