Skip to main content
SpringerLink
Log in

Modified Primal Path-Following Scheme for the Monotone Variational Inequality Problem

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

Recently, several interior-point methods have been developed under a scaled Lipschitz condition which may be strong in general. In this paper, we develop a modified path-following scheme which does not require the above condition. Its global convergence is proved under only the assumptions of monotonicity and differentiability of the mapping. The scheme is adapted to the network equilibrium problem (a nonlinear multicommodity network flow problem) with a simplicial decomposition technique.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. PANG, J. S., Complementarity Problems, Handbook of Global Optimization, Edited by R. Horst and P. M. Pardalos, Kluwer Academic Publishers, Dordrecht, Netherlands, pp. 284–313, 1995.

    Google Scholar 

  2. TSENG, P., Global Linear Convergence of a Path-Following Algorithm for Some Monotone Variational Inequality Problems, Journal of Optimization Theory and Applications, Vol. 75, pp. 265–279, 1992.

    Google Scholar 

  3. WU, J. H., Interior-Point Algorithms for Some Monotone Variational Inequality Problems, Publication 879, Centre de Recherche sur les Transport, Université de Montréal, 1993.

  4. WU, J. H., A Long-Step Primal Path-Following Algorithm for Some Monotone Variational Inequality Problems, Publication 959, Centre de Recherche su les Transports, Université de Montréal, 1993.

  5. TAJI, K., FUKUSHIMA, M., and IBARAKI, T., A Globally Convergent Newton Method for Solving Monotone Variational Inequalities, Mathematical Programming, Vol. 58, pp. 369–383, 1993.

    Google Scholar 

  6. KORTANEK, K. O., and ZHU, J., A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems, Mathematics of Operations Research, Vol. 1, pp. 116–127, 1993.

    Google Scholar 

  7. WU, J. H., RUBIO-ARDANAZ, J. M., and FLORIAN, M., A Primal Path-Following Algorithmic Scheme for the Monotone Variational Inequality Problem with One Simple Constraint and Nonnegative Variables: Implementation and Computational Experiences, Publication CRT–95–39, Centre de Recherche sur les Transports, Université de Montréal, 1995.

  8. FIACCO, A. V., and MCCORMICK, G. P., Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley and Sons, New York, New York, 1968.

    Google Scholar 

  9. WRIGHT, M. H., Interior Methods for Constrained Optimization, Acta Numerica, pp. 341–407, 1992.

  10. GÜLER, O., Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems, Mathematics of Operations Research, Vol. 1, pp. 128–147, 1993.

    Google Scholar 

  11. WU, J. H., FLORIAN, M., and MARCOTTE, P., A General Descent Framework for Monotone Variational Inequality Problems, Mathematical Programming, Vol. 61, pp. 281–300, 1993.

    Google Scholar 

  12. NESTEROV, Y., and NEMIROVSKII, A., Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, SIAM, Philadelphia, Pennsylvania, 1994.

    Google Scholar 

  13. BERTSEKAS, D. P., and GAFNI, E. M., Projection Methods for Variational Inequalities with Application to the Traffic Assignment Problem, Mathematical Programming Study, Vol. 17, pp. 139–159, 1982.

    Google Scholar 

  14. CHOI, I. C., and GOLDFARB, D., Exploiting Special Structure in a Primal-Dual Path-Following Algorithm, Mathematical Programming, Vol. 58, pp. 33–52, 1993.

    Google Scholar 

  15. LAWPHONGPANICH, S., and HEARN, D. W., Simplicial Decomposition of the Asymmetric Traffic Assignment Problem, Transportation Research, Vol. 18B, pp. 123–133, 1984.

    Google Scholar 

  16. WU, J. H., and FLORIAN, M., A Simplicial Decomposition Method for the Transit Equilibrium Assignment Problem, Annals of Operations Research, Vol. 44, pp. 245–260, 1993.

    Google Scholar 

  17. PINAR, M. C., and ZENOIS, S. A., Parallel Decomposition of Multicommodity Network Flows Using Linear-Quadratic Penalty Algorithms, ORSA Journal on Computing, Vol. 4, pp. 235–248, 1992.

    Google Scholar 

  18. FUKUSHIMA, M., Equivalent Differentiable Optimization Problems and Descent Methods for Asymmetric Variational Inequality Problems, Mathematical Programming, Vol. 53, pp. 99–110, 1992.

    Google Scholar 

  19. KARMARKAR, N., A New Polynomial-Time Algorithm for Linear Programming, Combinatorica, Vol. 4, pp. 373–395, 1984.

    Google Scholar 

  20. YE, Y., and POTRA, F., An Interior-Point Algorithm for Solving Entropy Optimization Problems with Globally Linear and Locally Quadratic Convergence Rate, SIAM Journal on Optimization, Vol. 3, pp. 843–860, 1993.

    Google Scholar 

  21. ZANGWILL, W. I., Nonlinear Programming, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Research on Transportation, Université de Montréal, Montréal, Québec, Canada:

    J. H. Wu (Researcher)

  2. Montréal, Québec, Canada

    J. H. Wu (Researcher)

Authors
  1. J. H. Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, J.H. Modified Primal Path-Following Scheme for the Monotone Variational Inequality Problem. Journal of Optimization Theory and Applications 95, 189–208 (1997). https://doi.org/10.1023/A:1022643630525

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022643630525

Search

Navigation