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...
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
538 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 |
Table des matières:
- Summary
- The class of linear complementarity problems with P 0-matrices
- Basic analysis of the UIP method
- Initial points and stopping criteria
- A class of potential reduction algorithms
- Proofs of convergence theorems.