Copertina

Online Convex Optimization Using Coordinate Descent Algorithms

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lin, Yankai, Shames, Iman, Nešić, Dragan
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Optimization and Control Systems and Control 68Q32 (Primary), 68T05, 90C25 (Secondary)
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
di: Ye, Yuhan, et al.
Pubblicazione: (2026)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
di: Gupta, Swati, et al.
Pubblicazione: (2026)

A Function-Space Stability Boundary for Generalization in Interpolating Learning Systems
di: Katende, Ronald
Pubblicazione: (2026)

Topological structure and a polynomial-time solution of linear programming over the real numbers
di: Wei, Jing-Yuan
Pubblicazione: (2018)

A non-iterative polynomial algorithm for linear programming
di: Jing-Yuan, Wei
Pubblicazione: (2013)

The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
di: Azizian, Waïss, et al.
Pubblicazione: (2022)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
di: Chu, Hong T. M.
Pubblicazione: (2026)

Approximating k-Center via Farthest-First on $δ$-Covers
di: Wilson, Jason R.
Pubblicazione: (2026)

Learning Decision-Sufficient Representations for Linear Optimization
di: Ye, Yuhan, et al.
Pubblicazione: (2026)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
di: Nesterov, Yurii
Pubblicazione: (2025)

How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning : The Upside of Data Heterogeneity
di: Zhu, Mingxi, et al.
Pubblicazione: (2022)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
di: Ouyang, Wenqing, et al.
Pubblicazione: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
di: Ouyang, Wenqing
Pubblicazione: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
di: Zhang, Liwei, et al.
Pubblicazione: (2025)

Efficient Learning for Entropy-Regularized Markov Decision Processes via Multilevel Monte Carlo
di: Meunier, Matthieu, et al.
Pubblicazione: (2025)

Birkhoff interpolation models for optimization with some available derivatives
di: Larson, Jeffrey, et al.
Pubblicazione: (2026)

On the Hardness of Short and Sign-Compatible Circuit Walks
di: Borgwardt, Steffen, et al.
Pubblicazione: (2024)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
di: Hua, Zheng, et al.
Pubblicazione: (2021)

Consensus in Multiagent Systems under communication failure
di: Bentaibi, Mohamed, et al.
Pubblicazione: (2024)

On the Curvature of the Central Path of Linear Programming Theory
di: Dedieu, Jean-Pierre, et al.
Pubblicazione: (2003)

Analysis of Kernel Mirror Prox for Measure Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
di: Mohammadisiahroudi, Mohammadhossein, et al.
Pubblicazione: (2023)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
di: Bauschke, Heinz H., et al.
Pubblicazione: (2025)

ADAPT: Lightweight, Long-Range Machine Learning Force Fields Without Graphs
di: Dramko, Evan, et al.
Pubblicazione: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
di: Sun, Defeng, et al.
Pubblicazione: (2024)

Wall-Clock Complexity for Zeroth-Order Optimization with Tunable Oracle Fidelity
di: Suvorikova, Alexandra, et al.
Pubblicazione: (2026)

Backpropagation from KL Projections: Differential and Exact I-Projection Correspondences
di: Lal, Manish Krishan
Pubblicazione: (2025)

An Efficient Stochastic First-Order Algorithm for Nonconvex-Strongly Concave Minimax Optimization beyond Lipschitz Smoothness
di: Gao, Yan, et al.
Pubblicazione: (2026)

Learning to Choose Branching Rules for Nonconvex MINLPs
di: Berthold, Timo, et al.
Pubblicazione: (2026)

On-Average Stability of Multipass Preconditioned SGD and Effective Dimension
di: Vary, Simon, et al.
Pubblicazione: (2026)

Congestion and Penalization in Optimal Transport
di: Gallardo, Marcelo, et al.
Pubblicazione: (2024)

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
di: Bot, Radu Ioan, et al.
Pubblicazione: (2024)

Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2026)

Distributed Computing for Huge-Scale Aggregative Convex Programming
di: Tao, Luoyi
Pubblicazione: (2026)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

A practical randomized trust-region method to escape saddle points in high dimension
di: Dragomir, Radu-Alexandru, et al.
Pubblicazione: (2026)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
di: Yang, Xiangyu, et al.
Pubblicazione: (2021)

Improved global performance guarantees of second-order methods in convex minimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
di: Rubbens, Anne, et al.
Pubblicazione: (2025)