File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: LQP based interior prediction-correction method for nonlinear complementarity problems
Title | LQP based interior prediction-correction method for nonlinear complementarity problems |
---|---|
Authors | |
Keywords | Logarithmic-Quadratic proximal method Inexact criterion Nonlinear complementarity problems Prediction-correction |
Issue Date | 2006 |
Citation | Journal of Computational Mathematics, 2006, v. 24, n. 1, p. 33-44 How to Cite? |
Abstract | To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system of nonlinear equations (LQP system). This paper presents a practical LQP method-based prediction-correction method for NCP. The predictor is obtained via solving the LQP system approximately under significantly relaxed restriction, and the new iterate (the corrector) is computed directly by an explicit formula derived from the original LQP method. The implementations are very easy to be carried out. Global convergence of the method is proved under the same mild assumptions as the original LQP method. Finally, numerical results for traffic equilibrium problems are provided to verify that the method is effective for some practical problems. |
Persistent Identifier | http://hdl.handle.net/10722/250906 |
ISSN | 2023 Impact Factor: 0.9 2023 SCImago Journal Rankings: 0.488 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | He, Bing Sheng | - |
dc.contributor.author | Liao, Li Zhi | - |
dc.contributor.author | Yuan, Xiao Ming | - |
dc.date.accessioned | 2018-02-01T01:54:02Z | - |
dc.date.available | 2018-02-01T01:54:02Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Journal of Computational Mathematics, 2006, v. 24, n. 1, p. 33-44 | - |
dc.identifier.issn | 0254-9409 | - |
dc.identifier.uri | http://hdl.handle.net/10722/250906 | - |
dc.description.abstract | To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the Logarithmic-Quadratic Proximal (LQP) method solves a system of nonlinear equations (LQP system). This paper presents a practical LQP method-based prediction-correction method for NCP. The predictor is obtained via solving the LQP system approximately under significantly relaxed restriction, and the new iterate (the corrector) is computed directly by an explicit formula derived from the original LQP method. The implementations are very easy to be carried out. Global convergence of the method is proved under the same mild assumptions as the original LQP method. Finally, numerical results for traffic equilibrium problems are provided to verify that the method is effective for some practical problems. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Computational Mathematics | - |
dc.subject | Logarithmic-Quadratic proximal method | - |
dc.subject | Inexact criterion | - |
dc.subject | Nonlinear complementarity problems | - |
dc.subject | Prediction-correction | - |
dc.title | LQP based interior prediction-correction method for nonlinear complementarity problems | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.scopus | eid_2-s2.0-33644639776 | - |
dc.identifier.volume | 24 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 33 | - |
dc.identifier.epage | 44 | - |
dc.identifier.issnl | 0254-9409 | - |