Prox-regularity of rank constraint sets and implications for algorithms

DOI10.1007/s10851-012-0406-3zbMath1311.90142arXiv1112.0526OpenAlexW3098387023WikidataQ59302774 ScholiaQ59302774MaRDI QIDQ2251196

D. Russell Luke

Publication date: 11 July 2014

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.0526

zbMATH Keywords

normal conelinear convergenceconstraint qualificationsparsityprojection operatormethod of alternating projectionsrank constraintsuperregularityprox-regularrank optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (14)

Regularity properties of non-negative sparsity sets ⋮ An augmented Lagrangian method for optimization problems with structured geometric constraints ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Low-rank nonnegative tensor approximation via alternating projections and sketching ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ Optimality conditions for Tucker low-rank tensor optimization ⋮ Calmness of partial perturbation to composite rank constraint systems and its applications ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs ⋮ About \([q\)-regularity properties of collections of sets] ⋮ A Hybrid Penalty Method for a Class of Optimization Problems with Multiple Rank Constraints ⋮ Quantitative characterizations of regularity properties of collections of sets ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers ⋮ Optimality conditions for rank-constrained matrix optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted normal cones and the method of alternating projections: applications
• Restricted normal cones and sparsity optimization with affine constraints
• Local linear convergence of approximate projections onto regularized sets
• Local linear convergence for alternating and averaged nonconvex projections
• Method of successive projections for finding a common point of sets in metric spaces
• Generalized subdifferentials of the rank function
• When only global optimization matters
• Nonsmooth analysis of singular values. I: Theory
• Nonsmooth analysis of singular values. II: Applications
• A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• Curvature Measures
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Matrix Analysis
• Variational Analysis
• Local differentiability of distance functions
• Alternating Projections on Manifolds
• ON MATRICES DEPENDING ON PARAMETERS

This page was built for publication: Prox-regularity of rank constraint sets and implications for algorithms