期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
抛物型Monge-Ampère方程广义解的存在惟一性 被引量:1
1
作者 陈丽 《吉林大学自然科学学报》 CSCD 2000年第4期1-9,共9页
证明抛物型 Monge-Ampère方程第一初边值问题 -utdet uxx=f于 Q=Ω× ( 0 ,T] ,u=φ于 p Q广义解的存在惟一性 ,这里 Ω为Rn中的有界凸集 ,f 非负有界可测 ,φ( x,t) =ψ( x)+A( t) x+B( t) ,其中ψ( x)∈ C(Ω)凸 , x0 ∈ ... 证明抛物型 Monge-Ampère方程第一初边值问题 -utdet uxx=f于 Q=Ω× ( 0 ,T] ,u=φ于 p Q广义解的存在惟一性 ,这里 Ω为Rn中的有界凸集 ,f 非负有界可测 ,φ( x,t) =ψ( x)+A( t) x+B( t) ,其中ψ( x)∈ C(Ω)凸 , x0 ∈ Ω ,φ( x0 ,t)∈ Cα( [0 ,T] )且关于 t∈ [0 。 展开更多
关键词 抛物型方程 M-A方程 广义解 凸单调函数
下载PDF
GENERALIZED SOLUTION OF THE FIRST BOUNDARY VALUE PROBLEM FOR PARABOLIC MONGE—AMPERE EQUATION
2
作者 陈丽 王光烈 《Journal of Partial Differential Equations》 2001年第2期149-162,共14页
关键词 抛物型方程 MONGE-AMPERE方程 广义解 凸单调函数 边值问题
原文传递
CONVEXIFICATION AND CONCAVIFICATION METHODS FOR SOME GLOBAL OPTIMIZATION PROBLEMS 被引量:3
3
作者 WUZhiyou ZHANGLiansheng +1 位作者 BAIFusheng YANGXinmin 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2004年第3期421-436,共16页
In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and con... In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function, then we propose several convexification and concavification transformations to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions, and propose several convexification and concavification transformations to convert a non-monotone objective function into a convex or concave function in some programming problems with strictly monotone constraint functions. Finally, we prove that the original programming problem can be converted into an equivalent concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem. Then the global optimal solution of the original problem can be obtained by solving the converted concave minimization problem, or reverse convex programming problem or canonical D.C. programming problem using the existing algorithms about them. 展开更多
关键词 Global optimal solution concave minimization reverse convex programmingproblem D.C. programming problem CONVEXIFICATION CONCAVIFICATION
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部