Skip to main content
SpringerLink
Log in

Simplicial Decomposition Algorithms

  • Reference work entry
Book cover Encyclopedia of Optimization

Article Outline

Keywords

See also

References

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

Access this chapter

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, NJ

    Google Scholar 

  2. Bazaraa MS, Sherali HD, Shetty CM (1993) Nonlinear programming: Theory and algorithms, 2nd edn. Wiley, New York

    MATH  Google Scholar 

  3. Bertsekas DP (1982) Constrained optimization and Lagrange multiplier methods. Acad. Press, New York

    MATH  Google Scholar 

  4. Bertsekas DP (1995) Nonlinear programming. Athena Sci., Belmont, MA

    MATH  Google Scholar 

  5. Cantor DG, Gerla M (1974) Optimal routing in a packet-switched computer network. JEEE Trans Computers c-23:1062–1069

    Article  MathSciNet  Google Scholar 

  6. Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8:101–111

    Article  MATH  Google Scholar 

  7. Djang A (1980) Algorithmic equivalence in quadratic programming. PhD Thesis Dept. Oper. Res. Stanford Univ

    Google Scholar 

  8. García R, Marín A, Patriksson M (1999) A class of column generation/simplicial decomposition algorithms in convex differentiable optimization. Techn. Report Dept. Math. Chalmers Univ. Technol., Gothenburg, Sweden

    Google Scholar 

  9. Hammond JH (1984) Solving asymmetric variational inequality problems and systems of equations with generalized nonlinear programming algorithms. PhD Thesis Dept. Math. Massachusetts Inst. Techn.

    Google Scholar 

  10. Hearn DW, Lawphongpanich S, Ventura JA (1985) Finiteness in restricted simplicial decomposition. Oper Res Lett 4:125–130

    Article  MathSciNet  MATH  Google Scholar 

  11. Hearn DW, Lawphongpanich S, Ventura JA (1987) Restricted simplicial decomposition: computation and extensions. Math Program Stud 31:99–118

    MathSciNet  MATH  Google Scholar 

  12. Holloway CA (1974) An extension of the Frank and Wolfe method of feasible directions. Math Program 6:14–27

    Article  MathSciNet  MATH  Google Scholar 

  13. Jones KL, Lustig IJ, Farvolden SM, Powell WB (1993) Multicommodity network flows: the impact of formulation on decomposition. Math Program 62:95–117

    Article  MathSciNet  Google Scholar 

  14. Larsson T, Migdalas A, Patriksson M (1994) A generic column generation scheme. Report Dept. Math. Linköping Inst. Techn. LiTH-MAT-R-94-18

    Google Scholar 

  15. Larsson T, Patriksson M (1992) Simplicial decomposition with disaggregated representation for the traffic assignment problem. Transport Sci 26:4–17

    Article  MATH  Google Scholar 

  16. Larsson T, Patriksson M, Rydergren C (1997) Applications of simplicial decomposition with nonlinear column generation to nonlinear network flows. In: Pardalos PM, Hager WW, Hearn DW (eds) Network Qptimization. Lecture Notes Economics and Math Systems. Springer, Berlin, pp 346–373

    Google Scholar 

  17. Larsson T, Patriksson M, Strömberg A-B (1997) Ergodic convergence in subgradient optimization. Report Dept. Math. Linköping Inst. Techn.

    Google Scholar 

  18. Lasdon LS (1970) Optimization theory for large systems. MacMillan, New York

    MATH  Google Scholar 

  19. Lawphongpanich S, Hearn DW (1984) Simplicial decomposition of the asymmetric traffic assignment problem. Transport Res 18B:123–133

    Article  MathSciNet  Google Scholar 

  20. Marín A (1995) Restricted simplicial decomposition with side constraints. Networks 26:199–215

    Article  MathSciNet  MATH  Google Scholar 

  21. Meyer GGL (1974) Accelerated Frank–Wolfe algorithms. SIAM J Control 12:655–663

    Article  MathSciNet  MATH  Google Scholar 

  22. Montero L (1991) A simplicial decomposition approach for solving the variational inequality formulation of the general traffic assignment problem for large scale networks. PhD Thesis Dept. d'Estadística i Invest. Oper. Fac. Inform. Univ. Politec. Catalunya, Barcelona

    Google Scholar 

  23. Mulvey JM, Zenlos SA, Ahlfeld DP (1990) Simplicial decomposition for convex generalized networks. J Inform Optim Sci 11:359–387

    MathSciNet  MATH  Google Scholar 

  24. Patriksson M (1994) The traffic assignment problem–models and methods. Topics in Transportation. VSP, Utrecht

    Google Scholar 

  25. Patriksson M (1998) Nonlinear programming and variational inequality problems–A unified approach. Applied Optim Kluwer, Dordrecht

    Google Scholar 

  26. Rookafellar RT (1970) Convex analysis. Princeton Univ. Press, Princeton

    Google Scholar 

  27. Smith MS (1983) An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function. Transport Res 17B:365–371

    Article  Google Scholar 

  28. Stefek D (1989) Extensions of simplicial decomposition for solving the multicommodity flow problem with bounded arc flows and convex costs. PhD Thesis Univ. Pennsylvania

    Google Scholar 

  29. Topkis DM, Veinott AF (1967) On the convergence of some feasible direction algorithms for nonlinear programming. SIAM J Control 5:268–279

    Article  MathSciNet  MATH  Google Scholar 

  30. Ventura SA, Hearn DW (1993) Restricted simplicial decomposition for convex constrained problems. Math Program 59:71–85

    Article  MathSciNet  Google Scholar 

  31. Von Hohenbalken B (1977) Simplicial decomposition in nonlinear programming algorithms. Math Program 13:49–68

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Math., Chalmers University Technol., Göteborg, Sweden

    Michael Patriksson

Authors
  1. Michael Patriksson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Patriksson, M. (2008). Simplicial Decomposition Algorithms . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_615

Download citation

Publish with us

Policies and ethics

Search

Navigation