Mean value cross decomposition for nonlinear convex problems

DOI10.1080/10556780500098565zbMath1136.90433OpenAlexW2053757987MaRDI QIDQ5475282

Kaj Holmberg, Krzysztof C. Kiwiel

Publication date: 16 June 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780500098565

zbMATH Keywords

decomposition methodsmathematical programminglarge-scale nonlinear programming

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems, A pricing mechanism for resource management in grid computing, Fast inexact decomposition algorithms for large-scale separable convex optimization

Uses Software

• AMPL
• CPLEX

Cites Work

• Unnamed Item
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
• A heuristic approach for large scale discrete stochastic transportation- location problems
• Mean value cross decomposition applied to integer programming problems
• A production-transportation problem with stochastic demand and concave production costs
• Lagrangean heuristics for location problems
• Efficient decomposition and linearization methods for the stochastic transportation problem
• Generalized Benders decomposition
• An iterative method of solving a game
• Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
• Stochastic transportation problems and other newtork related convex problems
• Cross decomposition for mixed integer programming
• Two-Level Planning
• Convex Analysis
• Solving the generalized knapsack problem with variable coefficients