По вашему запросу найдено документов: 23363
Страница 20 из 2337
Dual approach for a class of implicit convex optimization problems as a generalization of a convex optimization problem under arbitrary right-hand side constraint
Levinson type inequalities for higher order convex functions via Abel–Gontscharoff interpolationIn this paper, Levinson type inequalities are studied for the class of higher order convex
Продолжение аналитических множеств в окрестность острия клина необщего положения sets A± ⊂ D± × C
compose a single analytic set in a neighborhood of the wedge K × C
Immobile Indices and CQ-Free Optimality Criteria for Linear Copositive Programming ProblemsWe consider problems of linear copositive programming where feasible sets consist of vectors
Immobile indices and CQ-free optimality criteria for Linear Copositive Programming problemsWe consider problems of linear copositive programming where feasible sets consist of vectors
Necessary optimality conditions without a priori normality assumptionsIn the linear space X with a given subset C⊂X set are the mappings F1: X→Rk 1, F2: X→Rk 2 and a
A version of the infinite-dimensional Borsuk-Ulam theorem for multivalued maps completely continuous multivalued maps with convex images which are defined on level sets of even functions
A variant of the multi-step bundle method by the set which is formed on the basis of the convex quadratic function. This method is characterized
Optimality Criteria without Constraint Qualifications for Linear Semidefinite ProblemsWe consider two closely related optimization problems: a problem of convex semi
Investigation of regularity conditions in optimal control problems with geometric mixed constraints general geometric type, in which a closed non-convex constraint set appears.Aclosely related question
Страница 20 из 2337
Фасеты
Партнеры
Индексация
