Pages that link to "Item:Q727222"

The following pages link to Stochastic intermediate gradient method for convex problems with stochastic inexact oracle (Q727222):

Displaying 16 items.

• Inexact coordinate descent: complexity and preconditioning (Q306308) (← links)
• Efficient numerical methods for entropy-linear programming problems (Q327229) (← 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)
• Composite convex optimization with global and local inexact oracles (Q1986105) (← 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)
• Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems (Q2117629) (← links)
• Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle (Q2159456) (← links)
• Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point (Q2278192) (← links)
• Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs (Q5870771) (← links)
• Subgradient ellipsoid method for nonsmooth convex problems (Q6038646) (← links)
• Hyperfast second-order local solvers for efficient statistically preconditioned distributed optimization (Q6114954) (← links)
• PAC learning halfspaces in non-interactive local differential privacy model with public unlabeled data (Q6141043) (← links)
• Stochastic regularized Newton methods for nonlinear equations (Q6158978) (← links)
• First-order methods for convex optimization (Q6169988) (← links)