Quasi-Newton minimization for the p(x)-Laplacian problem

Quasi-Newton minimization for the p(x)-Laplacian problem
复制标题

DOI:
10.1016/j.cam.2016.06.026
复制
发表时间:
2017
期刊:
J. Comput. Appl. Math.
影响因子:
--
通讯作者:
M. Caliari;S. Zuccher
M. Caliari;S. Zuccher
中科院分区:
其他
文献类型:
--
作者:
M. Caliari;S. Zuccher

文献摘要

被引文献

相似文献

提出了一种求解p(x)-Laplacian椭圆问题的拟牛顿极小化方法,x∈ Ω <$Rm.这种方法优于现有的p(x)变量的情况下,这是基于通用的最小化,如BFGS。此外,当与文献中可用于p-常数情况的特别技术(通常称为“网格独立”)相比时,由于二次模型给出的更好的下降方向,本方法通常被证明是上级。
We propose a quasi-Newton minimization approach for the solution of the p (x)-Laplacian elliptic problem, x∈ Ω⊂ R m. This method outperforms those existing for the p (x)-variable case, which are based on general purpose minimizers such as BFGS. Moreover, when compared to ad hoc techniques available in literature for the p-constant case, and usually referred to as “mesh independent”, the present method turns out to be generally superior thanks to better descent directions given by the quadratic model.