Safe Bounds in Semidefinite Programming by Using Interval Arithmetic

• 作者: Ahmed Lehireche Orkia Derkaoui
• 来源期刊: 美国运筹学期刊(英文)
• 学科: 数学
• 关键词: SEMIDEFINITE Programming INTERVAL ARITHMETIC Rigorous Error BOUNDS SDPA SOLVER Branch and BOUND Algorithm
• 年，卷（期）: mgycxqkyw_2014,（5）
• 页码范围: 293-300
• 页数: 8页
• 分类号: O1

摘要

Efficient solvers for optimization problems are based on linear and semidefinite relaxations that use floating point arithmetic. However, due to the rounding errors, relaxation thus may overestimate, or worst, underestimate the very global optima. The purpose of this article is to introduce an efficient and safe procedure to rigorously bound the global optima of semidefinite program. This work shows how, using interval arithmetic, rigorous error bounds for the optimal value can be computed by carefully post processing the output of a semidefinite programming solver. A lower bound is computed on a semidefinite relaxation of the constraint system and the objective function. Numerical results are presented using the SDPA (SemiDefinite Programming Algorithm), solver to compute the solution of semidefinite programs. This rigorous bound is injected in a branch and bound algorithm to solve the optimisation problem.