- Title
- Optimisation solvers and problem formulations for solving a data clustering problem
- Creator
- Ugon, Julien; Rubinov, Alex
- Date
- 2005
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/42459
- Identifier
- vital:1608
- Abstract
- A popular apprach for solving complex optimization problems is through relaxation: some constraints are removed in order to have a convex problem approximating the original problem. On the other hand, direct approaches for solving such problems are becoming increasingly powerful. This paper examines two cases drawn from data analysis, in order to compare the two techniques.; E1
- Publisher
- Ballarat, Victoria : University of Ballarat
- Relation
- Paper presented at the Sixteenth Australasian Workshop on Combinatorial Algorithms, Ballarat, Victoria : 18th - 21st September, 2005
- Rights
- Open Access
- Rights
- Copyright Unknown
- Rights
- This metadata is freely available under a CCO license
- Subject
- Global optimization; Nonconvex; Relaxation
- Full Text
- Reviewed
- Hits: 986
- Visitors: 1098
- Downloads: 119
Thumbnail | File | Description | Size | Format | |||
---|---|---|---|---|---|---|---|
View Details Download | SOURCE1 | Conference paper | 105 KB | Adobe Acrobat PDF | View Details Download |