Skip to main content
SpringerLink
Log in

Approximate Subgradient Methods for Nonlinearly Constrained Network Flow Problems

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

Abstract

The minimization of nonlinearly constrained network flow problems can be performed by using approximate subgradient methods. The idea is to solve this kind of problem by means of primal-dual methods, given that the minimization of nonlinear network flow problems can be done efficiently exploiting the network structure. In this work, it is proposed to solve the dual problem by using ε-subgradient methods, as the dual function is estimated by minimizing approximately a Lagrangian function, which includes the side constraints (nonnetwork constraints) and is subject only to the network constraints. Some well-known subgradient methods are modified in order to be used as ε-subgradient methods and the convergence properties of these new methods are analyzed. Numerical results appear very promising and effective for this kind of problems

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. Mijangos, E., and Nabona, N., On the First-Order Estimation of Multipliers from Kuhn-Tucker Systems, Computers and Operations Research, Vol. 28, pp. 243–270, 2001.

  2. Mijangos, E., An Implementation of Newton-Like Methods on Nonlinearly Constrained Networks, Computers and Operations Research, Vol. 31, pp. 181–199, 2004.

  3. Mijangos, E., An Efficient Method for Nonlinearly Constrained Networks, European Journal of Operational Research, Vol. 161, pp. 618–635, 2005.

  4. D.P. Bertsekas (1982) Constrained Optimization and Lagrange Multiplier Methods Academic Press New York, NY

    Google Scholar 

  5. Dembo, R. S., A Primal Truncated Newton Algorithm with Application to Large-Scale Nonlinear Network Optimization, Mathematical Programming Studies, Vol. 31, pp. 43–71, 1987.

  6. Toint, P. L. and Tuyttens, D., On Large-Scale Nonlinear Network Optimization, Mathematical Programming, Vol. 48, pp. 125–159, 1990.

  7. D.P. Bertsekas (1999) Nonlinear Programming EditionNumber2 Athena Scientific, Belmont Massachusetts

    Google Scholar 

  8. D.P. Bertsekas (2003) Convex Analysis and Optimization Athena Scientific, Belmont Massachusetts

    Google Scholar 

  9. J.B. Hiriart-Urruty C. Lemaréchal (1996) Convex Analysis and Minimization Algorithms Springer Verlag Berlin, Germany

    Google Scholar 

  10. Correa R., Lemaréchal C., Convergence of Some Algorithms for Convex Minimization. Mathematical Programming, Vol. 62, pp. 261–275, 1993.

  11. Nedić, A., and Bertsekas, D. P., Incremental Subgradient Methods for Nondifferentiable Optimization, SIAM Journal on Optimization, Vol. 12, pp. 109–138, 2001.

  12. U. Brnänlund (1993) On Relaxation Methods for Nonsmooth Convex Optimization Royal Institute of Technology Stockholm, Sweden

    Google Scholar 

  13. Goffin, J. L., and Kiwiel, K., Convergence of a Simple Subgradient Level Method, Mathematical Programming, Vol. 85, pp. 207–211, 1999.

  14. Ermoliev, Yu. M., Methods for Solving Nonlinear Extremal Problems, Cybernetics, Vol. 2, pp. 1–17, 1966.

  15. Polyak, B. T., A General Method of Solving Extremum Problems, Soviet Mathematics Doklady, Vol. 8, pp. 593–597, 1967.

  16. N.Z. Shor (1985) Minimization Methods for Nondifferentiable Functions Springer Verlag Berlin, Germany

    Google Scholar 

  17. Polyak, B. T., Minimization of Unsmooth Functionals, USSR Computational Mathematics and Mathematical Physics, Vol. 9, pp. 14–29, 1969.

  18. E. Mijangos (2003) Inexact Subgradient Methods for Nonlinearly Constrained Networks Department of Applied Mathematics Statistics and Operations Research University of the Basque Country Leioa, Spain

    Google Scholar 

  19. E. Mijangos N. Nabona (1996) The Application of the Multipliers Method in Nonlinear Network Flows with Side Constraints Department of Statistics and Operations Research, Universitat Politècnica de Catalunya Barcelona, Spain

    Google Scholar 

  20. Murtagh, B. A., and Saunders, M. A., Large-Scale Linearly Constrained Optimization, Mathematical Programming, Vol. 14, pp. 41–72, 1978.

  21. InstitutionalAuthorNameDIMACS. (1991) First DIMACS International Algorithm Implementation Challenge: The Benchmark Experiments DIMACS, New Brunswick New Jersey

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of the Basque Country, Leioa, Spain

    E. Mijangos

Authors
  1. E. Mijangos
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was partially supported by Grant MCYT DPI 2002-03330.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mijangos, E. Approximate Subgradient Methods for Nonlinearly Constrained Network Flow Problems. J Optim Theory Appl 128, 167–190 (2006). https://doi.org/10.1007/s10957-005-7563-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-005-7563-0

Keywords

Search

Navigation