arrow
返回

Outer approximation with conic certificates for mixed-integer convex problems

delete2020-02-20
delete32
delete
OA
AI
C
Coey, Chris *
L
Lubin, Miles
V
Vielma, Juan Pablo
DOI:10.1007/s12532-020-00178-3delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
A mixed-integer convex (MI-convex) optimization problem is one that becomes convex when all integrality constraints are relaxed. We present a branch-and-bound LP outer approximation algorithm for an MI-convex problem transformed to MI-conic form. The polyhedral relaxations are refined with kappa* cuts derived from conic certificates for continuous primal-dual conic subproblems. Under the assumption that all subproblems are well-posed, the algorithm detects infeasibility or unboundedness or returns an optimal solution in finite time. Using properties of the conic certificates, we showthat the kappa* cuts imply certain practically-relevant guarantees about the quality of the polyhedral relaxations, and demonstrate how to maintain helpful guarantees when the LP solver uses a positive feasibility tolerance. We discuss how to disaggregate kappa* cuts in order to tighten the polyhedral relaxations and thereby improve the speed of convergence, and propose fast heuristic methods of obtaining useful kappa* cuts. Our new open source MI-conic solver Pajarito (github.com/JuliaOpt/Pajarito.jl) uses an external mixed-integer linear solver to manage the search tree and an external continuous conic solver for subproblems. Benchmarking on a library of mixed-integer second-order cone (MISOCP) problems, we find that Pajarito greatly outperforms Bonmin (the leading open source alternative) and is competitive with CPLEX's specialized MISOCP algorithm. We demonstrate the robustness of Pajarito by solving diverse MI-conic problems involving mixtures of positive semidefinite, second-order, and exponential cones, and provide evidence for the practical value of our analyses and enhancements of kappa* cuts.
Keyword:
EXTENDED FORMULATIONS
OPTIMIZATION
FRAMEWORK
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Mathematical Programming Computation 封面图
Mathematical Programming Computation
IF:
3.6
论文数:
199
被引数:
1.9K

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
The Hierarchical Structure of the Face Network Revealed by Its Functional Connectivity Pattern
err2016-01-20
err0
errOAAI
errXu Wang; Zonglei Zhen; Yiying Song; Lijie Huang; Xiangzhen Kong; Jia Liu
err分享
err收藏
An algorithmic framework for convex mixed integer nonlinear programs
err2008-05-01
err0
errOAAI
errPierre Bonami; Lorenz T. Biegler; Andrew R. Conn; Gérard Cornuéjols; Ignacio E. Grossmann; Carl D. Laird; Jon Lee; Andrea Lodi; François Margot; Nicolas Sawaya; Andreas Wächter
err分享
err收藏
Mixed-integer nonlinear optimization
err2013-04-02
err508
PREAI
errBelotti, Pietro; Kirches, Christian; Leyffer, Sven; Linderoth, Jeff; Luedtke, James; Mahajan, Ashutosh
err分享
err收藏
Julia: A Fresh Approach to Numerical Computing朱莉娅: 一种新的数值计算方法
err2017-01-01
err3.6K
errOAAI
errBezanson, Jeff; Edelman, Alan; Karpinski, Stefan; Shah, Viral B.
err分享
err收藏
学者 查看更多内容