
handle: 10281/19687
The paper concerns the following minimization problem \[ \text{Min } \int_\Omega [f(\|\nabla u(x)\|)+ g(x,u(x))] dx,\quad u- u^0\in W^0\in W^{1,1}_0(\Omega), \] where \(\Omega\) is an open bounded domain with Lipschitz boundary, \(W^0\) is a linear subset of \(W^{1,1}_0(\Omega)\) which contains all \(w\in W^{1,1}\) with \(\int_\Omega f(\|\nabla w(x)\|) dx< \infty\) and such that \(w\) can be suitably approximated by \(C^1\) maps. The author proves the validity of an Euler-Lagrange equation for this minimization problem under growth assumptions on \(f\) which are very general. In particular, this result contains the cases \[ f(\|\xi\|)= p(\|\xi\|) e^{K\|\xi\|}\quad(K\geq 0,\;p\text{ a polynomial}), \] \[ f(\|\xi\|)= \|\xi\|^{\|\xi\|}. \]
boundary values, Euler-Lagrange equation;, Euler-Lagrange equation, Euler–Lagrange equation, Regularity of solutions in optimal control, minimization problem, Optimality conditions for free problems in two or more independent variables, Analysis, regularity conditions
boundary values, Euler-Lagrange equation;, Euler-Lagrange equation, Euler–Lagrange equation, Regularity of solutions in optimal control, minimization problem, Optimality conditions for free problems in two or more independent variables, Analysis, regularity conditions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
