Lagrangian support vector regression via unconstrained convex minimization

DOI10.1016/j.neunet.2013.12.003zbMath1298.68214OpenAlexW2015874150WikidataQ46052171 ScholiaQ46052171MaRDI QIDQ470224

Deepak Gupta, Kapil, S. Balasundaram

Publication date: 12 November 2014

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2013.12.003

zbMATH Keywords

support vector regressiongeneralized derivative approachsmooth approximationunconstrained convex minimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Robust support vector quantile regression with truncated pinball loss (RSVQR) ⋮ A novel perspective on multiclass classification: regular simplex support vector machine ⋮ Maximum likelihood optimal and robust support vector regression with \textit{lncosh} loss function

Uses Software

• UCI-ml
• SSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• TSVR: an efficient twin support vector machine for regression
• A feature selection Newton method for support vector machine classification
• Nonlinear black-box modeling in system identification: A unified overview
• Multitask multiclass support vector machines: model and experiments
• 10.1162/15324430152748218
• SSVM: A smooth support vector machine for classification
• Gene selection for cancer classification using support vector machines