По вашему запросу найдено документов: 60508
Страница 4 из 6051
CONTROLLABILITY OF LINEAR HYBRID SYSTEMS WITH A FINITE NUMBER OF TIME INTERVALS, developing a method of solving the control problem with the help of linear hybrid systems. A mathematical
Алгоритм определения неподвижных индексов в выпуклых задачах полубесконечного программирования с многогранным множеством индексов алгоритма. The convex Semi-Infinite Programming (SIP) problems with polyhedral index sets
On generalization of refinement of Jensen’s inequality using Fink’s identity and Abel-Gontscharoff Green function for the ‘two-point right focal’ problem. We use Fink’s identity and a new Abel-Gontscharoff-type Green’s
Solution method for monotone mixed variational inequalities regularization and a descent technique over a gap (merit) function. The same uniformly convex auxiliary function
Gradient methods with regularization for constrained optimization problems and their complexity estimates modifications of conditional gradient and gradient projection methods for smooth convex optimization problems
Limit extremum problemLimit extremum problem
Solving of a projection problem for convex polyhedra given by a system of linear constraints to further reducing the PPP to the problem of projecting the origin onto the convex hull of some vectors
Comporable functionals of convex domainsComporable functionals of convex domains
One special SIP problem arising in parametric convex SIP ProgrammingWe consider a SIP problem of a special form pos-sessing some special properties. We show how
A minimization method with approximation of feasible set and epigraph of objective function© 2016, Allerton Press, Inc.For a convex programming problem we propose a solution method which
Страница 4 из 6051
Фасеты
Партнеры
Индексация
