.png){kind=icon}
返回
Indefinite multi-constrained separable quadratic optimization: Large-scale efficient solution
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2019.04.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Multi-constrained indefinite separable quadratic optimization occurs in many practical applications. However, it is an NP-hard problem and its solution even for problems of moderate size is computationally tedious. Extending our previous work on singly constrained problems, we develop the necessary theory and computational procedures for problems with multiple linear constraints, by employing iterative constraint aggregation, known as surrogation. The surrogate dual solution is obtained using a cutting plane technique over the multiplier search space, which then is used to develop a monotonic sequence of upper bounds that yields a near-global optimal solution. A detailed numerical analysis indicates the method is extremely efficient for quadratic programs with hundreds of thousands of variables. While the number of constraints affects the computational efficiency, it is still an order of magnitude superior, both in speed and quality, compared to leading commercial global optimization software. Preliminary results with application to mixed integer quadratic indefinite optimization further reveal the performance superiority of the proposed methodology relative to the standard techniques. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Nonlinear programming
Large scale optimization
Integer programming
Global optimization
Constraint aggregation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏AN EXACT SEARCH FOR THE SOLUTION OF THE SURROGATE DUAL OF THE 0-1 BIDIMENSIONAL KNAPSACK-PROBLEM0-1二维背包问题的代理对偶解的精确搜索
PREAI
分享收藏
分享收藏
查看更多内容