Abstract

Minimization problems of the form $\{ \| Lu \|_{L^\infty } :u \in U\} $ are considered where L is a linear operator and U is a convex subset of some Hilbert space determined by a finite number of linear functional constraints. The usual variational techniques which provide an Euler equation for such problems in U for $p < \infty$ are not applicable in $L^\infty $; the solution is obtained and necessary conditions that it must satisfy are found by dualizing the problem to an appropriate extremal problem in a subspace of $L^1 $. Several applications are given where L is a linear differential operator acting on a Sobolev space.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.