Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with quadratic-programming
Search options questions only
not deleted
user 120299
A quadratic program (QP) is an optimization problem in which the objective function is quadratic and the feasible region is a convex polytope.
3
votes
0
answers
244
views
Solve Huber's M-Estimation using quadratic programming
The Huber's M-estimate is to solve the problem
$$\underset{\mathbf x}{\rm{minimize}} \rho(\mathbf b-\mathbf A\mathbf x) + \alpha|\mathbf x|$$
where
$$ \rho(t) = \left\{\begin{array}{c}\frac{t^2}{2\ga …
- 149