Skip to main content
SpringerLink
Log in
Book cover

International Conference on Computational Science and Its Applications

ICCSA 2006: Computational Science and Its Applications - ICCSA 2006 pp 757–766Cite as

A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3982))

Abstract

The efficiency of the network flow techniques can be exploited in the solution of nonlinearly constrained network flow problems (NCNFP) by means of approximate subgradient methods (ASM). We propose to solve the dual problem by an ASM that uses a variant of the well-known constant step rule of Shor. In this work the kind of convergence of this method is analyzed and its efficiency is compared with that of other approximate subgradient methods over NCNFP.

The research was partially supported by grant MCYT DPI 2005-09117-C02-01.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)

    MATH  Google Scholar 

  2. Brännlund, U.: On relaxation methods for nonsmooth convex optimization. Doctoral Thesis, Royal Institute of Technology, Stockholm, Sweden (1993)

    Google Scholar 

  3. Correa, R., Lemarechal, C.: Convergence of some algorithms for convex minimization. Mathematical Programming 62, 261–275 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. DIMACS. The first DIMACS international algorithm implementation challenge: The bench-mark experiments. Technical Report, DIMACS, New Brunswick, NJ, USA (1991)

    Google Scholar 

  5. Goffin, J.L., Kiwiel, K.: Convergence of a simple subgradient level method. Mathematical Programming 85, 207–211 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kiwiel, K.: Convergence of approximate and incremental subgradient methods for convex optimization. SIAM J. on Optimization 14(3), 807–840 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mijangos, E.: An efficient method for nonlinearly constrained networks. European Journal of Operational Research 161(3), 618–635 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Mijangos, E.: Efficient dual methods for nonlinearly constrained networks. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 477–487. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. Mijangos, E.: Approximate subgradient methods for nonlinearly constrained network flow problems. Journal on Optimization Theory and Applications 128(1) (2006) (forthcoming)

    Google Scholar 

  10. Mijangos, E., Nabona, N.: The application of the multipliers method in nonlinear network flows with side constraints. Technical Report 96/10, Dept. of Statistics and Operations Research. Universitat Politècnica de Catalunya, 08028 Barcelona, Spain (1996), downloadable from website http://www.ehu.es/~mepmifee/

  11. Nedić, A., Bertsekas, D.P.: Incremental subgradient methods for nondifferentiable optimization. SIAM Journal on Optimization 12(1), 109–138 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  12. Poljak, B.T.: Minimization of unsmooth functionals. Z. Vyschisl. Mat. i Mat. Fiz. 9, 14–29 (1969)

    Google Scholar 

  13. Shor, N.Z.: Minimization methods for nondifferentiable functions. Springer, Heidelberg (1985)

    Google Scholar 

  14. Toint, P.L., Tuyttens, D.: On large scale nonlinear network optimization. Mathematical Programming 48, 125–159 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Statistics, and Operations Research, University of the Basque Country, P.O. Box 644, 48080, Bilbao, Spain

    Eugenio Mijangos

Authors
  1. Eugenio Mijangos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mijangos, E. (2006). A Variant of the Constant Step Rule for Approximate Subgradient Methods over Nonlinear Networks. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751595_80

Download citation

  • DOI: https://doi.org/10.1007/11751595_80

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34075-1

  • Online ISBN: 978-3-540-34076-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation