All

What are you looking for?

All
Projects
Results
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

52 208 (0,305s)

Result

On optimality conditions of relaxed non-convex variational problem

The paper studies optimality conditions for relaxed non-convex variational problems.

BA - Obecná matematika

  • 2004
  • Jx
Result

Higher-order convex approximations of Young measures in optimal control.

Higher-order convex approximations of Young measures in optimal control are scrutinized.

BA - Obecná matematika

  • 2003
  • Jx
Result

A Sequential Convex Semidefinite Programming Algorithm for Multiple-Load Free Material Optimization

A new method for the efficient solution of a class of convex semidefinite programming problems is introduced. The method extends the sequential convex programming (SCP) concept to optimization problems with matrix variables...

BA - Obecná matematika

  • 2009
  • Jx
Result

Semidefinite programming for optimizing convex bodies under width constraints

and surface) within the class of convex bodies whose support functions are trigonometric polynomials. The convexity constraint is transformed via the Fejér-Riesz theorem promising to investigate more difficult optimization...

BA - Obecná matematika

  • 2012
  • Jx
  • Link
Result

On the Limitation of Convex Optimization for Sparse Signal Segmentation

We show that convex optimization methods have fundamental properties that complicate performing signal segmentation based on sparsity assumptions. We review the recently introduced overcomplete sparse segmentation model, we perform ...

Electrical and electronic engineering

  • 2016
  • D
  • Link
Result

Piecewise-polynomial signal segmentation using proximal splitting convex optimization methods

We show how the problem of segmenting noisy piecewise polynomial signal can be formulated as a convex optimization task. Because the number of model changes in signal of sparsity and its convex-relaxed counterpart, the l1-n...

Electrical and electronic engineering

  • 2016
  • O
  • Link
Result

Nonlinear optimization for economists

Basic themes of document: nonlinear optimization problem; convex function; KKT conditions; solving methods; economic and financial applications......

BB - Aplikovaná statistika, operační výzkum

  • 2009
  • B
Result

Fundamental Bounds on Cloaking Based on Convex Optimization

A convex optimization framework over contrast current density is developed to calculate fundamental bounds on the performance of linear passive cloaks. The formulation uses the method of moments applied to the electric field integra...

Electrical and electronic engineering

  • 2021
  • D
  • Link
Result

Optimization model with nonconvex monotone piecewise linear objective function

The paper describes new approach to solution of some optimization models with non-convex piecewise linear objective function with monotone course. The matter of non-convexity complicates searching for an optimal so...

BB - Aplikovaná statistika, operační výzkum

  • 2015
  • D
Result

Convexity and level sets for interval-valued fuzzy sets

Convexity is a deeply studied concept since it is very useful in many fields of mathematics, like optimization. When we deal with imprecision, the convexity is required as well and some important applications can be found f...

Applied mathematics

  • 2022
  • Jimp
  • Link
  • 1 - 10 out of 52 208