String-averaging projected subgradient methods for constrained minimization
From MaRDI portal
Publication:5746721
DOI10.1080/10556788.2013.841693zbMath1286.65072arXiv1308.6378OpenAlexW2126290425MaRDI QIDQ5746721
Zaslavski, Alexander J., Yair Censor
Publication date: 7 February 2014
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.6378
algorithmconvergencefixed pointHilbert spacemetric projectionnon-expansive operatorvariable weightsvariable stringsprojected subgradient minimizationstring-averaging projection methods
Related Items (max. 100)
A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Can linear superiorization be useful for linear optimization problems? ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ Convergence of string-averaging method for a class of operators ⋮ Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
Cites Work
- Unnamed Item
- Unnamed Item
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Iterative methods for fixed point problems in Hilbert spaces
- Random algorithms for convex minimization problems
- Fejér processes with diminishing disturbances
- Projection and proximal point methods: Convergence results and counterexamples.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Fundamentals of Computerized Tomography
- Fejer algorithms with an adaptive step
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- Envelope stepsize control for iterative algorithms based on Fejer processes with attractants
- On the string averaging method for sparse common fixed‐point problems
- Incremental Stochastic Subgradient Algorithms for Convex Optimization
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: String-averaging projected subgradient methods for constrained minimization
