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

DOI10.1016/j.cam.2022.114872OpenAlexW4307818651WikidataQ117042351 ScholiaQ117042351MaRDI QIDQ2104053

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)

Related Items (1)

A greedy Newton-type method for multiple sparse constraint problem

Uses Software

• GQTPAR

Cites Work

• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• On solutions of sparsity constrained optimization
• Fast global convergence of gradient methods for high-dimensional statistical recovery
• A simple proof of the restricted isometry property for random matrices
• A Markov model for switching regressions
• An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets
• Gradient projection Newton pursuit for sparsity constrained optimization
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
• Mixture Densities, Maximum Likelihood and the EM Algorithm
• Computing a Trust Region Step
• Decoding by Linear Programming
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Variational Analysis
• Cascaded Collaborative Regression for Robust Facial Landmark Detection Trained Using a Mixture of Synthetic and Real Images With Dynamic Weighting
• Subspace Pursuit for Compressive Sensing Signal Reconstruction
• Greedy Sparsity-Constrained Optimization
• Variable Selection for Support Vector Machines in Moderately High Dimensions

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