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 |
| LEADER | 03860nam a22004457a 4500 | ||
|---|---|---|---|
| 001 | 972389 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155223321 | ||
| 020 | |a 9783540384267 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 519.72 | ||
| 082 | |a 510 | ||
| 100 | 1 | |a Kojima, Masakazu, |d 1947- | |
| 245 | 1 | 0 | |a A Unified approach to interior point algorithms for linear complementarity problems |c M. Kojima, N. Megiddo, T. Noma... [et al.]. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 538 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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-point algorithms for the linear complementarity problem (LCP) which is known as a mathematical model for primal-dual pairs of linear programs and convex quadratic programs. A large family of potential reduction algorithms is presented in a unified way for the class of LCPs where the underlying matrix has nonnegative principal minors (P0-matrix). This class includes various important subclasses such as positive semi-definite matrices, P-matrices, P*-matrices introduced in this monograph, and column sufficient matrices. The family contains not only the usual potential reduction algorithms but also path following algorithms and a damped Newton method for the LCP. The main topics are global convergence, global linear convergence, and the polynomial-time convergence of potential reduction algorithms included in the family. | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Programmation (mathématiques) | ||
| 650 | |a Théorie de la commande | ||
| 650 | |a Mathématiques | ||
| 650 | |a Programmation linéaire | ||
| 650 | |a Calcul des variations | ||
| 650 | |a Méthodes des points intérieurs | ||
| 700 | 1 | |a Megiddo, Nimrod, |d 19..- |4 aut | |
| 700 | 1 | |a Noma, Toshihito, |d 19..- |4 aut | |
| 776 | 0 | |0 022212000 |t A Unified approach to interior point algorithms for linear complementarity problems |f M. Kojima,... N. Megiddo,... T. Noma,... [et al.] |c Berlin |n Springer-Verlag |d 1991 |p 1 vol. (VIII-108 p.) |s Lecture notes in computer science |z 0-387-54509-3 | |
| 776 | 0 | |t A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems |b Texte imprimé |z 9783662207840 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-54509-3 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-R43WN0H0-1 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750642076 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-54509-3 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:753993317 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-54509-3 |z Accès INSA CVL | |
| 997 | |0 972389 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||