Alternating Projections on Manifolds
From MaRDI portal
Publication:5388078
DOI10.1287/moor.1070.0291zbMath1163.65040WikidataQ56907669 ScholiaQ56907669MaRDI QIDQ5388078
Jérôme Malick, Adrian S. Lewis
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1070.0291
linear convergence; spectral set; nonconvex; metric regularity; alternating projections; low-rank approximation; subspace angle
Related Items
Projecting onto the Intersection of a Cone and a Sphere, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, Non-convex clustering via proximal alternating linearized minimization method, Generating random quantum channels, Unnamed Item, The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates, Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices, An alternating minimization algorithm for Factor Analysis, Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings, A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems, The Extrinsic Geometry of Dynamical Systems Tracking Nonlinear Matrix Projections, Approximating functions on stratified sets, On local convergence of the method of alternating projections, A quadratically convergent algorithm for structured low-rank approximation, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, Regularity properties of non-negative sparsity sets, A variational approach of the rank function, Restricted normal cones and the method of alternating projections: applications, Restricted normal cones and the method of alternating projections: theory, Alternating projections on nontangential manifolds, Restricted normal cones and sparsity optimization with affine constraints, A fresh variational-analysis look at the positive semidefinite matrices world, Projection methods for quantum channel construction, Numerical methods for solving some matrix feasibility problems, Finding a low-rank basis in a matrix subspace, Alternating projections in CAT(0) spaces, Strong semismoothness of projection onto slices of second-order cone, About subtransversality of collections of sets, A new projection method for finding the closest point in the intersection of convex sets, A convergent relaxation of the Douglas-Rachford algorithm, Local linear convergence for alternating and averaged nonconvex projections, Transversality and alternating projections for nonconvex sets, A proximal iterative approach to a non-convex optimization problem, Local convergence of the heavy-ball method and iPiano for non-convex optimization, About intrinsic transversality of pairs of sets, Approximating the minimum rank of a graph via alternating projection, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, Stochastic approximation on Riemannian manifolds, The distance between convex sets with Minkowski sum structure: application to collision detection, A factorization method for completely positive matrices, Some new characterizations of intrinsic transversality in Hilbert spaces, tSSNALM: a fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA, Prox-regularity of rank constraint sets and implications for algorithms, Necessary conditions for linear convergence of iterated expansive, set-valued mappings, On characterizations of submanifolds via smoothness of the distance function in Hilbert spaces, Local linear convergence of a primal-dual algorithm for the augmented convex models, Set regularities and feasibility problems, First-order methods almost always avoid strict saddle points, Robust principal component pursuit via inexact alternating minimization on matrix manifolds, Duality and Convex Programming, Stochastic First-Order Methods with Random Constraint Projection, Low Complexity Regularization of Linear Inverse Problems, Projection Methods in Conic Optimization, On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, REGULARITY PROPERTIES IN VARIATIONAL ANALYSIS AND APPLICATIONS IN OPTIMISATION, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, Geometric Methods on Low-Rank Matrix and Tensor Manifolds, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
Uses Software
