Skip to main content
SpringerLink
Log in

Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard

  • Short Communication
  • Published:
Mathematical Programming Submit manuscript

Abstract.

Given an m×n integer matrix A of full row rank, we consider the problem of computing the maximum of ∥B -1 A∥2 where B varies over all bases of A. This quantity appears in various places in the mathematical programming literature. More recently, logarithm of this number was the determining factor in the complexity bound of Vavasis and Ye’s primal-dual interior-point algorithm. We prove that the problem of approximating this maximum norm, even within an exponential (in the dimension of A) factor, is NP-hard. Our proof is based on a closely related result of L. Khachiyan [1].

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Author information

Authors and Affiliations

  1. Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada, e-mail: ltuncel@math.uwaterloo.ca., , , , , , CA

    Levent Tunçel

Authors
  1. Levent Tunçel
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received November 13, 1998 / Revised version received January 20, 1999¶ Published online May 12, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tunçel, L. Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. Math. Program. 86, 219–223 (1999). https://doi.org/10.1007/s101070050087

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s101070050087

Search

Navigation