Thermodynamic pressure is the Legendre-Fenchel transform of negative entropy; equilibrium states are its subdifferentials, phase transitions mark non-differentiability, and a universal variational principle unifies additive, subadditive, and relative cases.
Princeton University Press, Princeton (1970)
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
verdicts
UNVERDICTED 4representative citing papers
RA-DCA applies randomized vertex screening inside DCA iterations for max-structured DC programs and proves that safeguarded accumulation points are directionally stationary with probability one under regularity, active-set consistency, and random-embedding assumptions.
The proximal Galerkin method reformulates phase-field fracture constraints into saddle-point problems to enforce physical bounds and irreversibility for static and dynamic cases.
SOCP reformulation of staggered-grid dynamic optimal transport eliminates interpolation steps and enables efficient proximal augmented Lagrangian solving with demonstrated speed and robustness gains.
citing papers explorer
-
The Convex-Analytic Structure of Thermodynamic Equilibrium: Pressure, Subdifferentials, and Phase Transitions
Thermodynamic pressure is the Legendre-Fenchel transform of negative entropy; equilibrium states are its subdifferentials, phase transitions mark non-differentiability, and a universal variational principle unifies additive, subadditive, and relative cases.
-
RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs
RA-DCA applies randomized vertex screening inside DCA iterations for max-structured DC programs and proves that safeguarded accumulation points are directionally stationary with probability one under regularity, active-set consistency, and random-embedding assumptions.
-
Proximal Galerkin for Phase Field Fracture
The proximal Galerkin method reformulates phase-field fracture constraints into saddle-point problems to enforce physical bounds and irreversibility for static and dynamic cases.
-
An efficient second-order cone programming approach for dynamic optimal transport on staggered grid discretization
SOCP reformulation of staggered-grid dynamic optimal transport eliminates interpolation steps and enables efficient proximal augmented Lagrangian solving with demonstrated speed and robustness gains.