Abstract
This paper presents a canonical dual approach for solving a general nonconvex problem in network optimization. Three challenging problems, sensor network location, traveling salesman problem, and scheduling problem are listed to illustrate the applications of the proposed method. It is shown that by the canonical duality, these nonconvex and integer optimization problems are equivalent to unified concave maximization problem over a convex set and hence can be solved efficiently by existing optimization techniques.
Original language | English |
---|---|
Title of host publication | Neural Information Processing - 19th International Conference, ICONIP 2012, Proceedings |
Pages | 702-709 |
Number of pages | 8 |
Edition | PART 3 |
DOIs | |
Publication status | Published - 2012 |
Externally published | Yes |
Event | International Conference on Neural Information Processing 2012 - Doha, Qatar Duration: 12 Nov 2012 → 15 Nov 2012 Conference number: 19th https://link.springer.com/book/10.1007/978-3-642-34500-5 (Proceedings) |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Number | PART 3 |
Volume | 7665 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | International Conference on Neural Information Processing 2012 |
---|---|
Abbreviated title | ICONIP 2012 |
Country/Territory | Qatar |
City | Doha |
Period | 12/11/12 → 15/11/12 |
Internet address |
|
Keywords
- Canonical Duality
- Global Optimization
- Scheduling Problem
- Traveling Salesman Problem
- Wireless Network