Linear convergence of CQ algorithms and applications in gene regulatory network inference
From MaRDI portal
Publication:5268484
DOI10.1088/1361-6420/aa6699zbMath1368.65080OpenAlexW2595512563MaRDI QIDQ5268484
Chong Li, Yao-Hua Hu, Jen-Chih Yao, Jin-Hua Wang
Publication date: 20 June 2017
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1361-6420/aa6699
Convex programming (90C25) Biochemistry, molecular biology (92C40) Numerical solutions to equations with nonlinear operators (65J15) Systems biology, networks (92C42)
Related Items
Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ Convergence analysis of new inertial method for the split common null point problem ⋮ An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem ⋮ Linear approximation method for solving split inverse problems and its applications ⋮ Iterative positive thresholding algorithm for non-negative sparse optimization ⋮ A new method for solving split equality problems via projection dynamical systems ⋮ Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ A dynamical system method for solving the split convex feasibility problem ⋮ The equivalence of three types of error bounds for weakly and approximately convex functions ⋮ Two inertial-type algorithms for solving the split feasibility problem ⋮ Self-adaptive algorithms for solving split feasibility problem with multiple output sets ⋮ Inertial accelerated algorithms for solving split feasibility with multiple output sets in Hilbert spaces ⋮ Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces ⋮ A dynamic simultaneous algorithm for solving split equality fixed point problems ⋮ A novel projection method for split feasibility problems with applications to compressive sensing ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems ⋮ General splitting methods with linearization for the split feasibility problem ⋮ Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems ⋮ A family of projection gradient methods for solving the multiple-sets split feasibility problem ⋮ Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators ⋮ A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem ⋮ Abstract convergence theorem for quasi-convex optimization problems with applications ⋮ Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ Convergence rates of subgradient methods for quasi-convex optimization problems ⋮ Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets
Uses Software
