A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
[2402.18308] A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Mathematics > Optimization and Control arXiv:2402.18308 (math) [Submitted on 28 Feb 2024 ( v1 ), last revised 1 May 2026 (this version, v2)] Title: A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds Authors: Chunming Tang , Shajie Xing , Wen Huang , Jinbao Jian View a PDF of the paper titled A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds, by Chunming Tang and 3 other authors View PDF HTML (experimental) Abstract: In this paper, a restricted memory quasi-Newton bundle method for minimizing a locally Lipschitz continuous function over a Riemannian manifold is proposed. The curvature information of the objective function is approximated by applying a Riemannian version of the quasi-Newton updating formulas. A Riemannian subgradient aggregation technique is proposed and used to significantly reduce the computations in the quadratic programming subproblem when calculating the candidate descent direction. Moreover, a Riemannian line-search procedure is proposed to generate the stepsizes, and the process is finitely terminated under the assumption of a newly proposed Riemannian semismoothness. Global convergence of the proposed method is established: if the serious iteration steps are finite, then the last serious iterate is stationary; otherwise, every accumulation point of the serious iteration sequence is stationary. In addition, a modified algorithm with limited-memory quasi-Newton updates is presented to further reduce the computational cost. Finally, numerical experiments demonstrate that (i) the quasi-Newton updates accelerate the convergence of the bundle method, (ii) the aggregation technique significantly reduces the computational cost for solving the quadratic programming subproblem, and (iii) the proposed methods outperform the compared state-of-the-art Riemannian optimization methods for locally Lipschitz continuous functions. Subjects: Optimization and Control (math.OC) Cite as: arXiv:2402.18308 [math.OC] (or arXiv:2402.18308v2 [math.OC] for this version) https://doi.org/10.48550/arXiv.2402.18308 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Shajie Xing [ view email ] [v1] Wed, 28 Feb 2024 13:07:51 UTC (550 KB) [v2] Fri, 1 May 2026 09:36:57 UTC (185 KB) Full-text links: Access Paper: View a PDF of the paper titled A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds, by Chunming Tang and 3 other authors View PDF HTML (experimental) TeX Source view license Current browse context: math.OC < prev | next > new | recent | 2024-02 Change to browse by: math References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from
Related documents
- A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds#189178
- A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds#189078
- A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds#189028
- Hessian Schatten-Norm Regularization for Linear Inverse Problems#235364
- Projected Riemannian Gradient Descent for the Bures-Wasserstein Barycenter: Dimension-Independent Linear Convergence at Unit Step Size#639697
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive