Pages that link to "Item:Q644912"

The following pages link to Random algorithms for convex minimization problems (Q644912):

Displaying 33 items.

• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
• Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions (Q507334) (← links)
• Near-optimal stochastic approximation for online principal component estimation (Q681490) (← links)
• Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators (Q727220) (← links)
• Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks (Q1992405) (← links)
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
• On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems (Q2045192) (← links)
• Stochastic proximal splitting algorithm for composite minimization (Q2047212) (← links)
• Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity (Q2118962) (← links)
• Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
• Projected subgradient minimization versus superiorization (Q2251567) (← links)
• Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions (Q2322367) (← links)
• Random minibatch subgradient algorithms for convex problems with functional constraints (Q2338088) (← links)
• Stochastic First-Order Methods with Random Constraint Projection (Q2796796) (← links)
• Ergodic Convergence of a Stochastic Proximal Point Algorithm (Q2828340) (← links)
• Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization (Q2977631) (← links)
• Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization (Q4558525) (← links)
• Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach (Q4625791) (← links)
• String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
• Random Function Iterations for Consistent Stochastic Feasibility (Q4632357) (← links)
• Random and cyclic projection algorithms for variational inequalities (Q5085237) (← links)
• Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
• A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
• A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints (Q5152476) (← links)
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities (Q5219716) (← links)
• Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
• Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm (Q5252921) (← links)
• Two stochastic optimization algorithms for convex optimization with fixed point constraints (Q5379458) (← links)
• String-averaging projected subgradient methods for constrained minimization (Q5746721) (← links)
• Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems (Q5870350) (← links)
• A stochastic approximation method for convex programming with many semidefinite constraints (Q5882223) (← links)
• A Bregman–Kaczmarz method for nonlinear systems of equations (Q6492445) (← links)