All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

-
19002100

Join usingOrAnd

Join usingOrAnd

SelectAll/None
  • Show more

SelectAll/None
  • Show more

      • Show less

      • Show less

      • Show less

      • Show less

    • Show more

SelectAll/None
  • Show more

More filters

Results

34 036 results (0,427s)

Result

Optimal design of trusses under a nonconvex global buckling constraint.

We propose a novel formulation of a truss design problem involving a constraint on the global stability of the structure due to the linear buckling phenomenon. The optimizatin problem is modelled as a nonconvex semidefinite prog...

BA - Obecná matematika

  • 2000
  • Jx
Result

Solving nonconvex SDP problems of structural optimization with stability control

The goal of this paper is to formulate and solve structural optimization problems with constraints on the global stability of the structure. The stability constraint is based on the linear buckling phenomenon. We formulate the problem as a noncon...

BA - Obecná matematika

  • 2004
  • Jx
Result

Finding largest small polygons with GloptiPoly

largest small polygons can be formulated as nonconvex quadratic pro- gramming problems that a recentlydeveloped technique for global polynomial optimization, based on a semideFinite programming approach to the generalized ...

BC - Teorie a systémy řízení

  • 2010
  • O
Result

Semidefinite approximations of the polynomial abscissa

approximations are computed by a hierarchy of finite-dimensional convex semidefinite programming problems. When their degree tends to infinity, the polynomial approximations......

BA - Obecná matematika

  • 2016
  • Jx
  • Link
Result

Finding largest small polygons with GloptiPoly

optimization, based on a semidefinite programming approach to the generalized problem remain open. Finding those largest small polygons can be formulated as nonconvex quadratic programming problems which can chall...

BA - Obecná matematika

  • 2013
  • Jx
  • Link
Result

Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design

. The algorithm is based on Gloptipoly 3, a public-domain Matlab pack- age solving nonconvex polynomial optimization problems with the help of convex semidefinite programmingWe describe an elementary algorithm to build conv...

BC - Teorie a systémy řízení

  • 2010
  • D
Result

Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design

. The algorithm is based on Gloptipoly 3, a publicdomain Matlab package solving nonconvex polynomial optimisation problems with the help of convex semidefinite programmingWe describe an elementary algorithm to build convex ...

BC - Teorie a systémy řízení

  • 2012
  • Jx
  • Link
Result

Coarse-convex-compactification approach to numerical solution of nonconvex variational problems

convex semidefinite program can be solved by efficient specialized mathematical-programming solvers. This method is justified by convergence analysis and eventually......

BA - Obecná matematika

  • 2010
  • Jx
Result

GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi.

GloptiPoly is a Matlab/SeDuMi add-on to build and solve convex linear matrix inequality relaxations of the (generally nonconvex) global optimization problem of miminizing a multivariable polynomial function subject to polynomial inequality, ...

BC - Teorie a systémy řízení

  • 2003
  • Jx
Result

Hermite matrix in Lagrange basis for scaling static output feedback polynomial matrix inequalities

Using Hermite's formulation of polynomial stability conditions, static output feedback (SOF) controller design can be formulated as a polynomial matrix inequality (PMI), a (generally nonconvex) nonlinear semidefinite programming...

BC - Teorie a systémy řízení

  • 2011
  • O
  • 1 - 10 out of 34 036