Smoothness Properties of the Lower Semicontinuous Quasiconvex Envelope

2010 ◽  
pp. 377-400 ◽  
Author(s):  
Marcus Wagner
Keyword(s):  
Lower Semicontinuous ◽  
Quasiconvex Envelope

scholarly journals Equivalence of viscosity and weak solutions for a p-parabolic equation

2021 ◽  
Author(s):  
Jarkko Siltakoski
Keyword(s):  
Parabolic Equation ◽  
Weak Solutions ◽  
Lower Semicontinuity ◽  
Lower Semicontinuous ◽  
Relationship Of ◽  
The Relationship

AbstractWe study the relationship of viscosity and weak solutions to the equation $$\begin{aligned} \smash {\partial _{t}u-\varDelta _{p}u=f(Du)}, \end{aligned}$$ ∂ t u - Δ p u = f ( D u ) , where $$p>1$$ p > 1 and $$f\in C({\mathbb {R}}^{N})$$ f ∈ C ( R N ) satisfies suitable assumptions. Our main result is that bounded viscosity supersolutions coincide with bounded lower semicontinuous weak supersolutions. Moreover, we prove the lower semicontinuity of weak supersolutions when $$p\ge 2$$ p ≥ 2 .

scholarly journals A Projected Forward-Backward Algorithm for Constrained Minimization with Applications to Image Inpainting

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 890
Author(s):  
Suthep Suantai ◽  
Kunrada Kankam ◽  
Prasit Cholamjiak
Keyword(s):  
Image Processing ◽  
Minimization Problem ◽  
Convex Functions ◽  
Lower Semicontinuous ◽  
Image Inpainting ◽  
Constrained Minimization ◽  
Convex Minimization Problem ◽  
Mild Conditions ◽  
Constrained Minimization Problem ◽  
Weak Convergence Theorem

In this research, we study the convex minimization problem in the form of the sum of two proper, lower-semicontinuous, and convex functions. We introduce a new projected forward-backward algorithm using linesearch and inertial techniques. We then establish a weak convergence theorem under mild conditions. It is known that image processing such as inpainting problems can be modeled as the constrained minimization problem of the sum of convex functions. In this connection, we aim to apply the suggested method for solving image inpainting. We also give some comparisons to other methods in the literature. It is shown that the proposed algorithm outperforms others in terms of iterations. Finally, we give an analysis on parameters that are assumed in our hypothesis.

scholarly journals Connected perimeter of planar sets

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
François Dayrens ◽  
Simon Masnou ◽  
Matteo Novaga ◽  
Marco Pozzetta
Keyword(s):  
Minimization Problem ◽  
Existence Of Solutions ◽  
Lower Semicontinuous ◽  
Representation Formula ◽  
Steiner Trees ◽  
Lower Semicontinuous Envelope ◽  
Simply Connected

AbstractWe introduce a notion of connected perimeter for planar sets defined as the lower semicontinuous envelope of perimeters of approximating sets which are measure-theoretically connected. A companion notion of simply connected perimeter is also studied. We prove a representation formula which links the connected perimeter, the classical perimeter, and the length of suitable Steiner trees. We also discuss the application of this notion to the existence of solutions to a nonlocal minimization problem with connectedness constraint.

Sandwich Theorems for Semicontinuous Operators

1992 ◽  
Vol 35 (4) ◽  
pp. 463-474 ◽  
Author(s):  
J. M. Borwein ◽  
M. Théra
Keyword(s):  
Lower Semicontinuous ◽  
Lower Semicontinuous Functions ◽  
Classical Interpolation ◽  
Semicontinuous Functions

AbstractWe provide vector analogues of the classical interpolation theorems for lower semicontinuous functions due to Dowker and to Hahn and Katetov-Tong.

On semilinear differential inclusions with lower semicontinuous nonlinearities

2000 ◽  
Vol 178 (1) ◽  
pp. 235-244 ◽  
Author(s):  
Mikhail Kamenskii ◽  
Valeri Obukhovskii ◽  
Pietro Zecca
Keyword(s):  
Differential Inclusions ◽  
Lower Semicontinuous
Sign in / Sign up

Export Citation Format

Share Document