Optimization for Inconsistent Split Feasibility Problems
DOI10.1080/01630563.2015.1080270zbMATH Open1339.49031OpenAlexW2268867923MaRDI QIDQ2805985FDOQ2805985
Publication date: 13 May 2016
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2015.1080270
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
convex optimizationthree-term conjugate gradient methodinverse problemsfixed pointnonexpansive mappinginconsistent split feasibility problems
Convex programming (90C25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Inverse problems in optimal control (49N45)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- A multiprojection algorithm using Bregman projections in a product space
- Hard-constrained inconsistent signal feasibility problems
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iterative oblique projection onto convex sets and the split feasibility problem
- Fixed points of nonexpanding maps
- Approximation of fixed points of nonexpansive mappings
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- The relaxed CQ algorithm solving the split feasibility problem
- Iterative Algorithm for Triple-Hierarchical Constrained Nonconvex Optimization Problem and Its Application to Network Bandwidth Allocation
- Fixed Point Optimization Algorithms for Distributed Optimization in Networked Systems
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Iterative approximation of fixed points
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- 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)