Canonical duality theory and algorithm for solving challenging problems in network optimisation

Ning Ruan, David Yang Gao

Research output: Chapter in Book/Report/Conference proceedingConference PaperOther

1 Citation (Scopus)

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 languageEnglish
Title of host publicationNeural Information Processing - 19th International Conference, ICONIP 2012, Proceedings
Pages702-709
Number of pages8
EditionPART 3
DOIs
Publication statusPublished - 2012
Externally publishedYes
EventInternational Conference on Neural Information Processing 2012 - Doha, Qatar
Duration: 12 Nov 201215 Nov 2012
Conference number: 19th
https://link.springer.com/book/10.1007/978-3-642-34500-5 (Proceedings)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 3
Volume7665 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Neural Information Processing 2012
Abbreviated titleICONIP 2012
Country/TerritoryQatar
CityDoha
Period12/11/1215/11/12
Internet address

Keywords

  • Canonical Duality
  • Global Optimization
  • Scheduling Problem
  • Traveling Salesman Problem
  • Wireless Network

Cite this