An inexact alternating projection method with application to matrix completion
From MaRDI portal
Cites work
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Alternating conditional gradient method for convex feasibility problems
- Alternating projection methods.
- Alternating Projections on Manifolds
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Convergence of the block Lanczos method for eigenvalue clusters
- Exact matrix completion via convex optimization
- Fast Cadzow's algorithm and a gradient variant
- Functional Operators (AM-22), Volume 2
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 1009689 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Inexact spectral projected gradient methods on convex sets
- Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
- Kurdyka-Łojasiewicz exponent via inf-projection
- Local linear convergence for alternating and averaged nonconvex projections
- Local linear convergence for inexact alternating projections on nonconvex sets
- Low-Rank Matrix Approximation Using the Lanczos Bidiagonalization Process with Applications
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- New convergence results for the inexact variable metric forward-backward method
- Numerical methods for large eigenvalue problems
- On cluster points of alternating projections
- On local convergence of the method of alternating projections
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On the inexact scaled gradient projection method
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Prox-regularity of rank constraint sets and implications for algorithms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Regularity of collections of sets and convergence of inexact alternating projections
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- The power of bidiagonal matrices
- Transversality and alternating projections for nonconvex sets
- Variational Analysis
This page was built for publication: An inexact alternating projection method with application to matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346793)
