The application of an oblique-projected Landweber method to a model of supervised learning

DOI10.1016/J.MCM.2005.12.010MaRDI QIDQ2473156zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 26 February 2008

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mcm.2005.12.010

zbMATH Keywords

channel representationnonnegative constraintpreconditionerprojected Landwebersupervised learning

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Machine vision and scene understanding (68T45) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Approximation methods for supervised learning
• Some approaches to the solution of optimization problems in supervised learning
• Supervised learning via Euler's elastica models
• A Data-Driven Iteratively Regularized Landweber Iteration
• Supervised learning via the “hubNet” procedure
• Classification and Regression Using an Outer Approximation Projection-Gradient Method
• Advances in Neural Networks – ISNN 2005
• Gradient projection methods for quadratic programs and applications in training support vector machines

Cites work

• Enumeration of Seven-Argument Threshold Functions
• Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
• Fuzzy systems as universal approximators
• scientific article; zbMATH DE number 1667417 (Why is no real title available?)
• scientific article; zbMATH DE number 1670683 (Why is no real title available?)
• scientific article; zbMATH DE number 3760340 (Why is no real title available?)
• scientific article; zbMATH DE number 1206370 (Why is no real title available?)
• scientific article; zbMATH DE number 1382772 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• scientific article; zbMATH DE number 1392848 (Why is no real title available?)
• Interior Methods for Nonlinear Optimization
• Iteration methods for convexly constrained ill-posed problems in hilbert space
• Numerical Optimization
• Projected Landweber method and preconditioning
• Projection methods for variational inequalities with application to the traffic assignment problem

Cited in

(5)

• On the proximal Landweber Newton method for a class of nonsmooth convex problems
• Proximal splitting methods in signal processing
• Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators
• Complexity reduction for sign configurations through the KP II equation and its information-theoretic aspects
• Convergence results for stochastic convex feasibility problem using random Mann and simultaneous projection iterative algorithms in Hilbert space

This page was built for publication: The application of an oblique-projected Landweber method to a model of supervised learning

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