String-averaging projected subgradient methods for constrained minimization
From MaRDI portal
Abstract: We consider constrained minimization problems and propose to replace the projection onto the entire feasible region, required in the Projected Subgradient Method (PSM), by projections onto the individual sets whose intersection forms the entire feasible region. Specifically, we propose to perform such projections onto the individual sets in an algorithmic regime of a feasibility-seeking iterative projection method. For this purpose we use the recently developed family of Dynamic String-Averaging Projection (DSAP) methods wherein iteration-index-dependent variable strings and variable weights are permitted. This gives rise to an algorithmic scheme that generalizes, from the algorithmic structural point of view, earlier work of Helou Neto and De Pierro, of Nedi'c, of Nurminski, and of Ram et al.
Recommendations
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- scientific article; zbMATH DE number 7753396
- Projected subgradient minimization versus superiorization
Cites work
- Applied iterative methods.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Envelope stepsize control for iterative algorithms based on Fejér processes with attractants
- Feasibility and infeasibility in optimization. Algorithms and computational methods.
- Fejer algorithms with an adaptive step
- Fejér processes with diminishing disturbances
- Fundamentals of Computerized Tomography
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- Incremental stochastic subgradient algorithms for convex optimization
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Iterative methods for fixed point problems in Hilbert spaces
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- On the string averaging method for sparse common fixed-point problems
- Projection and proximal point methods: Convergence results and counterexamples.
- Random algorithms for convex minimization problems
Cited in
(14)- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Convergence of string-averaging method for a class of operators
- String-averaging incremental subgradients for constrained convex optimization with applications to reconstruction of tomographic images
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- String-averaging incremental stochastic subgradient algorithms
- Can linear superiorization be useful for linear optimization problems?
- Superiorization of incremental optimization algorithms for statistical tomographic image reconstruction
- String-averaging algorithms for convex feasibility with infinitely many sets
- scientific article; zbMATH DE number 6285845 (Why is no real title available?)
- Convergence and semi-convergence of a class of constrained block iterative methods
- Superiorization technique with a projected subgradient method for games
- An accelerated version of block cyclic subgradient projection method for solving convex feasibility problems
- Optimization on solution sets of common fixed point problems with a countable family of maps
This page was built for publication: String-averaging projected subgradient methods for constrained minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5746721)
