An Inner Convex Approximation Algorithm for BMI Optimization and Applications in Control

Moritz Diehl; Quoc Tran Dinh; Wim Michiels

arxiv: 1202.5488 · v1 · pith:MQQHOBDRnew · submitted 2012-02-24 · 🧮 math.OC

An Inner Convex Approximation Algorithm for BMI Optimization and Applications in Control

Quoc Tran Dinh , Wim Michiels , Moritz Diehl This is my paper

classification 🧮 math.OC

keywords nonconvexalgorithmapplicationscontrolconvexinnerlocaloptimization

0 comments

read the original abstract

In this work, we propose a new local optimization method to solve a class of nonconvex semidefinite programming (SDP) problems. The basic idea is to approximate the feasible set of the nonconvex SDP problem by inner positive semidefinite convex approximations via a parameterization technique. This leads to an iterative procedure to search a local optimum of the nonconvex problem. The convergence of the algorithm is analyzed under mild assumptions. Applications in static output feedback control are benchmarked and numerical tests are implemented based on the data from the COMPLeib library.

This paper has not been read by Pith yet.

discussion (0)

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

Robust Distributed Sub-Optimal Coordination of Linear Agents with Uncertain Input Nonlinearities
eess.SY 2026-04 unverdicted novelty 4.0

A novel robust control protocol ensures linear agents with sector-bounded input nonlinearities converge to a neighborhood of the global optimizer, with solvability conditions given as matrix inequalities.