Pages that link to "Item:Q5268484"
From MaRDI portal
The following pages link to Linear convergence of CQ algorithms and applications in gene regulatory network inference (Q5268484):
Displaying 26 items.
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems (Q1630420) (← links)
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
- General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
- Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems (Q2022292) (← links)
- A new gradient projection algorithm for convex minimization problem and its application to split feasibility problem (Q2054671) (← links)
- Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces (Q2067802) (← links)
- Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
- The strong convergence of Douglas-Rachford methods for the split feasibility problem (Q2080607) (← links)
- Self adaptive inertial relaxed \(CQ\) algorithms for solving split feasibility problem with multiple output sets (Q2083349) (← links)
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
- An extended inertial Halpern-type ball-relaxed \(CQ\) algorithm for multiple-sets split feasibility problem (Q2150319) (← links)
- Linear approximation method for solving split inverse problems and its applications (Q2154707) (← links)
- Global and linear convergence of alternated inertial methods for split feasibility problems (Q2222846) (← links)
- A family of projection gradient methods for solving the multiple-sets split feasibility problem (Q2275325) (← links)
- A new method for solving split equality problems via projection dynamical systems (Q2661687) (← links)
- A dynamical system method for solving the split convex feasibility problem (Q2666702) (← links)
- The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
- Self-adaptive algorithms for solving split feasibility problem with multiple output sets (Q2679829) (← links)
- Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
- Inertial accelerated algorithms for solving split feasibility with multiple output sets in Hilbert spaces (Q6106135) (← links)
- Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces (Q6140912) (← links)
- A novel projection method for split feasibility problems with applications to compressive sensing (Q6159820) (← links)
- A successive centralized circumcentered-reflection method for the convex feasibility problem (Q6179873) (← links)
- An inertial accelerated outer quadratic approximation method for split feasibility problem with application to elastic net (Q6192345) (← links)
- A new fixed-time stability of neural network to solve split convex feasibility problems (Q6498621) (← links)