Материалов:
1 005 012

Репозиториев:
30

Авторов:
761 409

По вашему запросу найдено документов: 60508

Страница 28 из 6051

Variant of the cutting plane method with approximation of the set of constraints and auxiliary functions epigraphs
of solving a convex programming problem, which is based on the ideas of cutting plane methods and the method

A minimization algorithm with approximation of an epigraph of the objective function and a constraint setCopyright © by the paper's authors.An algorithm is suggested for solving a convex programming

Immobile indices in linear Semi-infinite and Copositive Programming of the linear copositive problem in the form of a convex SIP problem and basing on the immobile indices

Immobile indices and CQ-free optimality criteria for Linear Copositive Programming problemsWe consider problems of linear copositive programming where feasible sets consist of vectors

Topological methods for some classes of differential variational inequalitiesIn this paper the topological methods are applied to study various problems for some classes

Stability Analysis for Composite Optimization Problems and Parametric Variational Systems stability of parametric variational systems with convex piecewise linear potentials. © 2016, Springer

Implicit-function theorem on the cone in a neighborhood of an irregular pointConvex cone

Refinements and generalizations of majorization, favard and berwald-type inequalities via fink identityN-convex function

Strictly flat cyclic Frechet modules and approximate identitiesLet A be a locally m-convex Frechet algebra. We give a necessary and sufficient condition for a

Fejer algorithms with an adaptive stepconvex optimization

Страница 28 из 6051