检索结果-内蒙古大学图书馆

21st IFAC World Congress on Automatic Control - Meeting Societal Challenges

作者： Chamanbaz, Mohammadreza Bouffanais, Roland Singapore Univ Technol & Design Singapore 487372 Singapore

In this paper, we propose a computationally efficient algorithm for solving mixed-integer sampled optimization problems involving a large number of constraints. The proposed algorithm has a sequential nature. Specifically, at each iteration of the algorithm, the feasibility of a candidate solution is verified for all the constraints involved in the sampled optimization problem and violating constraints are identified. As a second step, an optimization problem is formed whose constraint set involves the current basis the minimal set of constraints defining the current candidate solution and a limited number of the observed violating constraints. We prove that the algorithm converges to the optimal solution in finite time. Additionally, we establish the effectiveness of the proposed algorithm using mixed-integer linear, and quadratically constrained quadratic programming problems. Copyright (C) 2020 The Authors.

关键词： sampled optimization problems Sequential algorithm Large-scale optimization

来源：评论

学校读者我要写书评

暂无评论

A Sequential Algorithm for sampled Mixed-integer optimization problems ⁎

引用

IFAC-PapersOnLine 2020年第2期53卷 6749-6755页

作者： Mohammadreza Chamanbaz Roland Bouffanais Singapore University of Technology and Design Singapore 487372

In this paper, we propose a computationally efficient algorithm for solving mixed-integer sampled optimization problems involving a large number of constraints. The proposed algorithm has a sequential nature. Specifically, at each iteration of the algorithm, the feasibility of a candidate solution is verified for all the constraints involved in the sampled optimization problem and violating constraints are identified. As a second step, an optimization problem is formed whose constraint set involves the current basis—the minimal set of constraints defining the current candidate solution—and a limited number of the observed violating constraints. We prove that the algorithm converges to the optimal solution in finite time. Additionally, we establish the effectiveness of the proposed algorithm using mixed-integer linear, and quadratically constrained quadratic programming problems.

关键词： sampled optimization problems Sequential algorithm Large-scale optimization

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：