Two stochastic optimization algorithms for convex optimization with fixed point constraints
From MaRDI portal
Publication:5379458
DOI10.1080/10556788.2018.1425860zbMath1461.65157arXiv1604.04713OpenAlexW2963196177MaRDI QIDQ5379458
Publication date: 12 June 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.04713
stochastic programmingconvex optimizationfixed pointnonexpansive mappingstochastic gradient methodstochastic proximal point algorithmHalpern fixed point algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Stochastic programming (90C15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings
- Proximal point algorithms for nonsmooth convex optimization with fixed point constraints
- An optimal method for stochastic composite optimization
- A simple randomised algorithm for convex optimisation
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Random algorithms for convex minimization problems
- Incremental proximal methods for large scale convex optimization
- Optimality functions in stochastic programming
- Stochastic programming approach to optimization under uncertainty
- Approximation of fixed points of nonexpansive mappings
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- A theorem on maximal monotonic sets in Hilbert space
- Convergence theory for nonconvex stochastic programming with an application to mixed logit
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- A primal-dual decomposition algorithm for multistage stochastic convex programming
- Hard-constrained inconsistent signal feasibility problems
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Stochastic First-Order Methods with Random Constraint Projection
- Stochastic Approximations and Perturbations in Forward-Backward Splitting for Monotone Operators
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Proximal Splitting Methods in Signal Processing
- Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings
- Computing Medians and Means in Hadamard Spaces
- Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- Robust Wideband Beamforming by the Hybrid Steepest Descent Method
- Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Acceleration Method Combining Broadcast and Incremental Distributed Optimization Algorithms
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Fixed points of nonexpanding maps
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm
