期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
THREE SOLUTIONS FOR A FRACTIONAL ELLIPTIC PROBLEMS WITH CRITICAL AND SUPERCRITICAL GROWTH 被引量:1
1
作者 张金国 刘晓春 《Acta Mathematica Scientia》 SCIE CSCD 2016年第6期1819-1831,共13页
In this paper, we deal with the existence and multiplicity of solutions to the frac- tional elliptic problems involving critical and supercritical Sobolev exponent via variational arguments. By means of the truncation... In this paper, we deal with the existence and multiplicity of solutions to the frac- tional elliptic problems involving critical and supercritical Sobolev exponent via variational arguments. By means of the truncation combining with the Moser iteration, we prove that our problem has at least three solutions. 展开更多
关键词 fractional elliptic equation variational methods three solutions Moser itera-tion
下载PDF
SPARSE RECOVERY BASED ON THE GENERALIZED ERROR FUNCTION
2
作者 Zhiyong Zhou 《Journal of Computational Mathematics》 SCIE CSCD 2024年第3期679-704,共26页
In this paper,we offer a new sparse recovery strategy based on the generalized error function.The introduced penalty function involves both the shape and the scale parameters,making it extremely flexible.For both cons... In this paper,we offer a new sparse recovery strategy based on the generalized error function.The introduced penalty function involves both the shape and the scale parameters,making it extremely flexible.For both constrained and unconstrained models,the theoretical analysis results in terms of the null space property,the spherical section property and the restricted invertibility factor are established.The practical algorithms via both the iteratively reweighted■_(1)and the difference of convex functions algorithms are presented.Numerical experiments are carried out to demonstrate the benefits of the suggested approach in a variety of circumstances.Its practical application in magnetic resonance imaging(MRI)reconstruction is also investigated. 展开更多
关键词 Sparse recovery Generalized error function Nonconvex regularization itera-tive reweighted Li Difference of convex functions algorithms
原文传递
Average number of iterations of some polynomial interior-point——Algorithms for linear programming
3
作者 黄思明 《Science China Mathematics》 SCIE 2000年第8期829-835,共7页
We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the average number of iterations of these algorithms, coupled with a finite terminat... We study the behavior of some polynomial interior-point algorithms for solving random linear programming (LP) problems. We show that the average number of iterations of these algorithms, coupled with a finite termination technique, is bounded above by O( n1.5). The random LP problem is Todd’s probabilistic model with the standard Gauss distribution. 展开更多
关键词 linear programming interior point ALGORITHMS probabilistic LP models AVERAGE NUMBER of itera-tions.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部