Skip to main content
Springer Nature Link
Log in

Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions

  • Published:
Mathematical Programming Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332, USA, monteiro@isye.gatech.edu, , , , , , US

    Renato D.C. Monteiro

  2. The Institute of Statistical Mathematics, 4-6-7 Minami-Azabu, Minato-Ku, Tokyo, 106, Japan, tsuchiya@sun312.ism.ac.jp, , , , , , JP

    Takashi Tsuchiya

Authors
  1. Renato D.C. Monteiro
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Takashi Tsuchiya
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received August 29, 1996 / Revised version received May 1, 1998 Published online October 21, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Monteiro, R., Tsuchiya, T. Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions. Math. Program. 84, 39–53 (1999). https://doi.org/10.1007/s10107980021a

Download citation

  • Issue Date:

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