Pages that link to "Item:Q1746349"
From MaRDI portal
The following pages link to Universal method for stochastic composite optimization problems (Q1746349):
Displaying 25 items.
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints (Q1683173) (← links)
- Dual methods for finding equilibriums in mixed models of flow distribution in large transportation networks (Q1757624) (← links)
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems (Q2042418) (← links)
- Noisy zeroth-order optimization for non-smooth saddle point problems (Q2104286) (← links)
- Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems (Q2117629) (← links)
- Machine learning algorithms of relaxation subgradient method with space extension (Q2117655) (← links)
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
- Accelerated directional search with non-Euclidean prox-structure (Q2290400) (← links)
- Universal method of searching for equilibria and stochastic equilibria in transportation networks (Q2314190) (← links)
- Comparative analysis of gradient methods for source identification in a diffusion-logistic model (Q2672030) (← links)
- Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)
- Contracting Proximal Methods for Smooth Convex Optimization (Q5139832) (← links)
- Generalized Momentum-Based Methods: A Hamiltonian Perspective (Q5857293) (← links)
- Inexact model: a framework for optimization and variational inequalities (Q5865338) (← links)
- An optimal gradient method for smooth strongly convex minimization (Q6038652) (← links)
- Gradient-free methods for non-smooth convex stochastic optimization with heavy-tailed noise on convex compact (Q6060544) (← links)
- Numerical algorithm for source determination in a diffusion-logistic model from integral data based on tensor optimization (Q6078011) (← links)
- Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
- Multistage transportation model and sufficient conditions for its potentiality (Q6153312) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Algorithms with gradient clipping for stochastic optimization with heavy-tailed noise (Q6204268) (← links)
- An accelerated stochastic mirror descent method (Q6601963) (← links)
- Complementary composite minimization, small gradients in general norms, and applications (Q6634528) (← links)
- High-probability complexity bounds for non-smooth stochastic convex optimization with heavy-tailed noise (Q6655806) (← links)
- An accelerated decentralized stochastic optimization algorithm with inexact model (Q6664887) (← links)
