Random algorithms for convex minimization problems
From MaRDI portal
Publication:644912
DOI10.1007/S10107-011-0468-9zbMATH Open1229.90128OpenAlexW2012180727MaRDI QIDQ644912FDOQ644912
Authors: Angelia Nedić 
Publication date: 7 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0468-9
Recommendations
- Random minibatch subgradient algorithms for convex problems with functional constraints
- Random algorithms for solving convex inequalities
- Stochastic first-order methods with random constraint projection
- String-averaging incremental stochastic subgradient algorithms
- An optimal randomized incremental gradient method
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Theory of Reproducing Kernels
- Smooth minimization of non-smooth functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Incremental gradient algorithms with stepsizes bounded away from zero
- Title not available (Why is that?)
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Gradient Convergence in Gradient methods with Errors
- Weak Sharp Minima in Mathematical Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Gradient-based algorithms with applications to signal-recovery problems
- Functional Operators (AM-21), Volume 1
- Decomposition into functions in the minimization problem
- Incremental subgradient methods for nondifferentiable optimization
- Minimization of unsmooth functionals
- Incremental proximal methods for large scale convex optimization
- stochastic quasigradient methods and their application to system optimization†
- A New Class of Incremental Gradient Methods for Least Squares Problems
- Error bounds: necessary and sufficient conditions
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
- Relaxed Alternating Projection Methods
- The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
- Resource Allocation and Cross-Layer Control in Wireless Networks
- The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
- On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation
- A Unified Analysis of Hoffman’s Bound via Fenchel Duality
- Incremental stochastic subgradient algorithms for convex optimization
- Random algorithms for solving convex inequalities
- A note on error bounds for convex and nonconvex programs
- New error bounds and their applications to convergence analysis of iterative algorithms
- Projection algorithms: Results and open problems
- Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification
- A convex programming algorithm for noisy discrete tomography
Cited In (46)
- Random algorithms for solving convex inequalities
- Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
- Minimization Algorithms for Functions with Random Noise
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks
- An incremental mirror descent subgradient algorithm with random sweeping and proximal step
- Projected subgradient minimization versus superiorization
- Inertial-type incremental constraint projection method for solving variational inequalities without Lipschitz continuity
- Solving convex programs by random walks
- Consensus-based distributed optimisation of multi-agent networks via a two level subgradient-proximal algorithm
- Title not available (Why is that?)
- String-averaging incremental stochastic subgradient algorithms
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Stochastic reformulations of linear systems: algorithms and convergence theory
- Random Function Iterations for Consistent Stochastic Feasibility
- A smooth inexact penalty reformulation of convex problems with linear constraints
- An optimal randomized incremental gradient method
- Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators
- Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
- String-averaging projected subgradient methods for constrained minimization
- Multiple-sets split quasi-convex feasibility problems: adaptive subgradient methods with convergence guarantee
- A stochastic approximation method for convex programming with many semidefinite constraints
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Stochastic first-order methods with random constraint projection
- Random convex programs with \(L_1\)-regularization: sparsity and generalization
- A simple randomised algorithm for convex optimisation
- Random minibatch subgradient algorithms for convex problems with functional constraints
- Two stochastic optimization algorithms for convex optimization with fixed point constraints
- Title not available (Why is that?)
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
- On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems
- Ergodic convergence of a stochastic proximal point algorithm
- Random gradient-free minimization of convex functions
- Randomized first order algorithms with applications to \(\ell _{1}\)-minimization
- A stochastic moving ball approximation method for smooth convex constrained minimization
- Random and cyclic projection algorithms for variational inequalities
- A method with convergence rates for optimization problems with variational inequality constraints
- Networked parallel algorithms for robust convex optimization via the scenario approach
- A Bregman–Kaczmarz method for nonlinear systems of equations
- Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Stochastic proximal splitting algorithm for composite minimization
- Near-optimal stochastic approximation for online principal component estimation
This page was built for publication: Random algorithms for convex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644912)
