Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
From MaRDI portal
Abstract: The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array of useful applications in engineering, machine learning and statistics, and the design of algorithms for this problem has attracted intensive research activities. We introduce an algorithmic framework, called ConGradU, that unifies a variety of seemingly different algorithms that have been derived from disparate approaches, and allows for deriving new schemes. Building on the old and well-known conditional gradient algorithm, ConGradU is a simplified version with unit step size and yields a generic algorithm which either is given by an analytic formula or requires a very low computational complexity. Mathematical properties are systematically developed and numerical experiments are given.
Recommendations
- Generalized conditional gradient for sparse estimation
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- A Singular Value Thresholding Algorithm for Matrix Completion
- Greedy sparsity-constrained optimization
- Low-rank approximations with sparse factors. I: Basic algorithms and error analysis
Cited in
(60)- An inexact Newton-like conditional gradient method for constrained nonlinear systems
- Sparse exploratory factor analysis
- Conditional gradient type methods for composite nonlinear and stochastic optimization
- Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
- On finding a generalized lowest rank solution to a linear semi-definite feasibility problem
- Rank-one approximation of positive matrices based on methods of tropical mathematics
- On the robust PCA and Weiszfeld's algorithm
- Projections onto the intersection of a one-norm ball or sphere and a two-norm ball or sphere
- Conditional gradient method for multiobjective optimization
- Alternating conditional gradient method for convex feasibility problems
- Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes
- Best sparse rank-1 approximation to higher-order tensors via a truncated exponential induced regularizer
- Several approximation algorithms for sparse best rank-1 approximation to higher-order tensors
- On the rotational invariant \(L_1\)-norm PCA
- Two relaxation methods for rank minimization problems
- Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method
- On the rank-one approximation of positive matrices using tropical optimization methods
- Certifiably optimal sparse principal component analysis
- On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
- Conditional gradient sliding for convex optimization
- Nonconvex phase synchronization
- The sparse principal component analysis problem: optimality conditions and algorithms
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Globally solving the trust region subproblem using simple first-order methods
- Alternating direction method of multipliers for sparse principal component analysis
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- On the estimation performance and convergence rate of the generalized power method for phase synchronization
- Generalized conditional gradient for sparse estimation
- Near-optimal bounds for phase synchronization
- Low-Rank Approximations with Sparse Factors II: Penalized Methods with Discrete Newton-Like Iterations
- Dual randomized coordinate descent method for solving a class of nonconvex problems
- First-order algorithms for a class of fractional optimization problems
- On the Frank-Wolfe algorithm for non-compact constrained optimization problems
- Stochastic proximal gradient method FOR _1 regularized optimization over a sphere
- An inexact first-order method for constrained nonlinear optimization
- Projection-free accelerated method for convex optimization
- scientific article; zbMATH DE number 7625166 (Why is no real title available?)
- An Algorithm for Maximizing a Convex Function Based on Its Minimum
- Inexact primal-dual gradient projection methods for nonlinear optimization on convex set
- Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
- A penalty decomposition algorithm with greedy improvement for mean‐reverting portfolios with sparsity and volatility constraints
- A unified approach to synchronization problems over subgroups of the orthogonal group
- Practical approximation algorithms for _1-regularized sparse rank-1 approximation to higher-order tensors
- Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- PCA Sparsified
- A Path-Based Approach to Constrained Sparse Optimization
- Cardinality minimization, constraints, and regularization: a survey
- Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
- T-product based _1-norm tensor principal component analysis and a finite-step convergence algorithm
- Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints
- Broyden quasi-Newton secant-type method for solving constrained mixed generalized equations
- _1-norm simultaneous approximate diagonalization and a proximal alternating maximization method
- Sparse PCA: a new scalable estimator based on integer programming
- A Newton conditional gradient method for constrained nonlinear systems
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems
This page was built for publication: Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4912757)
