Copertina

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kerger, Phillip, Molinaro, Marco, Jiang, Hongyi, Basu, Amitabh
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Tight Lower Bounds for the Bit and Inner Product Oracle for Constrained Convex Optimization
di: Basu, Amitabh, et al.
Pubblicazione: (2025)

Sample Complexity of Stochastic Optimization with Integer Variables
di: Cheng, Hongyu, et al.
Pubblicazione: (2026)

Universality of AdaGrad Stepsizes for Stochastic Optimization: Inexact Oracle, Acceleration and Variance Reduction
di: Rodomanov, Anton, et al.
Pubblicazione: (2024)

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
di: Li, Yuchen, et al.
Pubblicazione: (2024)

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

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
di: Jiang, Bo, et al.
Pubblicazione: (2025)

Revisit First-order Methods for Geodesically Convex Optimization
di: Shu, Yunlu, et al.
Pubblicazione: (2025)

Theoretical Challenges in Learning for Branch-and-Cut
di: Cheng, Hongyu, et al.
Pubblicazione: (2026)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
di: Eckstein, Jonathan, et al.
Pubblicazione: (2025)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
di: Bastianello, Nicola, et al.
Pubblicazione: (2020)

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
di: Cheng, Hongyu, et al.
Pubblicazione: (2024)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
di: Khanh, Pham Duy, et al.
Pubblicazione: (2023)

Weak Proximal Newton Oracles for Composite Convex Optimization
di: Garber, Dan
Pubblicazione: (2025)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
di: Yang, Lei, et al.
Pubblicazione: (2024)

On the Oracle Complexity of a Riemannian Inexact Augmented Lagrangian Method for Riemannian Nonsmooth Composite Problems
di: Xu, Meng, et al.
Pubblicazione: (2024)

Learning Cut Generating Functions for Integer Programming
di: Cheng, Hongyu, et al.
Pubblicazione: (2024)

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
di: Cheng, Hongyu, et al.
Pubblicazione: (2025)

Nonasymptotic Analysis of Accelerated Methods With Inexact Oracle Under Absolute Error Bound
di: Liu, Yin, et al.
Pubblicazione: (2024)

Robustness of the Frank-Wolfe Method under Inexact Oracles and the Cost of Linear Minimization
di: Hu, Tao
Pubblicazione: (2025)

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

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
di: Ji, Kaiyi
Pubblicazione: (2025)

Online Convex Optimization with a Separation Oracle
di: Mhammedi, Zakaria
Pubblicazione: (2024)

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods
di: Kabgani, Alireza, et al.
Pubblicazione: (2026)

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

Efficient Gradient Tracking Algorithms for Distributed Optimization Problems with Inexact Communication
di: Zhao, Shengchao, et al.
Pubblicazione: (2025)

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

Convergence of First-Order Algorithms with Momentum from the Perspective of an Inexact Gradient Descent Method
di: Khanh, Pham Duy, et al.
Pubblicazione: (2025)

A Frank-Wolfe Algorithm for Oracle-based Robust Optimization
di: Besançon, Mathieu, et al.
Pubblicazione: (2024)

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
di: Abolfazli, Nazanin, et al.
Pubblicazione: (2023)

Stochastic Optimization Algorithms for Problems with Controllable Biased Oracles
di: Liu, Yin, et al.
Pubblicazione: (2023)

First Order Algorithm on an Optimization Problem with Improved Convergence when Problem is Convex
di: Sim, Chee-Khian
Pubblicazione: (2025)

Power of Generalized Smoothness in Stochastic Convex Optimization: First- and Zero-Order Algorithms
di: Lobanov, Aleksandr, et al.
Pubblicazione: (2025)

Lower Bounds for Linear Minimization Oracle Methods Optimizing over Strongly Convex Sets
di: Grimmer, Benjamin, et al.
Pubblicazione: (2026)

Abs-Smooth Frank-Wolfe Method: Primal-Dual Analysis, Heavy Ball Momentum, and Inexact Oracles
di: Tadinada, Sri Harshitha, et al.
Pubblicazione: (2026)

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

Data-Driven Learning of Two-Stage Beamformers in Passive IRS-Assisted Systems with Inexact Oracles
di: Pougkakiotis, Spyridon, et al.
Pubblicazione: (2024)

Approximation Algorithm for Generalized Budgeted Assignment Problems and Applications in Transportation Systems
di: Jiang, Hongyi, et al.
Pubblicazione: (2022)

Distributed Derivative-Free Optimization Using Inexact ADMM and Trust-Region Methods
di: Fasiku, Damilola, et al.
Pubblicazione: (2025)

An Inexact Variable Metric Proximal Gradient-subgradient Algorithm for a Class of Fractional Optimization Problems
di: Yang, Lei, et al.
Pubblicazione: (2025)

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