:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Shu, Yunlu, Jiang, Jiaxin, Shi, Lei, Wang, Tianyu
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	https://arxiv.org/abs/2504.06814
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Zeroth-order Stochastic Cubic Newton Method Revisited
por: Liu, Yu, et al.
Publicado: (2024)

Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis
por: Kim, Jungbin, et al.
Publicado: (2022)

Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
por: Wang, Jiulin, et al.
Publicado: (2024)

Uniformly Optimal and Parameter-free First-order Methods for Convex and Function-constrained Optimization
por: Deng, Qi, et al.
Publicado: (2024)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
por: Chen, Kang, et al.
Publicado: (2025)

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
por: Kerger, Phillip, et al.
Publicado: (2024)

Computing Augustin Information via Hybrid Geodesically Convex Optimization
por: Wang, Guan-Ren, et al.
Publicado: (2024)

Breaking a Logarithmic Barrier in the Stopping Time Convergence Rate of Stochastic First-order Methods
por: Feng, Yasong, et al.
Publicado: (2025)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
por: Van Scoy, Bryan, et al.
Publicado: (2026)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
por: Huang, Ziyu, et al.
Publicado: (2024)

Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods
por: Xiao, Wenjie, et al.
Publicado: (2025)

Complexity of Projected Gradient Methods for Strongly Convex Optimization with Hölder Continuous Gradient Terms
por: Chen, Xiaojun, et al.
Publicado: (2026)

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
por: Li, Shaoze, et al.
Publicado: (2025)

Accelerated Backward Forward Method for Convex Optimization
por: Wang, Zepeng, et al.
Publicado: (2026)

Disciplined Geodesically Convex Programming
por: Cheng, Andrew, et al.
Publicado: (2024)

Subgame Perfect Methods in Nonsmooth Convex Optimization
por: Grimmer, Benjamin, et al.
Publicado: (2025)

A Zeroth-order Proximal Stochastic Gradient Method for Weakly Convex Stochastic Optimization
por: Pougkakiotis, Spyridon, et al.
Publicado: (2022)

Formalization of Complexity Analysis of the First-order Algorithms for Convex Optimization
por: Li, Chenyi, et al.
Publicado: (2024)

Near-Optimal Algorithms for Convex Simple Bilevel Optimization under Weak Assumptions
por: Jiang, Rujun, et al.
Publicado: (2024)

Adaptive Accelerated Gradient Method for Smooth Convex Optimization
por: Wang, Zepeng, et al.
Publicado: (2025)

Polyak Minorant Method for Convex Optimization
por: Devanathan, Nikhil, et al.
Publicado: (2023)

Optimal Preconditioning is a Geodesically Convex Optimization Problem
por: Doğan, M. Levent, et al.
Publicado: (2025)

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
por: Liu, Shanglin, et al.
Publicado: (2024)

Universal Gradient Methods for Stochastic Convex Optimization
por: Rodomanov, Anton, et al.
Publicado: (2024)

Subgradient Gliding Method for Nonsmooth Convex Optimization
por: Zhu, Zhihan, et al.
Publicado: (2026)

Variance-Reduced Accelerated First-order Methods: Central Limit Theorems and Confidence Statements
por: Lei, Jinlong, et al.
Publicado: (2020)

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
por: Zhu, Shuailong, et al.
Publicado: (2025)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
por: Lin, Zhenwei, et al.
Publicado: (2022)

A Retraction-Free EXTRA Method for Decentralized Optimization on the Stiefel Manifold
por: Li, Shu, et al.
Publicado: (2026)

Universal Online Convex Optimization Meets Second-order Bounds
por: Zhang, Lijun, et al.
Publicado: (2021)

A Convex Optimization Approach to Model-Free Inverse Optimal Control with Provable Convergence
por: Yu, Meiling, et al.
Publicado: (2025)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
por: Liao, Feng-Yi, et al.
Publicado: (2025)

Policy Optimization in Robust Control: Weak Convexity and Subgradient Methods
por: Watanabe, Yuto, et al.
Publicado: (2025)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
por: Cao, Jincheng, et al.
Publicado: (2024)

Mirror Descent on Riemannian Manifolds
por: Jiang, Jiaxin, et al.
Publicado: (2026)

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
por: Xu, Zeyi, et al.
Publicado: (2026)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
por: Zhu, Jiayi, et al.
Publicado: (2024)

Faster Newton Methods for Convex and Nonconvex Optimization in Gradient Complexity
por: Chen, Lesi, et al.
Publicado: (2025)

Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
por: Ren, Yijin, et al.
Publicado: (2025)

A Proximal Method for Composite Optimization with Smooth and Convex Components
por: Uzun, Samet, et al.
Publicado: (2025)