A dynamical system method for solving the split convex feasibility problem

DOI10.3934/jimo.2020104zbMath1476.65106OpenAlexW3035332871MaRDI QIDQ2666702

Rong Hu, Ming Zhu, Zengzhen Tan, Ya-Ping Fang

Publication date: 23 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020104

zbMATH Keywords

dynamical system\(CQ\)-algorithmsplit convex feasibility problemstability and convergence rate

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solution of inverse problems involving ordinary differential equations (65L09)

Related Items

Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
• A dynamical system associated with the fixed points set of a nonexpansive operator
• Algorithms for the split variational inequality problem
• A multiprojection algorithm using Bregman projections in a product space
• On the stability of globally projected dynamical systems
• On the global exponential stability of a projected dynamical system for strongly pseudomonotone variational inequalities
• A Gauss-Newton method for convex composite optimization
• On descent-projection method for solving the split feasibility problems
• A primal-dual dynamical approach to structured convex minimization problems
• Analysis on Newton projection method for the split feasibility problem
• Fast self-adaptive regularization iterative algorithm for solving split feasibility problem
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• Double projection algorithms for solving the split feasibility problems
• Application of projection neural network in solving convex programming problems
• Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications
• The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
• The Convergence Problem for Dissipative Autonomous Systems
• A Continuous Dynamical Newton-Like Approach to Solving Monotone Inclusions
• Dynamical systems and forward–backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator
• Implicit Functions and Solution Mappings
• An Application of Error Bounds for Convex Programming in a Linear Space
• Barrier Operators and Associated Gradient-Like Dynamical Systems for Constrained Minimization Problems
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization
• On Projection Algorithms for Solving Convex Feasibility Problems
• Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• A projection neural network and its application to constrained optimization problems
• A note on the CQ algorithm for the split feasibility problem
• An Iteration Formula for Fredholm Integral Equations of the First Kind
• Convex analysis and monotone operator theory in Hilbert spaces
• Mathematical control theory: an introduction