Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- Author
- LIQUN QI1 ; DEFENG SUN1
[1] School of Mathematics, The University of New South Wales, Sydney 2052, Australia - Source
Mathematics of computation. 2000, Vol 69, Num 229, pp 283-304 ; ref : 36 ref
- CODEN
- MCMPAF
- ISSN
- 0025-5718
- Scientific domain
- Control theory, operational research; Computer science; Mathematics
- Publisher
- American Mathematical Society, Providence, RI
- Publication country
- United States
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme Convergence Equation non linéaire Lissage Problème complémentarité Algorithme Hotta Yoshise Convergence super linéaire Point non intérieur Technique lissage Chen Harker Kanzow Smale
- Keyword (en)
- Algorithm Convergence Non linear equation Smoothing Complementarity problem Hotta Hoshise algorithm Superlinear convergence Noninterior point Chen Harker Kanzow Smale smoothing technique
- Keyword (es)
- Algoritmo Convergencia Ecuación no lineal Alisamiento Problema complementariedad
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02I Numerical analysis. Scientific computation / 001A02I01 Numerical analysis / 001A02I01G Nonlinear algebraic and transcendental equations
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A03 Mathematical programming
- Discipline
- Mathematics Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1270040
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
Install on your browser
"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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Mathematics of computation\";s:9:\"\u0000*\u0000stitle\";s:12:\"Math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"69\";s:8:\"\u0000*\u0000issue\";s:3:\"229\";s:8:\"\u0000*\u0000spage\";s:3:\"283\";s:8:\"\u0000*\u0000epage\";s:3:\"304\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5718\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LIQUN QI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"DEFENG SUN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MCMPAF\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:8:\"\u0000*\u0000place\";s:14:\"Providence, RI\";s:6:\"\u0000*\u0000pub\";s:29:\"American Mathematical Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Mathematics of computation\";s:9:\"\u0000*\u0000stitle\";s:12:\"Math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"69\";s:8:\"\u0000*\u0000issue\";s:3:\"229\";s:8:\"\u0000*\u0000spage\";s:3:\"283\";s:8:\"\u0000*\u0000epage\";s:3:\"304\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5718\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LIQUN QI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"DEFENG SUN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MCMPAF\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:8:\"\u0000*\u0000place\";s:14:\"Providence, RI\";s:6:\"\u0000*\u0000pub\";s:29:\"American Mathematical Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";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:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Mathematics of computation\";s:9:\"\u0000*\u0000stitle\";s:12:\"Math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"69\";s:8:\"\u0000*\u0000issue\";s:3:\"229\";s:8:\"\u0000*\u0000spage\";s:3:\"283\";s:8:\"\u0000*\u0000epage\";s:3:\"304\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5718\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LIQUN QI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"DEFENG SUN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MCMPAF\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:8:\"\u0000*\u0000place\";s:14:\"Providence, RI\";s:6:\"\u0000*\u0000pub\";s:29:\"American Mathematical Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Mathematics of computation\";s:9:\"\u0000*\u0000stitle\";s:12:\"Math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"69\";s:8:\"\u0000*\u0000issue\";s:3:\"229\";s:8:\"\u0000*\u0000spage\";s:3:\"283\";s:8:\"\u0000*\u0000epage\";s:3:\"304\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5718\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LIQUN QI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"DEFENG SUN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MCMPAF\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:8:\"\u0000*\u0000place\";s:14:\"Providence, RI\";s:6:\"\u0000*\u0000pub\";s:29:\"American Mathematical Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";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:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:9:\"\u0000*\u0000jtitle\";s:26:\"Mathematics of computation\";s:9:\"\u0000*\u0000stitle\";s:12:\"Math. comput\";s:7:\"\u0000*\u0000date\";s:4:\"2000\";s:9:\"\u0000*\u0000volume\";s:2:\"69\";s:8:\"\u0000*\u0000issue\";s:3:\"229\";s:8:\"\u0000*\u0000spage\";s:3:\"283\";s:8:\"\u0000*\u0000epage\";s:3:\"304\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5718\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LIQUN QI\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:10:\"DEFENG SUN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MCMPAF\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:97:\"Improving the convergence of non-interior point algorithms for nonlinear complementarity problems\";s:8:\"\u0000*\u0000place\";s:14:\"Providence, RI\";s:6:\"\u0000*\u0000pub\";s:29:\"American Mathematical Society\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";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
