По вашему запросу найдено документов: 60508
Страница 20 из 6051
Approximations of Evolutionary Inequality with Lipschitz-continuous Functional and Minimally Regular Input Data inequality with a linear bounded operator and a convex and Lipschitz-continuous functional are investigated
The method of multipliers for nonlinearly constrained variational inequalities and convex differentiable constraints is considered. We prove the convergence of the method with an arbitrary
Ultraproducts for State-Spaces of C*-Algebra and Radon Measures compact convex subset of a locally convex space is also investigated in the paper. As is well
A Cutting Method with Approximation of a Constraint Region and an Epigraph for Solving Conditional Minimization Problems for solving a convex programming problem. The developed method differs from traditional algorithms
Application of market models to network equilibrium problems decomposable optimization problem where the goal function is the sum of two functions and one of them is convex
АЛГОРИТМ ОТСЕЧЕНИЙ НА ОСНОВЕ ОДНОВРЕМЕННОЙ АППРОКСИМАЦИИ ДОПУСТИМОЙ ОБЛАСТИ И НАДГРАФИКА ЦЕЛЕВОЙ ФУНКЦИИPropose an algorithm for solving a convex programming problem. The algorithm belongs to the class
Radii of convexity and close-to-convexity of certain integral representations in the determination of radii of convexity and close-to-convexity of certain integral representations. © 1970
Descent method for monotone mixed variational inequalities mapping and a convex nondifferentiable function. We apply the Tikhonov-Browder regularization technique
Cutting-plane method with embedding of epigraphs of auxiliary functions© 2017 IEEE. We propose a method of conditional minimization of convex functions from the class
Convexity and star-shapedness of the level curves of polynomials polynomial is star-shaped or convex. © 1974 Consultants Bureau.
Страница 20 из 6051
Фасеты
Партнеры
Индексация
