:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Lobanov, Aleksandr
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2407.03507
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

New Aspects of Black Box Conditional Gradient: Variance Reduction and One Point Feedback
by: Veprikov, Andrey, et al.
Published: (2024)

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

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
by: Wang, Nuozhou, et al.
Published: (2023)

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

Last-Iterate Complexity of SGD for Convex and Smooth Stochastic Problems
by: Garrigos, Guillaume, et al.
Published: (2025)

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

Optimization Outperforms Unscented Techniques for Nonlinear Smoothing
by: Howell, Payton, et al.
Published: (2025)

On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
by: Bai, Yunyan, et al.
Published: (2024)

Smoothing Iterative Consensus-based Optimization Algorithm for Nonsmooth Nonconvex Optimization Problems with Global Optimality
by: Wei, Jiazhen, et al.
Published: (2025)

A Zeroth-Order Extra-Gradient Method for Black-Box Constrained Optimization
by: Zhou, Yuke, et al.
Published: (2025)

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

Formalization of Optimality Conditions for Smooth Constrained Optimization Problems
by: Li, Chenyi, et al.
Published: (2025)

An Iterative Problem-Driven Scenario Reduction Framework for Stochastic Optimization with Conditional Value-at-Risk
by: Zhuang, Yingrui, et al.
Published: (2025)

Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions
by: Berthold, Timo, et al.
Published: (2026)

On the Complexity of Lower-Order Implementations of Higher-Order Methods
by: Doikov, Nikita, et al.
Published: (2025)

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

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

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

Convergence of the Iterates for Momentum and RMSProp for Local Smooth Functions: Adaptation is the Key
by: Bensaid, Bilel, et al.
Published: (2024)

Methods for Optimization Problems with Markovian Stochasticity and Non-Euclidean Geometry
by: Solodkin, Vladimir, et al.
Published: (2024)

Distributed Stochastic Optimization for Non-Smooth and Weakly Convex Problems under Heavy-Tailed Noise
by: Hu, Jun, et al.
Published: (2025)

Higher-Order Newton Methods with Polynomial Work per Iteration
by: Ahmadi, Amir Ali, et al.
Published: (2023)

Last Iterate Convergence of AdaGrad-Norm for Convex Non-Smooth Optimization
by: Preobrazhenskaia, Margarita, et al.
Published: (2026)

Picard Iteration for Parameter Estimation in Nonlinear Ordinary Differential Equations
by: Talitckii, Aleksandr, et al.
Published: (2024)

Parametric Disjunctive Cuts for Sequences of Mixed Integer Linear Optimization Problems
by: Kelley, Shannon, et al.
Published: (2025)

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

Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similarity
by: Bylinkin, Dmitry, et al.
Published: (2024)

Optimizing Optimizations, Declaratively: Optimizing the Higher-Order Functions in Mathematical Optimization with egglog
by: Ishii, Hiromi
Published: (2026)

Complexity Bounds for Smooth Multiobjective Optimization
by: Sampaio, Phillipe R.
Published: (2025)

Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient
by: Di, Hao, et al.
Published: (2024)

High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions
by: Ye, Haishan
Published: (2026)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
by: Boche, Holger, et al.
Published: (2025)

A Data-Driven Bayesian Nonparametric Approach for Black-Box Optimization
by: Wang, Haowei, et al.
Published: (2020)