Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
From MaRDI portal
Publication:4912757
DOI10.1137/110839072zbMath1263.90094arXiv1107.1163OpenAlexW2012769612MaRDI QIDQ4912757
Publication date: 5 April 2013
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1163
Factor analysis and principal components; correspondence analysis (62H25) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
On the Frank–Wolfe algorithm for non-compact constrained optimization problems, An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems, An inexact first-order method for constrained nonlinear optimization, Projection-free accelerated method for convex optimization, Alternating maximization: unifying framework for 8 sparse PCA formulations and efficient parallel codes, The sparse principal component analysis problem: optimality conditions and algorithms, Projection algorithms for nonconvex minimization with application to sparse principal component analysis, An Algorithm for Maximizing a Convex Function Based on Its Minimum, An inexact Newton-like conditional gradient method for constrained nonlinear systems, 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, Globally Solving the Trust Region Subproblem Using Simple First-Order Methods, On the rotational invariant \(L_1\)-norm PCA, First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems, Sparse exploratory factor analysis, Proximal alternating linearized minimization for nonconvex and nonsmooth problems, 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 \(\ell_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, Two relaxation methods for rank minimization problems, On the Estimation Performance and Convergence Rate of the Generalized Power Method for Phase Synchronization, A Path-Based Approach to Constrained Sparse Optimization, Alternating direction method of multipliers for sparse principal component analysis, Conditional gradient type methods for composite nonlinear and stochastic optimization, Unnamed Item, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, Near-Optimal Bounds for Phase Synchronization, Inexact primal–dual gradient projection methods for nonlinear optimization on convex set, Unnamed Item, Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints, Solving \(\ell_0\)-penalized problems with simple constraints via the Frank-Wolfe reduced dimension method, 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, On finding a generalized lowest rank solution to a linear semi-definite feasibility problem, Conditional gradient method for multiobjective optimization, Rank-one approximation of positive matrices based on methods of tropical mathematics, A Newton conditional gradient method for constrained nonlinear systems, On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms, On the rank-one approximation of positive matrices using tropical optimization methods, Certifiably optimal sparse principal component analysis, Alternating conditional gradient method for convex feasibility problems, Conditional Gradient Sliding for Convex Optimization, Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence, Nonconvex Phase Synchronization, Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems, An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint, First-Order Algorithms for a Class of Fractional Optimization Problems
