A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection

DOI10.1007/s10898-020-00899-8zbMath1450.90031arXiv1903.01101OpenAlexW3010956760MaRDI QIDQ2200085

Liaoyuan Zeng, Ting Kei Pong, Chen Chen, Lu-Lin Tan

Publication date: 15 September 2020

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

matrix factorizationssplit feasibility problemsdifference-of-convex optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Variable smoothing for convex optimization problems using stochastic gradients

Cites Work

• Unnamed Item
• An MM Algorithm for Split Feasibility Problems
• On the computational complexity of membership problems for the completely positive cone and its dual
• The structure of completely positive matrices according to their CP-rank and CP-plus-rank
• The relaxed inexact projection methods for the split feasibility problem
• Local linear convergence for alternating and averaged nonconvex projections
• Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• A multiprojection algorithm using Bregman projections in a product space
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• A factorization method for completely positive matrices
• A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems
• Projection-like Retractions on Matrix Manifolds
• Solving the split feasibility problem without prior knowledge of matrix norms
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• The multiple-sets split feasibility problem and its applications for inverse problems
• Open problems in the theory of completely positive and copositive matrices
• Variational Analysis
• Local differentiability of distance functions
• Iterative oblique projection onto convex sets and the split feasibility problem
• Strong convergence result for proximal split feasibility problem in Hilbert spaces
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The relaxed CQ algorithm solving the split feasibility problem
• Sparse Approximation via Penalty Decomposition Methods
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• Shorter Notes: Differentiability of the Metric Projection in Finite- Dimensional Euclidean Space
• A note on the CQ algorithm for the split feasibility problem
• Several solution methods for the split feasibility problem