Convex optimization problem class

Problems with convex objective and convex feasible set (lp, qp, lasso, logistic regression with convex regularizers).

algorithmic task

MaRDI QIDQ6825583FDOCommunityMathAlgoDB

Specializations

logistic regression training problem (convex classification loss with optional regularization), support vector machine (svm) training problem (max-margin classification; dual is a convex qp), linear programming (lp) problems with linear objective and linear constraints, lasso regression problem (least-squares with l1 regularization for sparsity promotion)

Further links

Item	Property
continuous optimization problems including unconstrained/constrained smooth and non-smooth cases	specialized by

---

---

Edit convex optimization problem class item

This page was built for task: convex optimization problem class