Hostname: page-component-74656f9884-54qdv Total loading time: 0 Render date: 2026-11-10T22:32:21.731Z Has data issue: false hasContentIssue false

Linear convergence in the approximationof rank-one convex envelopes

Published online by Cambridge University Press:  15 October 2004

Sören Bartels*
Affiliation:
Department of Mathematics, University of Maryland, College Park, MD 20742-4015, USA. sba@math.umd.edu.
Get access

Abstract

A linearly convergent iterative algorithm that approximates therank-1 convex envelope  $f^{rc}$ of a given function $f:\mathbb{R}^{n\times m} \to \mathbb{R}$ , i.e. the largest function below f which is convex along all rank-1 lines, isestablished. The proposed algorithm is a modified version of an approximationscheme due to Dolzmann and Walkington.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable