Continuous optimization problems including unconstrained/constrained smooth and non-smooth cases

Covers unconstrained minimization, equality/inequality constrained NLP, and composite convex problems.

algorithmic task

MaRDI QIDQ6825901FDOCommunityMathAlgoDB

Specialization(s)

nonlinear least-squares (nlls) problems minimizing the sum of squared residuals, linear programming (lp) problems with linear objective and linear constraints, logistic regression training problem (convex classification loss with optional regularization), nonconvex optimization problem class, lasso regression problem (least-squares with l1 regularization for sparsity promotion), quadratic programming (qp) problems with quadratic objective and linear constraints (convex or indefinite), support vector machine (svm) training problem (max-margin classification; dual is a convex qp), convex optimization problem class

Further link(s)

Item	Property
optimization problems umbrella class collecting continuous, discrete, convex, and nonconvex families	specialized by

---

---

Edit continuous optimization problems including unconstrained/constrained smooth and non-smooth cases item

This page was built for task: continuous optimization problems including unconstrained/constrained smooth and non-smooth cases