Copertina

Nesterov's method of dichotomy via Order Oracle: The problem of optimizing a two-variable function on a square

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chervonenkis, Boris, Krasnov, Andrei, Gasnikov, Alexander, Lobanov, Aleksandr
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

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

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

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

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

Randomized gradient-free methods in convex optimization
di: Gasnikov, Alexander, et al.
Pubblicazione: (2022)

Gradient-free algorithm for saddle point problems under overparametrization
di: Statkevich, Ekaterina, et al.
Pubblicazione: (2024)

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

Improved Iteration Complexity in Black-Box Optimization Problems under Higher Order Smoothness Function Condition
di: Lobanov, Aleksandr
Pubblicazione: (2024)

About some works of Boris Polyak on convergence of gradient methods and their development
di: Ablaev, Seydamet, et al.
Pubblicazione: (2023)

On quasi-convex smooth optimization problems by a comparison oracle
di: Gasnikov, A. V., et al.
Pubblicazione: (2024)

Gradient-Free Approaches is a Key to an Efficient Interaction with Markovian Stochasticity
di: Prokhorov, Boris, et al.
Pubblicazione: (2026)

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise
di: Kornilov, Nikita, et al.
Pubblicazione: (2024)

Bregman Proximal Method for Efficient Communications under Similarity
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2023)

Avoiding Bias in Clipped SGD for Overparameterized Models under Generalized Smoothness
di: Lobanov, Aleksandr, et al.
Pubblicazione: (2026)

Adaptive Regularized Newton Method with Inexact Hessian
di: Shestakov, Aleksandr, et al.
Pubblicazione: (2025)

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

Exploiting higher-order derivatives in convex optimization methods
di: Kamzolov, Dmitry, et al.
Pubblicazione: (2022)

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

Accelerated zero-order SGD under high-order smoothness and overparameterized regime
di: Bychkov, Georgii, et al.
Pubblicazione: (2024)

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

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

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

Method with Batching for Stochastic Finite-Sum Variational Inequalities in Non-Euclidean Setting
di: Pichugin, Alexander, et al.
Pubblicazione: (2024)

First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2023)

Stochastic Frank-Wolfe: Unified Analysis and Zoo of Special Cases
di: Nazykov, Ruslan, et al.
Pubblicazione: (2024)

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

Accelerated Stochastic Gradient Method with Applications to Consensus Problem in Markov-Varying Networks
di: Solodkin, Vladimir, et al.
Pubblicazione: (2024)

An efficient sieving based secant method for sparse optimization problems with least-squares constraints
di: Li, Qian, et al.
Pubblicazione: (2023)

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

Advancing the lower bounds: An accelerated, stochastic, second-order method with optimal adaptation to inexactness
di: Agafonov, Artem, et al.
Pubblicazione: (2023)

Fractional-Order Nesterov Dynamics for Convex Optimization
di: Ranoto, Tumelo
Pubblicazione: (2025)

Universal methods for variational inequalities: deterministic and stochastic cases
di: Klimza, Anton, et al.
Pubblicazione: (2024)

Accelerated linearized alternating direction method of multipliers with Nesterov extrapolation
di: He, X., et al.
Pubblicazione: (2023)

YuriiFormer: A Suite of Nesterov-Accelerated Transformers
di: Zimin, Aleksandr, et al.
Pubblicazione: (2026)

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

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

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

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

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

Nesterov Acceleration with Operator Decomposition
di: Lee, Jaewook, et al.
Pubblicazione: (2026)