Mean value cross decomposition for nonlinear convex problems

DOI10.1080/10556780500098565MaRDI QIDQ5475282zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg, Krzysztof C. Kiwiel

Publication date 16 June 2006

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

zbMATH Keywords

decomposition methodslarge-scale nonlinear programmingmathematical programming

Mathematics Subject Classification ID

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

Recommendations

• On the convergence of cross decomposition
• A convergence proof for linear mean value cross decomposition
• Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
• Mean value cross decomposition applied to integer programming problems
• scientific article; zbMATH DE number 176467

Cites work

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

Cited in

(5)

• Fast inexact decomposition algorithms for large-scale separable convex optimization
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
• A convergence proof for linear mean value cross decomposition
• On the convergence of cross decomposition
• A pricing mechanism for resource management in grid computing

Describes a project that uses

Uses Software

• AMPL
• CPLEX

This page was built for publication: Mean value cross decomposition for nonlinear convex problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475282)