30 search results - page 1 / 6 » A cutting plane method for solving KYP-SDPs |
AUTOMATICA
2008
13 years 5 months ago
2008
CCE
2005
13 years 4 months ago
2005
JOTA
2011
12 years 12 months ago
2011
: Nowadays, solving nonsmooth (not necessarily differentiable) optimization problems plays a very important role in many areas of industrial applications. Most of the algorithms d...
AUTOMATICA
2007
13 years 5 months ago
2007
ust control problems can be formulated in abstract form as convex feasibility programs, where one seeks a solution x that satisfies a set of inequalities of the form F . = {f (x,...
IPCO
2008
13 years 6 months ago
2008
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...