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”
EN
ČeštinaEnglish

Filters

-
19912025

Join usingOrAnd

Join usingOrAnd

SelectAll/None

    • Show more

SelectAll/None

    • Show more

        • Show more

        • Show more

        • Show more

        • Show more

      • Show more

SelectAll/None

    • Show more

More filters

Results

35 131 results (0,21s) •

Result

On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature

for the solution of convex QPQC problems with elliptic and other separable constraints the projected gradient path to separable constraints with elliptic components, and plug them into the existing algori...

BA - Obecná matematika

  • 2014
    • •
  • Jx
    • •
  • Link
Result

Optimal iterative QP and QPQC algorithms

of the constraints. When applied to the class of convex QP or QPQC problems with the spectrum for the minimization of a strictly convex quadratic function subject to separable convex inequality constraints and/or ...

BA - Obecná matematika

  • 2013
    • •
  • Jx
    • •
  • Link
Result

Separable Spherical Constraints and the Decrease of a Quadratic Function in the Gradient Projection Step

constraints are valid for more general feasible sets including those defined by separable spherical constraints. The result is useful for the development of in a sense optimal algorithms for the solution of some QPQC

BA - Obecná matematika

  • 2013
    • •
  • Jx
    • •
  • Link
Result

An Optimal Algorithm with Barzilai-Borwein Steplength and Superrelaxation for QPQC Problem

We propose a modification of MPGP algorithm for solving minimizing problem of strictly convex quadratic function subject to separable spherical constraints steplength. We show how to use the algorithm for the solution of separab...

BA - Obecná matematika

  • 2013
    • •
  • D
    • •
  • Link
Result

An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications

of a strictly convex quadratic function subject to separable convex constraints. Our active also show how to use the algorithm for the solution of separable and equality constraints. The power of our algorithm and...

BA - Obecná matematika

  • 2012
    • •
  • Jx
    • •
  • Link
Result

A Note on Optimization Problems with Additively Separable Objective Function and Max-Separable Constraints

A class of optimization problems with additively separable optimization objective function and max-separable constraints is considered. The problem is reduced to a problem of a smaller size and then reformulated as a set co...

BA - Obecná matematika

  • 2008
    • •
  • Jx
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

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

Solution of Some max-separable optimization problems with inequality constraints.

Optimization problems with a max-separable objective function f(x)= max {f_j(x_j); j = 1,..., n}, and m inequality constraints with max-separable functions r_i(x) g.e. s_i(y) (i = 1, ..., m) are considered. It is assumed th...

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

  • 2005
    • •
  • 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
  • 1 - 10 out of 35 131