Pages that link to "Item:Q2897274"
From MaRDI portal
The following pages link to A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems (Q2897274):
Displaying 11 items.
- Exact minimum rank approximation via Schatten \(p\)-norm minimization (Q396052) (← links)
- Restricted normal cones and sparsity optimization with affine constraints (Q404252) (← links)
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems (Q1630271) (← links)
- Prox-regularity of rank constraint sets and implications for algorithms (Q2251196) (← links)
- Matrix recipes for hard thresholding methods (Q2251217) (← links)
- On linear convergence of projected gradient method for a class of affine rank minimization problems (Q2358309) (← links)
- A linearized finite-difference method for the solution of some mixed concave and convex non-linear problems (Q2479164) (← links)
- (Q3734176) (← links)
- On the complexity of solving feasibility problems with regularized models (Q5038424) (← links)
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates (Q5242933) (← links)
- Global convergence and acceleration of projection methods for feasibility problems involving union convex sets (Q6667563) (← links)
