An algorithm for pointwise evaluation of polyconvex envelopes. II: generalization and numerical results
From MaRDI portal
Publication:2263017
Recommendations
- A method for pointwise evaluation of polyconvex envelopes
- Fast method for pointwise evaluation of polyconvex envelopes.
- Reliable and Efficient Approximation of Polyconvex Envelopes
- On convex envelopes for bivariate functions over polytopes
- A technique to derive the analytical form of convex envelopes for some bivariate functions
Cites work
- scientific article; zbMATH DE number 2132148 (Why is no real title available?)
- scientific article; zbMATH DE number 4088359 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 970359 (Why is no real title available?)
- A generic global optimization algorithm for the chemical and phase equilibrium problem
- A method for pointwise evaluation of polyconvex envelopes
- A parallel algorithm for the global minimization of Gibbs free energy
- Convexity of certain integrals of the calculus of variations
- Direct methods in the calculus of variations
- Introduction to Piecewise Differentiable Equations
- On constrained optimization by adjoint based quasi-Newton methods
- On stable piecewise linearization and generalized algorithmic differentiation
- On the non-locality of quasiconvexity
- Optimal design and relaxation of variational problems, I
- Quasi-convexity and the lower semicontinuity of multiple integrals
- Quasiconvexity and relaxation of nonconvex problems in the calculus of variations
- Reliable and Efficient Approximation of Polyconvex Envelopes
Cited in
(5)
This page was built for publication: An algorithm for pointwise evaluation of polyconvex envelopes. II: generalization and numerical results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2263017)