Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
From MaRDI portal
Publication:6158000
DOI10.1137/21m1434507zbMath1517.49007arXiv2107.07107OpenAlexW4380077255MaRDI QIDQ6158000
Anthony Man-Cho So, Peng Wang, Huikang Liu
Publication date: 22 June 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.07107
Nonlinear programming (90C30) Nonsmooth analysis (49J52) Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20) Real-valued functions on manifolds (58C05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- L1-norm projection pursuit principal component analysis
- Asymptotic properties of the Fenchel dual functional and applications to decomposition problems
- From error bounds to the complexity of first-order descent methods for convex functions
- A unified approach to error bounds for structured convex optimization problems
- A proximal difference-of-convex algorithm with extrapolation
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- A block coordinate variable metric linesearch based proximal gradient method
- Principal component analysis.
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Two proposals for robust PCA using semidefinite programming
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- A generalized solution of the orthogonal Procrustes problem
- A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
- Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality
- Principal component analysis: a review and recent developments
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems
- Robust Estimation of Dispersion Matrices and Principal Components
- Variational Analysis
- Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing
- On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization
- Efficient L1-Norm Principal-Component Analysis via Bit Flipping
- L1-Norm Principal-Component Analysis of Complex Data
- Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano
- LDA via L1-PCA of Whitened Data
- Fast, robust and non-convex subspace recovery
- Robust Statistics
- Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
This page was built for publication: Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis
