Optimization problems in statistical learning: duality and optimality conditions
From MaRDI portal
Publication:545113
DOI10.1016/j.ejor.2011.03.021zbMath1222.90079OpenAlexW2064488177MaRDI QIDQ545113
Publication date: 22 June 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.03.021
Related Items
Synergies between operations research and data mining: the emerging use of multi-objective approaches, Fitting piecewise linear continuous functions, Employing different loss functions for the classification of images via supervised learning, Cost-sensitive feature selection for support vector machines, Regression tasks in machine learning via Fenchel duality, Fuzzy production inventory model for deteriorating items with shortages under the effect of time dependent learning and forgetting: a possibility/necessity approach, Optimization problems for machine learning: a survey, A variable smoothing algorithm for solving convex optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Regularization networks and support vector machines
- New constraint qualification and conjugate duality for composed convex optimization problems
- From Hahn--Banach to monotonicity
- Optimization and nonsmooth analysis
- Training a Support Vector Machine in the Primal
- Theory of Reproducing Kernels