Skip to main content
SpringerLink
Log in

Efficient computation of a canonical form for a matrix with the generalized P-property

  • Full Length Paper
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

We use recent results on algorithms for Markov decision problems to show that a canonical form for a matrix with the generalized P-property can be computed, in some important cases, by a strongly polynomial algorithm.

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

Similar content being viewed by others

References

  1. Amenta, N., Ziegler, G.: Deformed products and maximal shadows of polytopes. In: Advances in Discrete and Computational Geometry, Am. Math. Soc., Providence, Contemprary Mathematics 223, 57–90 (1996)

  2. Cottle, R.W., Dantzig, G.B.: A generalization of the linear complementarity problem. J. Comb. Theory 8, 79–90 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, Boston (1992)

    MATH  Google Scholar 

  4. Fiedler, M., Ptak, V.: On matrices with non-positive off-diagonal elements and positive principal minors. Czechoslov. Math. J. 12, 382–400 (1962)

    Article  MathSciNet  Google Scholar 

  5. Foniok, J., Fukuda, K., Gärtner, B., Lüthi, H.-J.: Pivoting in linear complementarity: two polynomial-time cases. Discret. Comput. Geom. 42, 187–205 (2009)

    Article  MATH  Google Scholar 

  6. Gärtner, B., Morris, Jr., W.D., Rüst, L.: Unique sink orientations of grids. Algorithmica 51, 200–235 (2008)

  7. Hansen, T.D., Miltersen, P.B., Zwick, U.: Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor. J. ACM 60, 1:1–1:16 (2013)

  8. Kitahara, T., Mizuno, S.: Klee–Minty’s LP and upper bounds for Dantzig’s simplex method. Oper. Res. Lett. 39, 88–91 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Megiddo, N.: A Note on the Complexity of P Matrix LCP and Computing an Equilibrium. Research Report RJ 6439. IBM Almaden Research Center, San Jose, California (1988)

  10. Morris, Jr., W.D., Lawrence, J.: Geometric properties of hidden Minkowski matrices. SIAM J. Matrix Anal. Appl. 10, 229–232 (1989)

  11. Morris, Jr., W.D., Namiki, M.: Good hidden P-matrix sandwiches. Linear Algebra Appl. 426, 325–341 (2007)

  12. Pang, J.-S.: On discovering hidden Z-matrices. In: Coffman, C.V., Fix, G.J. (eds.) Constructive Approaches to Mathematical Models. Academic Press, New York, pp. 231–241 (1979)

  13. Szanc, B.P.: The generalized complementarity problem, Ph. D. Thesis, Rensselaer Polytechnic Institute, Troy, NY (1989)

  14. Ye, Y.: A new complexity result on solving the Markov decision problem. Math. Oper. Res. 30, 733–749 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ye, Y.: The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate. Math. Oper. Res. 4, 593–603 (2011)

    Article  Google Scholar 

Download references

Acknowledgments

The author would like to thank the referees for their helpful comments.

Author information

Authors and Affiliations

  1. George Mason University, Fairfax, VA, USA

    Walter D. Morris Jr.

Authors
  1. Walter D. Morris Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Walter D. Morris Jr..

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Morris, W.D. Efficient computation of a canonical form for a matrix with the generalized P-property. Math. Program. 153, 275–288 (2015). https://doi.org/10.1007/s10107-014-0802-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-014-0802-0

Keywords

Mathematics Subject Classification

Search

Navigation