:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Leplat, Valentin, Mayorga, Sergio, Hildebrand, Roland, Gasnikov, Alexander
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	https://arxiv.org/abs/2508.18510
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

IRON: Implicit Resolvent Optimization under Noise
por: Leplat, Valentin, et al.
Publicado: (2026)

The Geometry of Constrained Optimization: Constrained Gradient Flows via Reparameterization: A-Stable Implicit Schemes, KKT from Stationarity, and Geometry-Respecting Algorithms
por: Leplat, Valentin
Publicado: (2025)

Conic-Optimization Based Algorithms for Nonnegative Matrix Factorization
por: Leplat, Valentin, et al.
Publicado: (2021)

Joint Majorization-Minimization for Nonnegative CP and Tucker Decompositions under $β$-Divergences: Unfolding-Free Updates
por: Leplat, Valentin
Publicado: (2026)

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

Efficient Algorithms for Regularized Nonnegative Scale-invariant Low-rank Approximation Models
por: Cohen, Jeremy E., et al.
Publicado: (2024)

Prox-NAG-GS: A Semi-Implicit Proximal Method for Composite Optimization
por: Wiykiynyuy, Sikeh Gisele, et al.
Publicado: (2026)

A Parameter-free Decentralized Algorithm for Composite Convex Optimization
por: Chen, Xiaokai, et al.
Publicado: (2025)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
por: Beznosikov, Aleksandr, et al.
Publicado: (2020)

Adaptive Algorithms for Relatively Lipschitz Continuous Convex Optimization Problems
por: Stonyakin, Fedor, et al.
Publicado: (2021)

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
por: Divilkovskiy, Maxim, et al.
Publicado: (2025)

Accelerated Zero-Order SGD Method for Solving the Black Box Optimization Problem under "Overparametrization" Condition
por: Lobanov, Aleksandr, et al.
Publicado: (2023)

Acceleration Exists! Optimization Problems When Oracle Can Only Compare Objective Function Values
por: Lobanov, Aleksandr, et al.
Publicado: (2024)

The Black-Box Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation
por: Lobanov, Aleksandr, et al.
Publicado: (2023)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
por: Kovalev, Dmitry, et al.
Publicado: (2024)

Numerical analysis of the convex relaxation of the barrier parameter functional of self-concordant barriers
por: Pirau, Vitali, et al.
Publicado: (2025)

Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness
por: Kornilov, Nikita, et al.
Publicado: (2025)

Decentralized Optimization with Mixed Affine Constraints
por: Yarmoshik, Demyan, et al.
Publicado: (2026)

Clipping Improves Adam-Norm and AdaGrad-Norm when the Noise Is Heavy-Tailed
por: Chezhegov, Savelii, et al.
Publicado: (2024)

Lower and upper bounds of the convergence rate of gradient methods with composite noise in gradient
por: Vasin, Artem, et al.
Publicado: (2026)

Dual Smoothing for Decentralized Optimization
por: Rogozin, Alexander, et al.
Publicado: (2025)

Adaptive Stepsize Selection in Decentralized Convex Optimization
por: Kuruzov, Ilya, et al.
Publicado: (2025)

Gradient-Type Methods For Decentralized Optimization Problems With Polyak-Łojasiewicz Condition Over Time-Varying Networks
por: Kuruzov, Ilya, et al.
Publicado: (2022)

Decentralized Optimization with Coupled Constraints
por: Yarmoshik, Demyan, et al.
Publicado: (2024)

Higher Degree Inexact Model for Optimization problems
por: Alkousa, Mohammad, et al.
Publicado: (2024)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
por: Salloum, Hadi, et al.
Publicado: (2025)

Strengthening the finite characterizations of smooth min-max games
por: Krivchenko, Valery, et al.
Publicado: (2026)

Robustifying networks for flow problems against edge failure
por: Klyuchikov, Artyom, et al.
Publicado: (2025)

Optimal Data Splitting in Distributed Optimization for Machine Learning
por: Medyakov, Daniil, et al.
Publicado: (2024)

Decentralized Finite-Sum Optimization over Time-Varying Networks
por: Metelev, Dmitry, et al.
Publicado: (2024)

Stochastic Optimization and Data Science
por: Avetisyan, Arutyun, et al.
Publicado: (2026)

A Provably-Correct and Robust Convex Model for Smooth Separable NMF
por: Pan, Junjun, et al.
Publicado: (2025)

Block Majorization Minimization with Extrapolation and Application to $β$-NMF
por: Hien, Le Thi Khanh, et al.
Publicado: (2024)

Optimal Analysis of Method with Batching for Monotone Stochastic Finite-Sum Variational Inequalities
por: Pichugin, Alexander, et al.
Publicado: (2024)

The Mirror-Prox Sliding Method for Non-smooth decentralized saddle-point problems
por: Kuruzov, Ilya, et al.
Publicado: (2022)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
por: Lobanov, Aleksandr, et al.
Publicado: (2024)

Extragradient Sliding for Composite Non-Monotone Variational Inequalities
por: Emelyanov, Roman, et al.
Publicado: (2024)

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square
por: Chervonenkis, Boris, et al.
Publicado: (2024)

Local SGD for Near-Quadratic Problems: Improving Convergence under Unconstrained Noise Conditions
por: Sadchikov, Andrey, et al.
Publicado: (2024)

Accelerated Methods with Compression for Horizontal and Vertical Federated Learning
por: Stanko, Sergey, et al.
Publicado: (2024)