Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications

DOI10.1016/J.CAM.2022.114872MaRDI QIDQ2104053zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 9 December 2022

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

convergence analysisnumerical experimentstationary pointdouble-sparsitygradient projection Newtonsparse collaborative learning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• A greedy Newton-type method for multiple sparse constraint problem
• Learning sparse gradients for variable selection and dimension reduction
• Sparse learning for large-scale and high-dimensional data: a randomized convex-concave optimization approach
• A proximal point dual Newton algorithm for solving group graphical Lasso problems
• Convex multi-task feature learning

Cites work

• scientific article; zbMATH DE number 7370529 (Why is no real title available?)
• A Markov model for switching regressions
• A convergent iterative hard thresholding for nonnegative sparsity optimization
• A simple proof of the restricted isometry property for random matrices
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
• Cascaded Collaborative Regression for Robust Facial Landmark Detection Trained Using a Mixture of Synthetic and Real Images With Dynamic Weighting
• Computing a Trust Region Step
• Decoding by Linear Programming
• Fast global convergence of gradient methods for high-dimensional statistical recovery
• Gradient projection Newton pursuit for sparsity constrained optimization
• Greedy sparsity-constrained optimization
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• On solutions of sparsity constrained optimization
• Primal-dual subgradient methods for convex problems
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Sparsity constrained nonlinear optimization: optimality conditions and algorithms
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Trading accuracy for sparsity in optimization problems with sparsity constraints
• Variable selection for support vector machines in moderately high dimensions
• Variational Analysis

Cited in

(3)

• Gradient Projection Newton Algorithm for Sparse Collaborative Learning Using Synthetic and Real Datasets of Applications
• A subspace derivative-free projection method for convex constrained nonlinear equations
• A greedy Newton-type method for multiple sparse constraint problem

Describes a project that uses

Uses Software

• GQTPAR

This page was built for publication: Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104053)