Automating the Formulation and Resolution of Convex Variational Problems

DOI10.1145/3393881zbMath1484.65120arXiv1911.13185OpenAlexW3041654651WikidataQ113309930 ScholiaQ113309930MaRDI QIDQ5025170

Jeremy Bleyer

Publication date: 1 February 2022

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.13185

zbMATH Keywords

convex optimizationfinite element methodconic programmingFEniCS

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (2)

A dual decomposition of the closest point projection in incremental elasto‐plasticity using a mixed shell finite element ⋮ A novel upper bound finite-element for the limit analysis of plates and shells

Uses Software

• PETSc
• DOLFIN
• FEniCS
• Mosek
• TAO
• fenics-optim

This page was built for publication: Automating the Formulation and Resolution of Convex Variational Problems