Alternating Projections on Manifolds
From MaRDI portal
Publication:5388078
DOI10.1287/moor.1070.0291zbMath1163.65040OpenAlexW2079361630WikidataQ56907669 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 convergencespectral setnonconvexmetric regularityalternating projectionslow-rank approximationsubspace angle
Related Items
On local convergence of the method of alternating projections, A quadratically convergent algorithm for structured low-rank approximation, Local linear convergence for alternating and averaged nonconvex projections, Local convergence of the heavy-ball method and iPiano for non-convex optimization, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds, Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems, Regularity properties of non-negative sparsity sets, Adaptive integration of nonlinear evolution equations on tensor manifolds, A variational approach of the rank function, Local linear convergence of a primal-dual algorithm for the augmented convex models, Restricted normal cones and the method of alternating projections: applications, Restricted normal cones and the method of alternating projections: theory, A factorization method for completely positive matrices, Some new characterizations of intrinsic transversality in Hilbert spaces, Projecting onto the Intersection of a Cone and a Sphere, Alternating projections on nontangential manifolds, Set regularities and feasibility problems, Fenchel conjugate via Busemann function on Hadamard manifolds, Restricted normal cones and sparsity optimization with affine constraints, Nonnegative low rank tensor approximations with multidimensional image applications, tSSNALM: a fast two-stage semi-smooth Newton augmented Lagrangian method for sparse CCA, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, Transversality and alternating projections for nonconvex sets, Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds, First-order methods almost always avoid strict saddle points, Construction of quantum states with special properties by projection methods, Low-rank nonnegative tensor approximation via alternating projections and sketching, On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds, Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods, On a numerical construction of doubly stochastic matrices with prescribed eigenvalues, Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry, Effective surface energies in nematic liquid crystals as homogenized rugosity effects, Provable Phase Retrieval with Mirror Descent, Exact convergence rates of alternating projections for nontransversal intersections, A Chain Rule for Strict Twice Epi-Differentiability and Its Applications, Randomized low rank approximation for nonnegative pure quaternion matrices, CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion, The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates, A fresh variational-analysis look at the positive semidefinite matrices world, Alternating projections in CAT(0) spaces, Strong semismoothness of projection onto slices of second-order cone, Gradient projection methods for the $n$-coupling problem, Non-convex clustering via proximal alternating linearized minimization method, Geometric Methods on Low-Rank Matrix and Tensor Manifolds, Optimal rank-1 Hankel approximation of matrices: Frobenius norm and spectral norm and Cadzow's algorithm, Projection methods for quantum channel construction, Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices, About intrinsic transversality of pairs of sets, Numerical methods for solving some matrix feasibility problems, About subtransversality of collections of sets, A new projection method for finding the closest point in the intersection of convex sets, Finding a low-rank basis in a matrix subspace, Prox-regularity of rank constraint sets and implications for algorithms, Stochastic approximation on Riemannian manifolds, The distance between convex sets with Minkowski sum structure: application to collision detection, Duality and Convex Programming, A convergent relaxation of the Douglas-Rachford algorithm, Approximating the minimum rank of a graph via alternating projection, Unnamed Item, Stochastic First-Order Methods with Random Constraint Projection, Low Complexity Regularization of Linear Inverse Problems, Projection Methods in Conic Optimization, Robust principal component pursuit via inexact alternating minimization on matrix manifolds, On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, Necessary conditions for linear convergence of iterated expansive, set-valued mappings, REGULARITY PROPERTIES IN VARIATIONAL ANALYSIS AND APPLICATIONS IN OPTIMISATION, 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, On characterizations of submanifolds via smoothness of the distance function in Hilbert spaces, The Extrinsic Geometry of Dynamical Systems Tracking Nonlinear Matrix Projections, Alternating projections with applications to Gerchberg-Saxton error reduction, Approximating functions on stratified sets, Generating random quantum channels, A proximal iterative approach to a non-convex optimization problem
Uses Software
