On the proximal Landweber Newton method for a class of nonsmooth convex problems

DOI10.1007/S10589-014-9703-7MaRDI QIDQ2340491zbMATH OpenOpenAlexFDO

Authors Hai-Bin Zhang, Jiao-Jiao Jiang, Yun-Bin Zhao

Publication date 20 April 2015

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10589-014-9703-7

zbMATH Keywords

Newton's methodnonsmooth convex optimizationprojected Landweber methodproximal splitting methodsparse group LASSO

Mathematics Subject Classification ID

Convex programming (90C25) Methods of quasi-Newton type (90C53)

Recommendations

• On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
• scientific article; zbMATH DE number 7404502
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
• A globally convergent proximal Newton-type method in nonsmooth convex optimization
• Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems

Cites work

• Accelerated and inexact forward-backward algorithms
• Efficient block-coordinate descent algorithms for the group Lasso
• scientific article; zbMATH DE number 781821 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• Model Selection and Estimation in Regression with Grouped Variables
• On proximal gradient method for the convex problems regularized with the group reproducing kernel norm
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• Signal Recovery by Proximal Forward-Backward Splitting
• Sparse group Lasso and high dimensional multinomial classification
• The application of an oblique-projected Landweber method to a model of supervised learning

Cited in

(5)

• A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
• A fixed-point proximity approach to solving the support vector regression with the group Lasso regularization
• Proximal gradient method with automatic selection of the parameter by automatic differentiation
• Landweber-type method with uniformly convex constraints under conditional stability assumptions

Describes a project that uses

Uses Software

• MNIST
• COIL-20
• SLEP
• msgl

This page was built for publication: On the proximal Landweber Newton method for a class of nonsmooth convex problems

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