Name
Abstract | ||
|---|---|---|
The constraint-partitioning approach achieves a significant reduction in solution time while resolving some large-scale mixed-integer optimization problems. Its theoretical foundation, extended saddle-point theory, which implies the original problem can be decomposed into several subproblems of relatively smaller scale in virtue of the separability of extended saddle-point conditions, still needs to be deliberated carefully. Enlightened by such a plausible theory, we have developed a novel parallel algorithm for convex programming. Our approach not only works well theoretically, but also may be promising in numerical experiments. As the theoretical essence of Support Vector Machine (SVM) is a quadratic programming, we are inspired to apply this new method onto large-scale SVMs to achieve some numerical improvements. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-16336-4_18 | Communications in Computer and Information Science |
Keywords | Field | DocType |
support vector machine,large-scale quadratic programming,extended saddle points,parallel variable distribution | Saddle,Mathematical optimization,Saddle point,Parallel algorithm,Computer science,Support vector machine,Quadratic programming,Optimization problem,Convex optimization | Conference |
Volume | Issue | ISSN |
105 | PART 1 | 1865-0929 |
Citations | PageRank | References |
1 | 0.35 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaorui Li | 1 | 1 | 0.35 |
| Congying Han | 2 | 17 | 4.07 |
| Guoping He | 3 | 91 | 13.59 |