Name
Abstract | ||
|---|---|---|
A decomposition method for solving large-scale box constrained optimization is proposed. The algorithm is motivated by the successful use of the decomposition method presented by Joachims for training support vector machines. In particular, a new technique, based on the new definition ''KKT-violating index'', is introduced for working set identification. Finally, the numerical experiments and implementation details show that this method is practical for large-scale problems. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.amc.2013.12.169 | Applied Mathematics and Computation |
Keywords | Field | DocType |
numerical experiment,large-scale problem,kkt-violating index,decomposition method,successful use,large-scale box,implementation detail,training support vector machine,new definition,new technique | Mathematical optimization,Working set,Support vector machine,Algorithm,Decomposition method (constraint satisfaction),Mathematics,Constrained optimization | Journal |
Volume | ISSN | Citations |
231, | 0096-3003 | 11 |
PageRank | References | Authors |
0.76 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing Yu | 1 | 11 | 1.10 |
| Mingqiang Li | 2 | 257 | 10.37 |
| Yongli Wang | 3 | 34 | 4.83 |
| Guoping He | 4 | 91 | 13.59 |