Skip to content

Author

Т. В. Логінов

We have 4 of 6 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Minimax Oracle Call Complexity, Rounds and Admissible Noise in Zeroth-Order Optimization of Highly Smooth Functions

We study zeroth-order optimization of convex and strongly convex functions with H\"older smoothness of order $\beta>2$ from values corrupted by random noise with bias independent of the method's random directions, a Lipschitz systematic error and a bounded adversarial error. We measure the number of function evaluation...

Т. В. Логінов, D. Dvinskikh, Nazarii Tupitsa et al. · 0 citations
Preprint Oct 2026

Minimax Call Complexity, Rounds and Admissible Noise in Zeroth-Order Optimization of Highly Smooth Functions

We study zeroth-order optimization of convex and strongly convex functions with H\"older smoothness of order $\beta>2$ from values corrupted by random noise with bias independent of the method's random directions, a Lipschitz systematic error and a bounded adversarial error. We measure the number of function evaluation...

Т. В. Логінов, D. Dvinskikh, Nazarii Tupitsa et al. · 0 citations
Preprint Sep 2026

Lower Bounds For Gradient-Free Convex Optimization And Convex-Concave Saddle-Point Problems

We study the query complexity of optimization with exact scalar-value information. For globally $L$-smooth convex functions on $\mathbb R^d$ with a minimizer in a Euclidean ball of radius $R$, we prove the lower bound $\Omega(d\min\{d,\sqrt{LR^2/\varepsilon}\})$ for adaptive randomized algorithms in the stated accuracy...

Y. Dorn, D. Dvinskikh, Т. В. Логінов et al. · 0 citations
Preprint Sep 2026

The Complexity of Convex Optimization with Mismatched Geometry

It is shown that for this mismatched problem the minimax value of the gap is of order $LR^2/N^3$ up to logarithmic factors, for deterministic and for randomized methods alike, and already in dimension proportional to the number of queries.

Т. В. Логінов, A. Gasnikov, Yuriy Dorn et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.