Projection algorithms for nonconvex minimization with application to sparse principal component analysis
From MaRDI portal
Publication:312468
DOI10.1007/s10898-016-0402-zzbMath1353.90118arXiv1404.4132OpenAlexW2299651280MaRDI QIDQ312468
William W. Hager, Dzung T. Phan, Jiajie Zhu
Publication date: 15 September 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.4132
nonconvex minimizationBarzilai-Borwein methodgradient projectionsparse principal component analysisapproximate Newton
Related Items
Derivatives of probability functions: unions of polyhedra and elliptical distributions, A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems, Unnamed Item, On the robust PCA and Weiszfeld's algorithm, On the Solution of ℓ0-Constrained Sparse Inverse Covariance Estimation Problems, An active-set proximal quasi-Newton algorithm for ℓ1-regularized minimization over a sphere constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- Convex approximations to sparse PCA via Lagrangian duality
- Simultaneous pursuit of out-of-sample performance and sparsity in index tracking portfolios
- Approximation of dense-\(n/2\)-subgraph and the complement of min-bisection
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Least angle regression. (With discussion)
- Detecting high log-densities
- Generalized power method for sparse principal component analysis
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- A New Active Set Algorithm for Box Constrained Optimization
- Probing the Pareto Frontier for Basis Pursuit Solutions
- On Finding Dense Subgraphs
- Two-Point Step Size Gradient Methods
- Atomic Decomposition by Basis Pursuit
- Sparse Reconstruction by Separable Approximation
- A Nonmonotone Line Search Technique for Newton’s Method
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- Convex Analysis
- Compressed sensing
