On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
From MaRDI portal
Publication:3629520
DOI10.1137/070689127zbMath1161.49033arXiv0804.3647OpenAlexW2015038494WikidataQ33681328 ScholiaQ33681328MaRDI QIDQ3629520
Pini Gurfil, Ethan Hadar, Dan Butnariu, Yair Censor
Publication date: 27 May 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.3647
Convex programming (90C25) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)
Related Items (19)
Strong convergence theorem for a common fixed point of a finite family of strictly pseudo-contractive mappings and a strictly pseudononspreading mapping ⋮ A non-interior continuation algorithm for solving the convex feasibility problem ⋮ A convex programming solution for gate-sizing with pipelining constraints ⋮ Hybrid method for equilibrium problems and fixed point problems of finite families of nonexpansive semigroups ⋮ Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces ⋮ Strong convergence of shrinking projection methods for a family of pseudocontractive mappings in Hilbert spaces ⋮ Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space ⋮ An acceleration scheme for cyclic subgradient projections method ⋮ Subgradient method for convex feasibility on Riemannian manifolds ⋮ Strong convergence by a hybrid algorithm for finding a common fixed point of Lipschitz pseudocontraction and strict pseudocontraction in Hilbert spaces ⋮ Convex feasibility modeling and projection methods for sparse signal recovery ⋮ Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings ⋮ Viscosity iterative scheme for generalized mixed equilibrium problems and nonexpansive semigroups ⋮ Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods ⋮ Unnamed Item ⋮ Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces ⋮ Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures ⋮ 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 ⋮ A generalized projection-based scheme for solving convex constrained optimization problems
This page was built for publication: On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
