Minimum of convex functionsQuasiconvexityRelaxed energyLet Ω be a smooth bounded domain of n . Then the paper is concerned with minimization problems of the form α=inf∫ Ω min{f(v,Dv),g(v,Dv)}dx:v∈H 1 (Ω; m ), under the assumption that the two integral functionals v→∫Ω f...
CONVEX TRANSLATES 1:00:05 FLOER-THEORETIC FILTRATION OF PAINLEVÉ HITCHIN SPACES 1:14:25 CROSSING NUMBERS OF CROSSING-CRITICAL GRAPHS 1:00:15 CANONICAL RESULTS IN RAMSEY THEORY 1:03:39 ALMOST OPTIMAL PACKINGS OF EQUAL SPHERES IN DIMENSIONS 8 AND 24 1:31:23 IDEAL-THEORETIC STUDY OF CRITICAL ...
For the case of a differentiable objective function, we establish sufficient conditions for a local minimum, including a "strong" stationarity condition and indicate the radius of the corresponding neighborhood. 展开 关键词: strongly quasiconvex function strongly and weakly convex sets and functions ...
aa positive constant multiple of a convex function and a sum of two convex functions are convex. 一个凸函数的一个正面恒定的倍数和二个凸函数的一个总和凸面。[translate] abee propolis 蜂propolis[translate] aabout You 怎样您[translate] aHello when would you be able to ship this item? I need...
摘要: The Memorandum employs an algorithm for solving minimum-cost flow problems where the shipping cost over an arc is a convex function of the number of units shipped along that arc. This technique provides a unified way of looking at many seemingly unr......
functionsmaximum principleminimum principleRadon transformsset theory/ convexificationnonconvex functionsThis note, through discussing convexification of functions on any sets, extends Stegall's maximum principle to nonconvex sets, and generalizes Ghoussoub-Maurey's principle of dual spaces....
the conjecture is also true when any one of local optimal solutions is reached in helping to investigating convex-concave programming on a polyhedral set... Xu,Lei - 《Neural Computation》 被引量: 32发表: 2007年 A finite method for globally minimizing concave functions over unbounded polyhedral...
the minimum modulus of integral functions of small order 1 In this study we extend the Hadamard's type inequalities for convex functions defined on the minimum modulus of integral functions in complex field. Firstl... PD Barry 被引量: 0发表: 2017年 ...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allow real-valued upper bounds and convex and differentiable cost functions for the flows on arcs. In this paper, we present an efficient algorithm to solve such a large class of minimum cost flow...
if \(h(0)= h(T)=0\). So, as has been claimed, Theorem 2.1 is a working second order necessary condition specific for problems with integrands non-convex as functions of the last argument.Notes This makes the main difference with the example considered in [2] References Bogolyubov, N....