Image de couverture de livre

Revisit First-order Methods for Geodesically Convex Optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Shu, Yunlu, Jiang, Jiaxin, Shi, Lei, Wang, Tianyu
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis
par: Kim, Jungbin, et autres
Publié: (2022)

Zeroth-order Stochastic Cubic Newton Method Revisited
par: Liu, Yu, et autres
Publié: (2024)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
par: Deng, Qi, et autres
Publié: (2024)

Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
par: Wang, Jiulin, et autres
Publié: (2024)

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
par: Kerger, Phillip, et autres
Publié: (2024)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
par: Chen, Kang, et autres
Publié: (2025)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
par: Van Scoy, Bryan, et autres
Publié: (2026)

Computing Augustin Information via Hybrid Geodesically Convex Optimization
par: Wang, Guan-Ren, et autres
Publié: (2024)

Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods
par: Feng, Yasong, et autres
Publié: (2025)

Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
par: Xiao, Wenjie, et autres
Publié: (2025)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
par: Huang, Ziyu, et autres
Publié: (2024)

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
par: Chen, Xiaojun, et autres
Publié: (2026)

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
par: Li, Shaoze, et autres
Publié: (2025)

Accelerated Backward Forward Method for Convex Optimization
par: Wang, Zepeng, et autres
Publié: (2026)

Subgame Perfect Methods in Nonsmooth Convex Optimization
par: Grimmer, Benjamin, et autres
Publié: (2025)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
par: Pougkakiotis, Spyridon, et autres
Publié: (2022)

Adaptive Accelerated Gradient Method for Smooth Convex Optimization
par: Wang, Zepeng, et autres
Publié: (2025)

Near-Optimal Algorithms for Convex Simple Bilevel Optimization under Weak Assumptions
par: Jiang, Rujun, et autres
Publié: (2024)

Polyak Minorant Method for Convex Optimization
par: Devanathan, Nikhil, et autres
Publié: (2023)

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
par: Liu, Shanglin, et autres
Publié: (2024)

Disciplined Geodesically Convex Programming
par: Cheng, Andrew, et autres
Publié: (2024)

Formalization of Complexity Analysis of the First-order Algorithms for Convex Optimization
par: Li, Chenyi, et autres
Publié: (2024)

Universal Gradient Methods for Stochastic Convex Optimization
par: Rodomanov, Anton, et autres
Publié: (2024)

Subgradient Gliding Method for Nonsmooth Convex Optimization
par: Zhu, Zhihan, et autres
Publié: (2026)

Variance-Reduced Accelerated First-order Methods: Central Limit Theorems and Confidence Statements
par: Lei, Jinlong, et autres
Publié: (2020)

A Retraction-Free EXTRA Method for Decentralized Optimization on the Stiefel Manifold
par: Li, Shu, et autres
Publié: (2026)

Optimal Preconditioning is a Geodesically Convex Optimization Problem
par: Doğan, M. Levent, et autres
Publié: (2025)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
par: Xu, Zeyi, et autres
Publié: (2026)

A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence
par: Yu, Meiling, et autres
Publié: (2025)

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
par: Zhu, Shuailong, et autres
Publié: (2025)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
par: Liao, Feng-Yi, et autres
Publié: (2025)

Policy Optimization in Robust Control: Weak Convexity and Subgradient Methods
par: Watanabe, Yuto, et autres
Publié: (2025)

Universal Online Convex Optimization Meets Second-order Bounds
par: Zhang, Lijun, et autres
Publié: (2021)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
par: Zhu, Jiayi, et autres
Publié: (2024)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
par: Cao, Jincheng, et autres
Publié: (2024)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
par: Chen, Lesi, et autres
Publié: (2025)

Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
par: Ren, Yijin, et autres
Publié: (2025)

A Proximal Method for Composite Optimization with Smooth and Convex Components
par: Uzun, Samet, et autres
Publié: (2025)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
par: Eckstein, Jonathan, et autres
Publié: (2025)

Federated Incremental Subgradient Method for Convex Bilevel Optimization Problems
par: Boontawee, Sudkobfa, et autres
Publié: (2026)