On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
From MaRDI portal
Publication:3629520
Abstract: We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation parameters in a specific self-adapting manner. This strategy leaves enough user-flexibility but gives a mathematical guarantee for the algorithm's behavior in the inconsistent case. We present numerical results of computational experiments that illustrate the computational advantage of the new method.
Recommendations
- Publication:3028739
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- scientific article; zbMATH DE number 6263278
- A parallel subgradient projections method for the convex feasibility problem
Cited in
(25)- A generalized projection-based scheme for solving convex constrained optimization problems
- Convex feasibility modeling and projection methods for sparse signal recovery
- Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces
- A non-interior continuation algorithm for solving the convex feasibility problem
- Strong convergence of shrinking projection methods for a family of pseudocontractive mappings in Hilbert spaces
- Subgradient method for convex feasibility on Riemannian manifolds
- An acceleration scheme for cyclic subgradient projections method
- Strong convergence theorem for a common fixed point of a finite family of strictly pseudo-contractive mappings and a strictly pseudononspreading mapping
- Hybrid method for equilibrium problems and fixed point problems of finite families of nonexpansive semigroups
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- scientific article; zbMATH DE number 4016617 (Why is no real title available?)
- Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces
- scientific article; zbMATH DE number 7352424 (Why is no real title available?)
- Algorithms and convergence results of projection methods for inconsistent feasibility problems: a review
- Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
- A convex programming solution for gate-sizing with pipelining constraints
- Viscosity iterative scheme for generalized mixed equilibrium problems and nonexpansive semigroups
- Iterative algorithm of common solutions for a constrained convex minimization problem, a quasi-variational inclusion problem and the fixed point problem of a strictly pseudo-contractive mapping
- Strong convergence by a hybrid algorithm for finding a common fixed point of Lipschitz pseudocontraction and strict pseudocontraction in Hilbert spaces
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Finite convergence of a subgradient projections method with expanding controls
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space
This page was built for publication: On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629520)
