2011
DOI: 10.1002/cpa.20391
|View full text |Cite
|
Sign up to set email alerts
|

Vector‐valued optimal Lipschitz extensions

Abstract: Abstract.Consider a bounded open set U ⊂ R n and a Lipschitz function g : ∂U → R m . Does this function always have a canonical optimal Lipschitz extension to all of U ? We propose a notion of optimal Lipschitz extension and address existence and uniqueness in some special cases. In the case n = m = 2, we show that smooth solutions have two phases: in one they are conformal and in the other they are variants of infinity harmonic functions called infinity harmonic fans. We also prove existence and uniqueness fo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
47
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 34 publications
(47 citation statements)
references
References 17 publications
0
47
0
Order By: Relevance
“…The existence of L-lex minimal extensions in the non-weighted case was shown in [38,Theorem 1.2]. The existence in the weighted setting as well as for lex minimal extensions can be proved similarly; see [19].…”
Section: Minimal Lipschitz Extensionsmentioning
confidence: 99%
See 3 more Smart Citations
“…The existence of L-lex minimal extensions in the non-weighted case was shown in [38,Theorem 1.2]. The existence in the weighted setting as well as for lex minimal extensions can be proved similarly; see [19].…”
Section: Minimal Lipschitz Extensionsmentioning
confidence: 99%
“…was considered by [38]. This functional is not strictly convex for p ∈ (1, ∞), but has nevertheless a unique minimizer f ∞,p ∈ H g (V ) of E ∞,p ; see [19].…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…We conclude this introduction by noting that in the paper [37] the authors derived a different more singular multi-valued version of "∞-Laplacian" which describes optimal Lipschitz extensions. In our setting this amounts to changing in (1.3) from the Euclidean norm "| · |" we are using on R Nn to the nonsmooth operator norm A = max |a|=1 |Aa|.…”
Section: Introductionmentioning
confidence: 99%