IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v112y2002i1d10.1023_a1013048729944.html
   My bibliography  Save this article

Modified Goldstein–Levitin–Polyak Projection Method for Asymmetric Strongly Monotone Variational Inequalities

Author

Listed:
  • B. S. He

    (Nanjing University)

  • H. Yang

    (Hong Kong University of Science and Technology)

  • Q. Meng

    (Hong Kong University of Science and Technology)

  • D. R. Han

    (Nanjing University)

Abstract

In this paper, we present a modified Goldstein–Levitin–Polyak projection method for asymmetric strongly monotone variational inequality problems. A practical and robust stepsize choice strategy, termed self-adaptive procedure, is developed. The global convergence of the resulting algorithm is established under the same conditions used in the original projection method. Numerical results and comparison with some existing projection-type methods are given to illustrate the efficiency of the proposed method.

Suggested Citation

  • B. S. He & H. Yang & Q. Meng & D. R. Han, 2002. "Modified Goldstein–Levitin–Polyak Projection Method for Asymmetric Strongly Monotone Variational Inequalities," Journal of Optimization Theory and Applications, Springer, vol. 112(1), pages 129-143, January.
    • Handle: RePEc:spr:joptap:v:112:y:2002:i:1:d:10.1023_a:1013048729944
    DOI: 10.1023/A:1013048729944
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1013048729944
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1013048729944?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. D. Zhang & A. Nagurney, 1997. "Formulation, Stability, and Computation of Traffic Network Equilibria as Projected Dynamical Systems," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 417-444, May.
    2. Anna Nagurney & Ding Zhang, 1997. "Projected Dynamical Systems in the Formulation, Stability Analysis, and Computation of Fixed-Demand Traffic Network Equilibria," Transportation Science, INFORMS, vol. 31(2), pages 147-158, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Min Zhang & Deren Han & Gang Qian & Xihong Yan, 2012. "A New Decomposition Method for Variational Inequalities with Linear Constraints," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 675-695, March.
    2. He, Bingsheng & He, Xiao-Zheng & Liu, Henry X. & Wu, Ting, 2009. "Self-adaptive projection method for co-coercive variational inequalities," European Journal of Operational Research, Elsevier, vol. 196(1), pages 43-48, July.
    3. Liu, Zhiyuan & Chen, Xinyuan & Meng, Qiang & Kim, Inhi, 2018. "Remote park-and-ride network equilibrium model and its applications," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 37-62.
    4. Han, Deren & Zhang, Hongchao & Qian, Gang & Xu, Lingling, 2012. "An improved two-step method for solving generalized Nash equilibrium problems," European Journal of Operational Research, Elsevier, vol. 216(3), pages 613-623.
    5. Zhou, Bojian & Bliemer, Michiel & Yang, Hai & He, Jie, 2015. "A trial-and-error congestion pricing scheme for networks with elastic demand and link capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 72(C), pages 77-92.
    6. Chen, Anthony & Choi, Keechoo, 2017. "Solving the combined modal split and traffic assignment problem with two types of transit impedance functionAuthor-Name: Ryu, Seungkyu," European Journal of Operational Research, Elsevier, vol. 257(3), pages 870-880.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Tsakas, Elias & Voorneveld, Mark, 2009. "The target projection dynamic," Games and Economic Behavior, Elsevier, vol. 67(2), pages 708-719, November.
    2. Anna Nagurney & Dong Li, 2015. "A supply chain network game theory model with product differentiation, outsourcing of production and distribution, and quality and price competition," Annals of Operations Research, Springer, vol. 226(1), pages 479-503, March.
    3. Cojocaru, Monica-Gabriela & Daniele, Patrizia & Nagurney, Anna, 2006. "Double-layered dynamics: A unified theory of projected dynamical systems and evolutionary variational inequalities," European Journal of Operational Research, Elsevier, vol. 175(1), pages 494-507, November.
    4. Xing Gao & Weijun Zhong & Shue Mei, 2013. "Stochastic Evolutionary Game Dynamics and Their Selection Mechanisms," Computational Economics, Springer;Society for Computational Economics, vol. 41(2), pages 233-247, February.
    5. Jiayang Li & Zhaoran Wang & Yu Marco Nie, 2023. "Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice," Papers 2304.02500, arXiv.org, revised Feb 2024.
    6. Ziyou Gao & Yunchao Qu & Xingang Li & Jiancheng Long & Hai-Jun Huang, 2014. "Simulating the Dynamic Escape Process in Large Public Places," Operations Research, INFORMS, vol. 62(6), pages 1344-1357, December.
    7. Wang, Dong & Liao, Feixiong & Gao, Ziyou & Rasouli, Soora & Huang, Hai-Jun, 2020. "Tolerance-based column generation for boundedly rational dynamic activity-travel assignment in large-scale networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    8. Mertikopoulos, Panayotis & Sandholm, William H., 2018. "Riemannian game dynamics," Journal of Economic Theory, Elsevier, vol. 177(C), pages 315-364.
    9. Kumar, Amit & Peeta, Srinivas, 2015. "A day-to-day dynamical model for the evolution of path flows under disequilibrium of traffic networks with fixed demand," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 235-256.
    10. He, Xiaozheng & Guo, Xiaolei & Liu, Henry X., 2010. "A link-based day-to-day traffic assignment model," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 597-608, May.
    11. Marc Harper & Dashiell Fryer, 2015. "Lyapunov Functions for Time-Scale Dynamics on Riemannian Geometries of the Simplex," Dynamic Games and Applications, Springer, vol. 5(3), pages 318-333, September.
    12. Liu, Peng & Liao, Feixiong & Tian, Qiong & Huang, Hai-Jun & Timmermans, Harry, 2020. "Day-to-day needs-based activity-travel dynamics and equilibria in multi-state supernetworks," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 208-227.
    13. Xiaomei Zhao & Chunhua Wan & Jun Bi, 2019. "Day-to-Day Assignment Models and Traffic Dynamics Under Information Provision," Networks and Spatial Economics, Springer, vol. 19(2), pages 473-502, June.
    14. Jin, Wen-Long, 2007. "A dynamical system model of the traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 41(1), pages 32-48, January.
    15. Wang, Jian & He, Xiaozheng & Peeta, Srinivas, 2016. "Sensitivity analysis based approximation models for day-to-day link flow evolution process," Transportation Research Part B: Methodological, Elsevier, vol. 92(PA), pages 35-53.
    16. Han, Linghui & Wang, David Z.W. & Lo, Hong K. & Zhu, Chengjuan & Cai, Xingju, 2017. "Discrete-time day-to-day dynamic congestion pricing scheme considering multiple equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 1-16.
    17. Lu, Chung-Cheng & Mahmassani, Hani S. & Zhou, Xuesong, 2009. "Equivalent gap function-based reformulation and solution algorithm for the dynamic user equilibrium problem," Transportation Research Part B: Methodological, Elsevier, vol. 43(3), pages 345-364, March.
    18. Ren-Yong Guo & Hai-Jun Huang & Hai Yang, 2019. "Tradable Credit Scheme for Control of Evolutionary Traffic Flows to System Optimum: Model and its Convergence," Networks and Spatial Economics, Springer, vol. 19(3), pages 833-868, September.
    19. Minyu Shen & Feng Xiao & Weihua Gu & Hongbo Ye, 2024. "Cognitive Hierarchy in Day-to-day Network Flow Dynamics," Papers 2409.11908, arXiv.org.
    20. Huang, Hai-Jun & Lam, William H. K., 2002. "Modeling and solving the dynamic user equilibrium route and departure time choice problem in network with queues," Transportation Research Part B: Methodological, Elsevier, vol. 36(3), pages 253-273, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:112:y:2002:i:1:d:10.1023_a:1013048729944. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.