Pages that link to "Item:Q2784404"

The following pages link to The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography (Q2784404):

Displaying 41 items.

• Primal-dual subgradient methods for convex problems (Q116219) (← links)
• A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453) (← links)
• The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
• Incremental proximal methods for large scale convex optimization (Q644913) (← links)
• A version of the mirror descent method to solve variational inequalities (Q681901) (← links)
• A mirror descent algorithm for minimization of mean Poisson flow driven losses (Q891204) (← links)
• Projected subgradient methods with non-Euclidean distances for non-differentiable convex minimization and variational inequalities (Q1016351) (← links)
• Algorithms of inertial mirror descent in convex problems of stochastic optimization (Q1641948) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• Distributed constrained optimization via continuous-time mirror design (Q1713810) (← links)
• Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
• Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622) (← links)
• The effect of deterministic noise in subgradient methods (Q1960191) (← links)
• Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• Augmented Lagrangian method with alternating constraints for nonlinear optimization problems (Q2420821) (← links)
• Recursive aggregation of estimators by the mirror descent algorithm with averaging (Q2432961) (← links)
• Nonmonotone projected gradient methods based on barrier and Euclidean distances (Q2477010) (← links)
• PROBLEMS OF DIFFERENTIAL AND TOPOLOGICAL DIAGNOSTICS. PART II. PROBLEM OF DIFFERENTIAL DIAGNOSTICS (Q3387481) (← links)
• PROBLEMS OF DIFFERENTIAL AND TOPOLOGICAL DIAGNOSTICS. PART 3. THE CHECKING PROBLEM (Q3387490) (← links)
• A derivative-free comirror algorithm for convex optimization (Q3458813) (← links)
• An incremental mirror descent subgradient algorithm with random sweeping and proximal step (Q4613984) (← links)
• Re-examination of Bregman functions and new properties of their divergences (Q4613995) (← links)
• Efficient learning of discrete graphical models* (Q5032038) (← links)
• Asymptotically Exact Data Augmentation: Models, Properties, and Algorithms (Q5066390) (← links)
• PROBLEMS OF DIFFERENTIAL AND TOPOLOGICAL DIAGNOSTICS. PART 5. THE CASE OF TRAJECTORIAL MEASUREMENTS WITH ERROR (Q5071452) (← links)
• Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
• PROBLEMS OF DIFFERENTIAL AND TOPOLOGICAL DIAGNOSTICS. PART 6. STATISTICAL SOLVING OF THE PROBLEM OF DIFFERENTIAL DIAGNOSTICS (Q5089876) (← links)
• PROBLEMS OF DIFFERENTIAL AND TOPOLOGICAL DIAGNOSTICS. PART 4. THE CASE OF EXACT TRAJECTORIAL MEASUREMENTS (Q5152111) (← links)
• PROBLEMS OF DIFFERENTIAL AND TOPOLOGICAL DIAGNOSTICS. PART 1. MOTION EQUATIONS AND CLASSIFICATION OF MALFUNCTIONS (Q5204944) (← links)
• Universal intermediate gradient method for convex problems with inexact oracle (Q5865342) (← links)
• Tseng’s Algorithm with Extrapolation from the past Endowed with Variable Metrics and Error Terms (Q5871558) (← links)
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization (Q5962719) (← links)
• Analysis of the Frank-Wolfe method for convex composite optimization involving a logarithmically-homogeneous barrier (Q6038640) (← links)
• Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique (Q6053929) (← links)
• Stochastic composition optimization of functions without Lipschitz continuous gradient (Q6108982) (← links)
• Stochastic incremental mirror descent algorithms with Nesterov smoothing (Q6145577) (← links)
• Convergence rate analysis of the multiplicative gradient method for PET-type problems (Q6161276) (← links)
• First-order methods for convex optimization (Q6169988) (← links)
• Data-Driven Mirror Descent with Input-Convex Neural Networks (Q6171691) (← links)