Polynomial interior-point algorithms for P*(κ) horizontal linear complementarity problem
- Author
- WANG, G. Q1 2 ; BAI, Y. Q2
[1] College of Advanced Vocational Technology, Shanghai University of Engineering Science, Shanghai 200437, China
[2] Department of Mathematics, Shanghai University, Shanghai 200444, China - Source
Journal of computational and applied mathematics. 2009, Vol 233, Num 2, pp 248-263, 16 p ; ref : 25 ref
- CODEN
- JCAMDI
- ISSN
- 0377-0427
- Scientific domain
- Computer science; Mathematics
- Publisher
- Elsevier, Kidlington
- Publication country
- United Kingdom
- Document type
- Article
- Language
- English
- Author keyword
- 60K05 90C33 90C51 Interior-point methods Iteration bounds Kernel function Large- and small-update methods P*(κ) horizontal linear complementarity problem
- Keyword (fr)
- Algorithme Analyse numérique Fonction convexe Fonction noyau Itération Mathématiques appliquées Méthode point intérieur Performance algorithme Polynôme Problème complémentarité
- Keyword (en)
- Algorithm Numerical analysis Convex function Kernel function Iteration Applied mathematics Interior point method Algorithm performance Polynomial Complementarity problem
- Keyword (es)
- Algoritmo Análisis numérico Función convexa Función núcleo Iteracción Matemáticas aplicadas Método punto interior Resultado algoritmo Polinomio Problema complementariedad
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02E Mathematical analysis
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis
- Discipline
- Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 21980468
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.cam.2009.07.014 
https://dx.doi.org/10.1016/j.cam.2009.07.014
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cam.2009.07.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Journal of computational and applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:21:\"J. comput. appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"233\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"248\";s:8:\"\u0000*\u0000epage\";s:3:\"263\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-0427\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. Q\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"BAI, Y. Q\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCAMDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cam.2009.07.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Journal of computational and applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:21:\"J. comput. appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"233\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"248\";s:8:\"\u0000*\u0000epage\";s:3:\"263\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-0427\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. Q\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"BAI, Y. Q\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCAMDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cam.2009.07.014\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cam.2009.07.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Journal of computational and applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:21:\"J. comput. appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"233\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"248\";s:8:\"\u0000*\u0000epage\";s:3:\"263\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-0427\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. Q\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"BAI, Y. Q\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCAMDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cam.2009.07.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Journal of computational and applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:21:\"J. comput. appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"233\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"248\";s:8:\"\u0000*\u0000epage\";s:3:\"263\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-0427\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. Q\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"BAI, Y. Q\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCAMDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.cam.2009.07.014\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:9:\"\u0000*\u0000jtitle\";s:48:\"Journal of computational and applied mathematics\";s:9:\"\u0000*\u0000stitle\";s:21:\"J. comput. appl. math\";s:7:\"\u0000*\u0000date\";s:4:\"2009\";s:9:\"\u0000*\u0000volume\";s:3:\"233\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"248\";s:8:\"\u0000*\u0000epage\";s:3:\"263\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0377-0427\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:4:\"WANG\";s:10:\"\u0000*\u0000aufirst\";s:4:\"G. Q\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:9:\"BAI, Y. Q\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"JCAMDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:89:\"Polynomial interior-point algorithms for P*(\u03ba) horizontal linear complementarity problem\";s:8:\"\u0000*\u0000place\";s:10:\"Kidlington\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"16\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
