Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 60 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 23 tok/s Pro
GPT-4o 72 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 457 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Duality-Based Algorithm and Numerical Analysis for Optimal Insulation Problems on Non-Smooth Domains (2505.04571v1)

Published 7 May 2025 in math.NA, cs.NA, math.AP, and math.OC

Abstract: This article develops a numerical approximation of a convex non-local and non-smooth minimization problem. The physical problem involves determining the optimal distribution, given by $h\colon \Gamma_I\to [0,+\infty)$, of a given amount $m\in \mathbb{N}$ of insulating material attached to a boundary part $\Gamma_I\subseteq \partial\Omega$ of a thermally conducting body $\Omega \subseteq \mathbb{R}d$, $d \in \mathbb{N}$, subject to conductive heat transfer. To tackle the non-local and non-smooth character of the problem, the article introduces a (Fenchel) duality framework: (a) At the continuous level, using (Fenchel) duality relations, we derive an a posteriori error identity that can handle arbitrary admissible approximations of the primal and dual formulations of the convex non-local and non-smooth minimization problem; (b) At the discrete level, using discrete (Fenchel) duality relations, we derive an a priori error identity that applies to a Crouzeix--Raviart discretization of the primal formulation and a Raviart--Thomas discretization of the dual formulation. The proposed framework leads to error decay rates that are optimal with respect to the specific regularity of a minimizer. In addition, we prove convergence of the numerical approximation under minimal regularity assumptions. Since the discrete dual formulation can be written as a quadratic program, it is solved using a primal-dual active set strategy interpreted as semismooth Newton method. A solution of the discrete primal formulation is reconstructed from the solution of the discrete dual formulation by means of an inverse generalized Marini formula. This is the first such formula for this class of convex non-local and non-smooth minimization problems.

Summary

We haven't generated a summary for this paper yet.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets

This paper has been mentioned in 1 post and received 0 likes.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube