On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces
From MaRDI portal
Publication:3629520
DOI10.1137/070689127zbMath1161.49033arXiv0804.3647WikidataQ33681328 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
90C25: Convex programming
49M15: Newton-type methods
49M37: Numerical methods based on nonlinear programming
Related Items
Unnamed Item, Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space, 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, Strong convergence of shrinking projection methods for a family of pseudocontractive mappings in Hilbert spaces, Subgradient method for convex feasibility on Riemannian manifolds, Convex feasibility modeling and projection methods for sparse signal recovery, Viscosity iterative scheme for generalized mixed equilibrium problems and nonexpansive semigroups, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces, 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, A generalized projection-based scheme for solving convex constrained optimization problems, A non-interior continuation algorithm for solving the convex feasibility problem, Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces, An acceleration scheme for cyclic subgradient projections method, 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 convex programming solution for gate-sizing with pipelining constraints, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
