On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
From MaRDI portal
Publication:3629520
DOI10.1137/070689127zbMATH Open1161.49033DBLPjournals/siamjo/ButnariuCGH08arXiv0804.3647OpenAlexW2015038494WikidataQ33681328 ScholiaQ33681328MaRDI QIDQ3629520FDOQ3629520
Pini Gurfil, Yair Censor, Ethan Hadar, Dan Butnariu
Publication date: 27 May 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0804.3647
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
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Newton-type methods (49M15)
Cited In (23)
- A generalized projection-based scheme for solving convex constrained optimization problems
- Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces
- Convex feasibility modeling and projection methods for sparse signal recovery
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces
- 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
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- Strong convergence by a hybrid algorithm for finding a common fixed point of Lipschitz pseudocontraction and strict pseudocontraction in Hilbert spaces
- Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Title not available (Why is that?)
- 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)
