A Unified approach to interior point algorithms for linear complementarity problems

Following Karmarkar's 1984 linear programming algorithm, numerous interior-point algorithms have been proposed for various mathematical programming problems such as linear programming, convex quadratic programming and convex programming in general. This monograph presents a study of interior-po...

詳細記述

保存先:
書誌詳細
主要な著者: Kojima, Masakazu, 1947-, Megiddo, Nimrod, 19..- (著者), Noma, Toshihito, 19..- (著者)
フォーマット: Livre numérique
言語:Anglais
出版事項: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
シリーズ:Lecture notes in computer science 538
主題:
オンライン・アクセス:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
注記: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• A Unified approach to interior point algorithms for linear complementarity problems, M. Kojima,... N. Megiddo,... T. Noma,... [et al.], Berlin, Springer-Verlag, 1991, 1 vol. (VIII-108 p.), Lecture notes in computer science, 0-387-54509-3
• A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Texte imprimé, 9783662207840

類似資料