An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application

• 成果类型: Article
• 署名作者: Oskoorouchi, Mohammad R.; Ghaffari, Hamid R.; Terlaky, Tamas; Aleman, Dionne M.
• 署名单位: California State University System; California State University San Marcos; University of Toronto; Lehigh University
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.1110.0951
• 发表日期: 2011
• 页码: 1184-1197
• 关键词: cutting-plane method; convex feasibility problem; complexity analysis; deep cuts; DECOMPOSITION

摘要

We propose an interior point constraint generation (IPCG) algorithm for semi-infinite linear optimization (SILO) and prove that the algorithm converges to an epsilon-solution of SILO after a finite number of constraints is generated. We derive a complexity bound on the number of Newton steps needed to approach the updated mu-center after adding multiple violated constraints and a complexity bound on the total number of constraints that is required for the overall algorithm to converge. We implement our algorithm to solve the sector duration optimization problem arising in Leksell Gamma Knife (R) Perfexion (TM) (Elekta, Stockholm Sweden) treatment planning, a highly specialized treatment for brain tumors. Using real patient data provided by the Department of Radiation Oncology at Princess Margaret Hospital in Toronto, Ontario, Canada, we show that our algorithm can efficiently handle problems in real-life health-care applications by providing a quality treatment plan in a timely manner. Comparing our computational results with MOSEK, a commercial software package, we show that the IPCG algorithm outperforms the classical primal-dual interior point methods on sector duration optimization problem arising in Perfexion (TM) treatment planning. We also compare our results with that of a projected gradient method. In both cases we show that IPCG algorithm obtains a more accurate solution substantially faster.