Improving the Decomposition of Partially Separable Functions in the Context of Large-scale Optimization: a Rst Approach
نویسنده
چکیده
This paper examines the question of modifying the decomposition of a partially separable function in order to improve computational eciency of large-scale minimization algorithms using a conjugate-gradient inner iteration. The context and motivation are given and the application of a simple strategy discussed on examples extracted from the CUTE test problem collection.
منابع مشابه
Competitive Island-Based Cooperative Coevolution for Efficient Optimization of Large-Scale Fully-Separable Continuous Functions
In this paper, we investigate the performance of introducing competition in cooperative coevolutionary algorithms to solve large-scale fully-separable continuous optimization problems. It may seem that solving large-scale fully-separable functions is trivial by means of problem decomposition. In principle, due to lack of variable interaction in fullyseparable problems, any decomposition is viab...
متن کاملA Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem
Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...
متن کاملA limited memory adaptive trust-region approach for large-scale unconstrained optimization
This study concerns with a trust-region-based method for solving unconstrained optimization problems. The approach takes the advantages of the compact limited memory BFGS updating formula together with an appropriate adaptive radius strategy. In our approach, the adaptive technique leads us to decrease the number of subproblems solving, while utilizing the structure of limited memory quasi-Newt...
متن کاملA Hybrid MOEA/D-TS for Solving Multi-Objective Problems
In many real-world applications, various optimization problems with conflicting objectives are very common. In this paper we employ Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D), a newly developed method, beside Tabu Search (TS) accompaniment to achieve a new manner for solving multi-objective optimization problems (MOPs) with two or three conflicting objectives. This i...
متن کاملA Compromise Decision-making Model for Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on the technique for order preference through similarity ideal solution (TOPSIS) methodology, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. This compromise programming method is ba...
متن کامل