Mean value cross decomposition for nonlinear convex problems

Optimization Methods and Software

Volumn 21, Issue 3, 2006, Pages 401-417

  Holmberg, Kaj ^a   Kiwiel, Krzysztof C ^b  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

^b SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Decomposition methods; Large scale nonlinear programming; Mathematical programming

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

LINEAR PROBLEMS; MEAN VALUE CROSS DECOMPOSITION; NETWORK ROUTING;

NONLINEAR SYSTEMS;

EID: 30944451402     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780500098565     Document Type: Article

References (23)

1. Holmberg, K., 1992, Linear MVC decomposition: A generalization of the Kornai-Liptak method. European Journal of Operational Research, 62, 55-73.
2. Holmberg, K., 1994, A convergence proof for linear MVC decomposition. Zeitschrift für Operations Research, 39, 157-186.
3. Brown, G.W., 1949, Some notes on computation of games solutions. Technical Report RAND Report P-78, The RAND Corporation.
4. Robinson, J., 1951, An iterative method of solving a game. Annals of Mathematics, 54, 296-301.
5. Kornai, J. and Liptak, T., 1965, Two-level planning. Econometrica, 33, 141-169.
6. Holmberg, K., 1997, MVC decomposition applied to integer programming problems. European Journal of Operational Research, 97, 124-138.
7. Holmberg, K., 1995, Efficient decomposition and linearization methods for the stochastic transportation problem. Computational Optimization and Applications, 4, 293-316.
8. Holmberg, K. and Jörnsten, K., 1996, Solving the generalized knapsack problem with variable coefficients. Naval Research Logistics, 43, 673-689.
9. Holmberg, K., 1991, Nonlinear MVC decomposition: The strictly convex case, Working Paper LiTH-MAT/OPT-WP-1991-15, Division of Optimization, Department of Mathematics, Linköping Institute of Technology, Sweden.
10. Vlahos, K., 1991, Convergence proof for MVC decomposition applied to convex problems. Research paper, Decision Science Group, London Business School, England.
11. Van Roy, T.J., 1983, Cross decomposition for mixed integer programming. Mathematical Programming, 25, 46-63.
12. Geoffrion, A.M., 1974, Lagrangean relaxation for integer programming. Mathematical Programming Study, 2, 82-114.
13. Beasley, J.E., 1993, Lagrangean heuristics for location problems, European Journal of Operational Research, 65, 383-399.
14. Rockafellar, R.T., 1970, Convex Analysis (Princeton, New Jersey: Princeton University Press).
15. Geoffrion, A.M., 1972, Generalized Benders decomposition. Journal on Optimization Theory and Applications, 10, 237-260.
16. Belenky, V.Z., Ivankov, S.A. and Volkonsky, V.A., 1976, On a certain approach to the investigation of the convergence of iterative processes. In: J. Łoś and M.W. Łoś (Eds) Computing Equilibria: How and Why (Proc. Internat. Conf., Comput. Centre, Polish Acad. Sci., Toruń, 8-13 July, 1974) (Amsterdam: North-Holland), pp. 225-247.
17. Cooper, L. and LeBlanc, L.J., 1977, Stochastic transportation problems and other network related convex problems. Naval Research Logistics Quarterly, 24, 327-336.
18. LeBlanc, L.J., 1977, A heuristic approach for large scale discrete stochastic transportation-location problems. Computers and Mathematics with Applications, 3, 87-94.
19. Holmberg, K. and Tuy, H., 1999, A production-transportation problem with stochastic demand and concave production costs. Mathematical Programming, 85, 157-179.
20. Fourer, R., Gay, D.M. and Kernighan, B.W., 1993, AMPL:A Modeling Language for Mathematical Programming (The Scientific Press, Boyd and Fraser).
21. Murtagh, B.A. and Saunders, M.A., 1998, MINOS User's Guide. Stanford University.
22. ILOG, 1999, ILOG CPLEX User's Manual, Version 6.5.
23. Holmberg, K., 2001, Experiments with primal-dual decomposition methods and subgradient methods for the uncapacitated facility location problem. Optimization, 49, 495-516.