Optimization for Inconsistent Split Feasibility Problems
From MaRDI portal
Publication:2805985
DOI10.1080/01630563.2015.1080270zbMath1339.49031OpenAlexW2268867923MaRDI QIDQ2805985
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
convex optimizationfixed pointnonexpansive mappinginverse problemsthree-term conjugate gradient methodinconsistent split feasibility problems
Convex programming (90C25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Inverse problems in optimal control (49N45)
Related Items (1)
Cites Work
- 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
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Iterative approximation of fixed points
- Approximation of fixed points of nonexpansive mappings
- A multiprojection algorithm using Bregman projections in a product space
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Hard-constrained inconsistent signal feasibility problems
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- Computational Method for Solving a Stochastic Linear-Quadratic Control Problem Given an Unsolvable Stochastic Algebraic Riccati Equation
- The multiple-sets split feasibility problem and its applications for inverse problems
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Iterative oblique projection onto convex sets and the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- 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
- A block-iterative surrogate constraint splitting method for quadratic signal recovery
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- Fixed points of nonexpanding maps
This page was built for publication: Optimization for Inconsistent Split Feasibility Problems