File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.ejor.2005.11.006
- Scopus: eid_2-s2.0-33749993155
- WOS: WOS:000242102800005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: The prediction-correction approach to nonlinear complementarity problems
Title | The prediction-correction approach to nonlinear complementarity problems |
---|---|
Authors | |
Keywords | Prediction-correction Nonlinear programming Nonlinear complementarity problems Proximal point |
Issue Date | 2007 |
Citation | European Journal of Operational Research, 2007, v. 176, n. 3, p. 1357-1370 How to Cite? |
Abstract | This paper presents a prediction-correction approach to solving the nonlinear complementarity problem (NCP). Each iteration of the new method consists of a prediction and a correction. The predictor is produced by an inexact Logarithmic-Quadratic Proximal method; and then it is corrected by the Proximal Point Algorithm. Convergence of the new method is proved under mild assumptions. Comparison to existing methods shows the superiority of the new method. Numerical experiments including the application to traffic equilibrium problems demonstrate that the new method is attractive in practice. © 2005 Elsevier B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/250914 |
ISSN | 2021 Impact Factor: 6.363 2020 SCImago Journal Rankings: 2.161 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yuan, Xiao ming | - |
dc.date.accessioned | 2018-02-01T01:54:04Z | - |
dc.date.available | 2018-02-01T01:54:04Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | European Journal of Operational Research, 2007, v. 176, n. 3, p. 1357-1370 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10722/250914 | - |
dc.description.abstract | This paper presents a prediction-correction approach to solving the nonlinear complementarity problem (NCP). Each iteration of the new method consists of a prediction and a correction. The predictor is produced by an inexact Logarithmic-Quadratic Proximal method; and then it is corrected by the Proximal Point Algorithm. Convergence of the new method is proved under mild assumptions. Comparison to existing methods shows the superiority of the new method. Numerical experiments including the application to traffic equilibrium problems demonstrate that the new method is attractive in practice. © 2005 Elsevier B.V. All rights reserved. | - |
dc.language | eng | - |
dc.relation.ispartof | European Journal of Operational Research | - |
dc.subject | Prediction-correction | - |
dc.subject | Nonlinear programming | - |
dc.subject | Nonlinear complementarity problems | - |
dc.subject | Proximal point | - |
dc.title | The prediction-correction approach to nonlinear complementarity problems | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.ejor.2005.11.006 | - |
dc.identifier.scopus | eid_2-s2.0-33749993155 | - |
dc.identifier.volume | 176 | - |
dc.identifier.issue | 3 | - |
dc.identifier.spage | 1357 | - |
dc.identifier.epage | 1370 | - |
dc.identifier.isi | WOS:000242102800005 | - |
dc.identifier.issnl | 0377-2217 | - |