Optimization for Inconsistent Split Feasibility Problems
From MaRDI portal
Publication:2805985
Recommendations
- An unconstrained optimization approach to the split feasibility problem
- Split feasibility and fixed point problems
- scientific article; zbMATH DE number 6285844
- The split feasibility problem and its solution algorithm
- Fixed point algorithms for split feasibility problems
- Several solution methods for the split feasibility problem
- Implicit and explicit algorithms for solving the split feasibility problem
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- Regularized methods for the split feasibility problem
- Non-convex split Feasibility problems: models, algorithms and theory
Cites work
- A Two-Term PRP-Based Descent Method
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A multiprojection algorithm using Bregman projections in a product space
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Approximation of fixed points of nonexpansive mappings
- Computational method for solving a stochastic linear-quadratic control problem given an unsolvable stochastic algebraic Riccati equation
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Fixed points of nonexpanding maps
- Hard-constrained inconsistent signal feasibility problems
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Iterative algorithm for triple-hierarchical constrained nonconvex optimization problem and its application to network bandwidth allocation
- Iterative approximation of fixed points
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Some descent three-term conjugate gradient methods and their global convergence
- The multiple-sets split feasibility problem and its applications for inverse problems
- The relaxed CQ algorithm solving the split feasibility problem
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
Cited in
(2)
This page was built for publication: Optimization for Inconsistent Split Feasibility Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805985)
