IDEAS home Printed from https://ideas.repec.org/a/wly/jnljam/v2015y2015i1n175254.html

Iterative Algorithms for Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators

Author

Listed:
  • Caiping Yang
  • Songnian He

Abstract

Consider the variational inequality VI(C, F) of finding a point x* ∈ C satisfying the property 〈Fx*, x − x*〉≥0 for all x ∈ C, where C is a level set of a convex function defined on a real Hilbert space H and F : H → H is a boundedly Lipschitzian (i.e., Lipschitzian on bounded subsets of H) and strongly monotone operator. He and Xu proved that this variational inequality has a unique solution and devised iterative algorithms to approximate this solution (see He and Xu, 2009). In this paper, relaxed and self‐adaptive iterative algorithms are proposed for computing this unique solution. Since our algorithms avoid calculating the projection PC (calculating PC by computing a sequence of projections onto half‐spaces containing the original domain C) directly and select the stepsizes through a self‐adaptive way (having no need to know any information of bounded Lipschitz constants of F (i.e., Lipschitz constants on some bounded subsets of H)), the implementations of our algorithms are very easy. The algorithms in this paper improve and extend the corresponding results of He and Xu.

Suggested Citation

  • Caiping Yang & Songnian He, 2015. "Iterative Algorithms for Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators," Journal of Applied Mathematics, John Wiley & Sons, vol. 2015(1).
    • Handle: RePEc:wly:jnljam:v:2015:y:2015:i:1:n:175254
    DOI: 10.1155/2015/175254
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2015/175254
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/175254?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
    ---><---

    References listed on IDEAS

    as
    1. Yang, Hai & Bell, Michael G. H., 1997. "Traffic restraint, road pricing and network equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 31(4), pages 303-314, August.
    2. Songnian He & Caiping Yang, 2013. "Solving the Variational Inequality Problem Defined on Intersection of Finite Level Sets," Abstract and Applied Analysis, John Wiley & Sons, vol. 2013(1).
    3. Songnian He & Caiping Yang, 2013. "Solving the Variational Inequality Problem Defined on Intersection of Finite Level Sets," Abstract and Applied Analysis, Hindawi, vol. 2013, pages 1-8, May.
    Full references (including those not matched with items on IDEAS)

    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. Jing Zhao & Hang Zhang, 2014. "Solving Split Common Fixed‐Point Problem of Firmly Quasi‐Nonexpansive Mappings without Prior Knowledge of Operators Norms," Abstract and Applied Analysis, John Wiley & Sons, vol. 2014(1).
    2. Xiaomei Dong & Xingju Cai & Deren Han & Zhili Ge, 2020. "Solving a Class of Variational Inequality Problems with a New Inexact Strategy," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-20, January.
    3. Yang, Hai & Huang, Hai-Jun, 2004. "The multi-class, multi-criteria traffic network equilibrium and systems optimum problem," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 1-15, January.
    4. Fu, Hao & Lam, William H.K. & Ma, Wei & Shi, Yuxin & Jiang, Rui & Sun, Huijun & Gao, Ziyou, 2025. "Modeling the residual queue and queue-dependent capacity in a static traffic assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 192(C).
    5. Joseph Y. J. Chow & Amelia C. Regan, 2011. "Real Option Pricing of Network Design Investments," Transportation Science, INFORMS, vol. 45(1), pages 50-63, February.
    6. Seungkyu Ryu & Anthony Chen & Xiangdong Xu & Keechoo Choi, 2014. "A Dual Approach for Solving the Combined Distribution and Assignment Problem with Link Capacity Constraints," Networks and Spatial Economics, Springer, vol. 14(2), pages 245-270, June.
    7. Suthep Suantai & Suparat Kesornprom & Prasit Cholamjiak, 2019. "Modified Proximal Algorithms for Finding Solutions of the Split Variational Inclusions," Mathematics, MDPI, vol. 7(8), pages 1-17, August.
    8. Ferrari, Paolo, 2010. "Willingness to spend and road pricing rates," Transport Policy, Elsevier, vol. 17(3), pages 160-172, May.
    9. Du, Muqing & Tan, Heqing & Chen, Anthony, 2021. "A faster path-based algorithm with Barzilai-Borwein step size for solving stochastic traffic equilibrium models," European Journal of Operational Research, Elsevier, vol. 290(3), pages 982-999.
    10. Hai Yang, 1999. "Evaluating the benefits of a combined route guidance and road pricing system in a traffic network with recurrent congestion," Transportation, Springer, vol. 26(3), pages 299-322, August.
    11. Michael Patriksson & R. Tyrrell Rockafellar, 2003. "Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria," Transportation Science, INFORMS, vol. 37(1), pages 56-68, February.
    12. Xiangyang Cao & Bingzhong Zhou & Qiang Tang & Jiaqi Li & Donghui Shi, 2018. "Urban Wasteful Transport and Its Estimation Methods," Sustainability, MDPI, vol. 10(12), pages 1-15, December.
    13. Xin Lin & Chris M. J. Tampère & Stef Proost, 2020. "Optimizing Traffic System Performance with Environmental Constraints: Tolls and/or Additional Delays," Networks and Spatial Economics, Springer, vol. 20(1), pages 137-177, March.
    14. Suthep Suantai & Kunrada Kankam & Damrongsak Yambangwai & Watcharaporn Cholamjiak, 2022. "A Modified Inertial Parallel Viscosity-Type Algorithm for a Finite Family of Nonexpansive Mappings and Its Applications," Mathematics, MDPI, vol. 10(23), pages 1-21, November.
    15. Yang, Hai & Meng, Qiang, 1998. "Departure time, route choice and congestion toll in a queuing network with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 32(4), pages 247-260, May.
    16. Peichao Duan & Xubang Zheng & Jing Zhao, 2018. "Strong Convergence Theorems of Viscosity Iterative Algorithms for Split Common Fixed Point Problems," Mathematics, MDPI, vol. 7(1), pages 1-14, December.
    17. Songnian He & Hong-Kun Xu, 2013. "Uniqueness of supporting hyperplanes and an alternative to solutions of variational inequalities," Journal of Global Optimization, Springer, vol. 57(4), pages 1375-1384, December.
    18. Chen, Yanqin & Liao, Changxin & Yao, Jia & Wang, David Z.W. & Chen, Anthony, 2026. "A model for queuing toll policies incorporating cost-sharing characteristics of carpooling in the transportation network with capacity constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 209(C).
    19. Seungkyu Ryu, 2021. "Mode Choice Change under Environmental Constraints in the Combined Modal Split and Traffic Assignment Model," Sustainability, MDPI, vol. 13(7), pages 1-16, March.
    20. Yang, Hai & Bell, Michael G. H., 2001. "Transport bilevel programming problems: recent methodological advances," Transportation Research Part B: Methodological, Elsevier, vol. 35(1), pages 1-4, January.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jnljam:v:2015:y:2015:i:1:n:175254. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/4185 .

    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.