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

8 582 (0,172s)

Result

Quadratic programming with separable convex constraints and solving of 3D contact problems with friction

The paper deals with a method for numerical minimization of convex functions with separable convex constraints. Applications to 3D contact problems with friction are shown....

BA - Obecná matematika

  • 2006
  • D
Result

Convergence of generalized entropy minimizers in sequences of convex problems

Integral functionals based on convex normal integrands are minimized over convex constraint sets. Generalized minimizers exist under a boundedness condition. Sequences of the minimization problems are studied when the c...

BA - Obecná matematika

  • 2016
  • D
  • Link
Result

Convex programming with separable ellipsoidal constraints: application in contact problems with orthotropic friction

The algorithm for constrained minimization of strictly convex quadratic functions subject to simple bounds and separable ellipsoidal constraints is used for numerical solution of discretized 3D contact problems with orthotropic fric...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

Generalized minimizers of convex integral functionals and Pythagorean identities

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The effective domain of the value function is described by a modification of the concept of convex core. The ...

BD - Teorie informace

  • 2013
  • D
  • Link
Result

Minimization of Entropy Functionals Revisited

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are assumed to be strictly convex by a modification of the concept of convex core. Th...

BA - Obecná matematika

  • 2012
  • D
  • Link
Result

Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are finite on the positive and infinite on the negative numbers, strictly convex but not neces...

BA - Obecná matematika

  • 2012
  • Jx
Result

Semidefinite programming for optimizing convex bodies under width constraints

We consider the problem of minimizing a functional (such as the area, perimeter and surface) within the class of convex bodies whose support functions are trigonometric polynomials. The convexity constraint is transformed v...

BA - Obecná matematika

  • 2012
  • Jx
  • Link
Result

Convergence rate of an optimization algorithm for minimizing quadratic functions with separable convex constraints

A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with gradient projections. It generalizes recently developed algorithms of quadra...

BA - Obecná matematika

  • 2008
  • Jx
Result

Convex Programming with Separable Elllipsoidal Constraints: Application in Contact Problems with Orthotropic Friction

The chapter deals with a newly developed algorithm for constrained optimization of strictly convex quadratic functions with separable ellipsoidal constraints. The algorithm is used for numerical solution of 3D contact problems with ...

BA - Obecná matematika

  • 2014
  • C
Result

Convexity of Models with Directional Distortional Hardening and its Computational Implication

Explicit constraints on elastic-plastic material parameters were derived to guarantee computional model´s convexity in the presence of directional distortional hardening....

JJ - Ostatní materiály

  • 2009
  • D
  • 1 - 10 out of 8 582