Linear convergence in the approximation of rank-one convex envelopes
Department of Mathematics, University of Maryland,
College Park, MD 20742-4015, USA. email@example.com.
A linearly convergent iterative algorithm that approximates the rank-1 convex envelope of a given function , i.e. the largest function below f which is convex along all rank-1 lines, is established. The proposed algorithm is a modified version of an approximation scheme due to Dolzmann and Walkington.
Mathematics Subject Classification: 65K10 / 74G15 / 74G65 / 74N99
Key words: Nonconvex variational problem / calculus of variations / relaxed variational problems / rank-1 convex envelope / microstructure / iterative algorithm.
© EDP Sciences, SMAI, 2004