File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10957-007-9287-9
- Scopus: eid_2-s2.0-36148999492
- WOS: WOS:000250922900003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Extended LQP method for monotone nonlinear complementarity problems
| Title | Extended LQP method for monotone nonlinear complementarity problems |
|---|---|
| Authors | |
| Keywords | Logarithmic-quadratic proximal method Nonlinear complementarity problems |
| Issue Date | 2007 |
| Citation | Journal of Optimization Theory and Applications, 2007, v. 135, n. 3, p. 343-353 How to Cite? |
| Abstract | To solve nonlinear complementarity problems (NCP), the logarithmic- quadratic proximal (LQP) method solves a system of nonlinear equations at each iteration. In this paper, the iterates generated by the original LQP method are extended by explicit formulas and thus an extended LQP method is presented. It is proved theoretically that the lower bound of the progress obtained by the extended LQP method is greater than that by the original LQP method. Preliminary numerical results are provided to verify the theoretical assertions and the effectiveness of both the original and the extended LQP method. © 2007 Springer Science+Business Media, LLC. |
| Persistent Identifier | http://hdl.handle.net/10722/250859 |
| ISSN | 2021 Impact Factor: 2.189 2020 SCImago Journal Rankings: 1.109 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Bnouhachem, A. | - |
| dc.contributor.author | Yuan, X. M. | - |
| dc.date.accessioned | 2018-02-01T01:53:55Z | - |
| dc.date.available | 2018-02-01T01:53:55Z | - |
| dc.date.issued | 2007 | - |
| dc.identifier.citation | Journal of Optimization Theory and Applications, 2007, v. 135, n. 3, p. 343-353 | - |
| dc.identifier.issn | 0022-3239 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/250859 | - |
| dc.description.abstract | To solve nonlinear complementarity problems (NCP), the logarithmic- quadratic proximal (LQP) method solves a system of nonlinear equations at each iteration. In this paper, the iterates generated by the original LQP method are extended by explicit formulas and thus an extended LQP method is presented. It is proved theoretically that the lower bound of the progress obtained by the extended LQP method is greater than that by the original LQP method. Preliminary numerical results are provided to verify the theoretical assertions and the effectiveness of both the original and the extended LQP method. © 2007 Springer Science+Business Media, LLC. | - |
| dc.language | eng | - |
| dc.relation.ispartof | Journal of Optimization Theory and Applications | - |
| dc.subject | Logarithmic-quadratic proximal method | - |
| dc.subject | Nonlinear complementarity problems | - |
| dc.title | Extended LQP method for monotone nonlinear complementarity problems | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1007/s10957-007-9287-9 | - |
| dc.identifier.scopus | eid_2-s2.0-36148999492 | - |
| dc.identifier.volume | 135 | - |
| dc.identifier.issue | 3 | - |
| dc.identifier.spage | 343 | - |
| dc.identifier.epage | 353 | - |
| dc.identifier.eissn | 1573-2878 | - |
| dc.identifier.isi | WOS:000250922900003 | - |
| dc.identifier.issnl | 0022-3239 | - |