The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography

From MaRDI portal
Publication:2784404

DOI10.1137/S1052623499354564zbMath0992.92034WikidataQ57392939 ScholiaQ57392939MaRDI QIDQ2784404

Aharon Ben-Tal, Tamar Margalit, Arkadi Nemirovski

Publication date: 23 April 2002

Published in: SIAM Journal on Optimization (Search for Journal in Brave)




Related Items

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