Reliable and Efficient Approximation of Polyconvex Envelopes
An iterative algorithm that approximates the polyconvex envelope \(f^{\text{pc}}\) of a given function \(f: \mathbb{R}^{m\times n}\to\mathbb{R}\), i.e. the largest function below \(f\), which is convex in all minors, is established. The propose iterative algorithm approximates \(f^{\text{pc}}\) of \(f\) as a lower bound of the quasi-convex envelope \(f^{\text{qc}}\). Therefore it is necessary to know upper and lower bounds for \(f^{\text{qc}}\). The aim of the present paper is to establish a reliable and efficient algorithm that computes a lower bound. Numerical schemes for the approximation of upper bounds can be found elsewhere in the literature (the exact citations are given in the references in the end the present paper). A straightforward discretization linearizes nonlinear constraints and results in a large but linear optimization problem. An efficient strategy that reduces the large number of unknowns is proposed. It is shown that for a large class of functions \(f\) the approximation is very accurate. Numerical experiments that illustrate the high efficiency and accuracy of the proposed algorithm are reported.
- Computing uniform convex approximations for convex envelopes and convex hulls
- Convex envelopes for fixed rank approximation
- A unifying polyhedral approximation framework for convex optimization
- Fast method for pointwise evaluation of polyconvex envelopes.
- A method for pointwise evaluation of polyconvex envelopes
- The Polya algorithm for convex approximation
- An algorithm for pointwise evaluation of polyconvex envelopes. II: generalization and numerical results
- Efficient algorithms for approximation of nonsmooth convex bodies
- scientific article; zbMATH DE number 4054246
- Polynomial approximation in convex domains
- Mixed analytical-numerical relaxation in finite single-slip crystal plasticity
- Estimates for numerical approximations of rank one convex envelopes
- Ten remarks on nonconvex minimisation for phase transition simulations
- A method for pointwise evaluation of polyconvex envelopes
- Optimal laminates in single-slip elastoplasticity
- The quasiconvex envelope of conformally invariant planar energy functions in isotropic hyperelasticity
- Exact and approximate results for convex envelopes of special structured functions over simplices
- An adaptive relaxation algorithm for multiscale problems and application to nematic elastomers
- An algorithm for pointwise evaluation of polyconvex envelopes. II: generalization and numerical results
- Fast method for pointwise evaluation of polyconvex envelopes.
- Computational Microstructures in Phase Transition Solids and Finite-Strain Elastoplasticity
- Approximated Convex Envelope of a Function
- Envelope computation in the plane by approximate implicitization
- Weak lower semicontinuity of integral functionals and applications
- A partial differential equation for the rank one convex envelope
- Convergence of adaptive finite element methods for a nonconvex double-well minimization problem
- Linear convergence in the approximation of rank-one convex envelopes
- Towards effective simulation of effective elastoplastic evolution
- Analytical and numerical relaxation results for models in soil mechanics
- Instability origin of subgrain formation in plastically deformed materials
- Hierarchical rank-one sequence convexification for the relaxation of variational problems with microstructures
- Computational polyconvexification of isotropic functions
- Characterization of polyconvex isotropic functions
- Convergence of discontinuous Galerkin methods for quasiconvex and relaxed variational problems
- Universal neural network approximation of symmetric polyconvex energies and envelopes
This page was built for publication: Reliable and Efficient Approximation of Polyconvex Envelopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5700273)
