Article ID: | iaor20134061 |

Volume: | 56 |

Issue: | 4 |

Start Page Number: | 1441 |

End Page Number: | 1455 |

Publication Date: | Aug 2013 |

Journal: | Journal of Global Optimization |

Authors: | Li Duan, Gao Jianjun |

Keywords: | NP-hard, eigenvalues |

Abstract:

We propose in this paper a fixed parameter polynomial algorithm for the cardinality‐constrained quadratic optimization problem, which is NP‐hard in general. More specifically, we prove that, given a problem of size