We present here a new method for solving minimization problems in unbounded domains. We first derive a general principle showing the equivalence between the compactness of all minimizing sequences and some strict sub-additivity conditions. The proof is based upon a compactness lemma obtained with th...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!