Live briefing
Everything about Barrier function
Continuous function whose value increases to infinity
In constrained optimization, a field of mathematics, a barrier function is a continuous function whose value increases to infinity as its argument approaches the boundary of the feasible region of an optimization problem. Such functions are used to replace inequality constraints by a penalizing term in the objective function that is easier to handle. A barrier function is also called an interior penalty function, as it is a penalty function that forces the solution to remain within the interior of the feasible region. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Barrier functionA 5-minute orientation
- Skim a recent paper: Neuroinflammation, Stroke, Blood-Brain Barrier Dysfunction, and Imaging ModalitiesInfluential work since 2022
- Pick up a classic book: First mover advantages, blockaded entry, and the economics of uneven developmentThe most-reprinted book on the subject
- Read the landmark paper: Structure and function of the blood–brain barrierCited 4,789 times
- Go sideways: Interior-point methodA closely related topic
- Go sideways: Augmented Lagrangian methodA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Structure and function of the blood–brain barrier
Moisturization and skin barrier function
II. Stress and intestinal barrier function
Epithelial Cell Shedding and Barrier Function
Skin Barrier Function and the Microbiome
Glutamine and intestinal barrier function
Barrier function regulates epidermal DNA synthesis.
Intestinal barrier function
🆕 Influential since 2022
đź“š Books worth reading
- 📕First mover advantages, blockaded entry, and the economics of uneven developmentJames R. Markusen · 1990
Fusion reactions below the Coulomb barrier · 1985
Skin functionalityMohammad Baghaei · 2026
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Interior-point method Interior-point methods (also referred to as barrier methods or IPMs) are algorithms for solving linear and non-linear convex optimization problems. IPMs…
- Augmented Lagrangian method Augmented Lagrangian methods are a certain class of algorithms for solving constrained optimization problems. They have similarities to penalty methods…
- Convex optimization Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently…
- Penalty method In mathematical optimization, penalty methods are a certain class of algorithms for solving constrained optimization problems. A penalty method replaces…
- Second-order cone programming A second-order cone program (SOCP) is a convex optimization problem of the form minimize fTx subject to ‖Aix+bi‖2≤ciTx+di,i=1,…,m Fx=g where the problem…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…
- Weak duality In applied mathematics, weak duality is a concept in optimization which states that the duality gap is always greater than or equal to 0. This means that…
- Karush–Kuhn–Tucker conditions In mathematical optimization, the Karush–Kuhn–Tucker (KKT) conditions, also known as the Kuhn–Tucker conditions, are first derivative tests (sometimes…