Polynomial-Time Methods to Solve Unimodular Quadratic Programs With Performance Guarantees

Shankarachary Ragi, Edwin K.P. Chong, Hans Mittelmann

Research output: Contribution to journalArticle

Abstract

We develop polynomial-time heuristic methods to solve unimodular quadratic program (UQP) approximately, which is a known NP-hard problem. Several problems in active sensing and wireless communication applications boil down to UQPs. First, we derive a performance bound for a known UQP approximation method called dominant-eigenvectormatching heuristic. Next, we present two new polynomial-time heuristic methods inspired from the greedy strategy, and we provide performance guarantees for these methods with respect to the optimal objective.

Original languageEnglish (US)
JournalIEEE Transactions on Aerospace and Electronic Systems
DOIs
StateAccepted/In press - Jan 1 2018

Keywords

  • Complexity theory
  • Eigenvalues and eigenfunctions
  • greedy methods
  • Heuristic algorithms
  • Linear programming
  • performance guarantees
  • polynomial-time methods
  • Radar
  • Sensors
  • string submodularity
  • Unimodular codes
  • unimodular quadratic programming
  • Wireless communication

ASJC Scopus subject areas

  • Aerospace Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Polynomial-Time Methods to Solve Unimodular Quadratic Programs With Performance Guarantees'. Together they form a unique fingerprint.

  • Cite this