Cyclic subgradient projections
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3912113 (Why is no real title available?)
- scientific article; zbMATH DE number 3269391 (Why is no real title available?)
- An interior points algorithm for the convex feasibility problem
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
- The method of projections for finding the common point of convex sets
Cited in
(51)- A generalized projection-based scheme for solving convex constrained optimization problems
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Convex feasibility modeling and projection methods for sparse signal recovery
- Using projected cutting planes in the extended cutting plane method
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- On the finite convergence of a projected cutter method
- An automatic relaxation method for solving interval linear inequalities
- Minimization of equilibrium problems, variational inequality problems and fixed point problems
- Subgradient projectors: extensions, theory, and characterizations
- Subgradient method for convex feasibility on Riemannian manifolds
- An acceleration scheme for cyclic subgradient projections method
- A general iterative scheme with applications to convex optimization and related fields
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Algorithms for the quasiconvex feasibility problem
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
- On finitely convergent iterative methods for the convex feasibility problem
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Linear convergence of subgradient algorithm for convex feasibility on Riemannian manifolds
- Hilbertian convex feasibility problem: Convergence of projection methods
- Strong convergence of projection-like methods in Hilbert spaces
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Algorithmic approach to a minimization problem
- Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
- Relaxed outer projections, weighted averages and convex feasibility
- Comparing averaged relaxed cutters and projection methods: theory and examples
- An interior points algorithm for the convex feasibility problem
- Strong convergence of alternating projections
- On the string averaging method for sparse common fixed-point problems
- A row-action method for convex programming
- On subgradient projectors
- A method for approximating the solution set of a system of convex inequalities by polytopes
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem
- Primal-dual row-action method for convex programming
- Finite convergence of a subgradient projections method with expanding controls
- Convergence analysis of a parallel projection algorithm for solving convex feasibility problems
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- Non-monotonous sequential subgradient projection algorithm for convex feasibility problem
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Extrapolation algorithm for affine-convex feasibility problems
- Block-iterative surrogate projection methods for convex feasibility problems
- A finitely convergent ``row-action method for the convex feasibility problem
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
This page was built for publication: Cyclic subgradient projections
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953572)
