The following pages link to Alexander V. Gasnikov (Q2026149):
Displaying 50 items.
- Efficient numerical methods for entropy-linear programming problems (Q327229) (← links)
- Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex (Q510299) (← links)
- (Q727221) (redirect page) (← links)
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle (Q727222) (← links)
- On the intermediate asymptotic of the solution to the Cauchy problem for a quasilinear equation of parabolic type with a monotone initial condition (Q733996) (← links)
- Gradient-free two-point methods for solving stochastic nonsmooth convex optimization problems with small non-random noises (Q1616222) (← links)
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints (Q1683173) (← links)
- Universal method for stochastic composite optimization problems (Q1746349) (← links)
- Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks (Q1757624) (← links)
- Mirror descent and constrained online optimization problems (Q2026150) (← links)
- An accelerated directional derivative method for smooth stochastic convex optimization (Q2029381) (← links)
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems (Q2042418) (← links)
- Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other (Q2069678) (← links)
- Noisy zeroth-order optimization for non-smooth saddle point problems (Q2104286) (← links)
- Decentralized convex optimization under affine constraints for power systems control (Q2104293) (← links)
- One-point gradient-free methods for smooth and non-smooth saddle-point problems (Q2117626) (← links)
- Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems (Q2117629) (← links)
- Oracle complexity separation in convex optimization (Q2139268) (← links)
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
- Improved exploitation of higher order smoothness in derivative-free optimization (Q2162687) (← links)
- Zeroth-order methods for noisy Hölder-gradient functions (Q2162695) (← links)
- Stochastic saddle-point optimization for the Wasserstein barycenter problem (Q2162697) (← links)
- Vaidya's method for convex stochastic optimization problems in small dimension (Q2170511) (← links)
- Gradient methods for problems with inexact model of the objective (Q2181750) (← links)
- Accelerated and unaccelerated stochastic gradient descent in model generality (Q2210408) (← links)
- Accelerated methods for saddle-point problem (Q2214606) (← links)
- Alternating minimization methods for strongly convex optimization (Q2232092) (← links)
- Accelerated gradient sliding for minimizing a sum of functions (Q2243755) (← links)
- Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point (Q2278192) (← links)
- On the upper bound for the expectation of the norm of a vector uniformly distributed on the sphere and the phenomenon of concentration of uniform measure on the sphere (Q2282831) (← links)
- Accelerated gradient-free optimization methods with a non-Euclidean proximal operator (Q2289040) (← links)
- Accelerated directional search with non-Euclidean prox-structure (Q2290400) (← links)
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems (Q2313241) (← links)
- Universal method of searching for equilibria and stochastic equilibria in transportation networks (Q2314190) (← links)
- An adaptive proximal method for variational inequalities (Q2332639) (← links)
- On efficient randomized algorithms for finding the PageRank vector (Q2354453) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case (Q2397263) (← links)
- Mirror descent and convex optimization problems with non-smooth inequality constraints (Q2415205) (← links)
- Primal-dual mirror descent method for constraint stochastic optimization problems (Q2416753) (← links)
- Reachability of optimal convergence rate estimates for high-order numerical convex optimization methods (Q2424400) (← links)
- On entropy-type functionals arising in stochastic chemical kinetics related to the concentration of the invariant measure and playing the role of Lyapunov functions in the dynamics of quasiaverages (Q2439994) (← links)
- Stochastic intermediate gradient method for convex optimization problems (Q2631196) (← links)
- Accelerated meta-algorithm for convex optimization problems (Q2656390) (← links)
- A stable alternative to Sinkhorn's algorithm for regularized optimal transport (Q2663747) (← links)
- Optimal combination of tensor optimization methods (Q2679782) (← links)
- Penalty-based method for decentralized optimization over time-varying graphs (Q2679790) (← links)
- Evolutionary interpretations of entropy model for correspondence matrix calculation (Q2826621) (← links)
- On the velocity of separation between two successive traveling waves in the asymptotics of the solution to the Cauchy problem for a Burgers-type equation (Q2836607) (← links)
- Comparison of GPS observations made in a forestry setting using functional data analysis (Q2887047) (← links)
