A probabilistic ellipsoid algorithm for linear optimization problems with uncertain LMI constraints

• Autores: Armin Ataei, Qian Wang
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Nº. 52, 2015, págs. 248-254
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • In this paper, a probabilistic algorithm based on the deep cut ellipsoid method is proposed to solve a linear optimization problem subject to an uncertain linear matrix inequality (LMI). First, a deep cut ellipsoid algorithm is introduced to address probabilistic feasibility of the uncertain LMI. Objective cuts are then defined to search for the optimal solution. The final probabilistic ellipsoid algorithm is a combination of feasibility cuts and objective cuts. It is shown that in a finite number of iterations, the ellipsoid algorithm either returns a suboptimal probabilistically feasible solution with a high confidence level or finds the problem infeasible. Furthermore, the bounds of the suboptimal value are provided with probabilistic guarantees.