Published September 8, 1999
| Version public
Journal Article
Open
Numerical Computation of Rank-One Convex Envelopes
Creators
Abstract
We describe an algorithm for the numerical computation of the rank-one convex envelope of a function $f:\MM^{m\times n}\rightarrow\RR$. We prove its convergence and an error estimate in L∞.
Additional Information
© 1999 SIAM Received by the editors August 6, 1997; accepted for publication (in revised form) October 28, 1998; published electronically September 8, 1999. This work was partially supported by ARO and NSF through grants to the Center for Nonlinear Analysis, Carnegie Mellon University, Pittsburgh, PA. Most of the work was done while the author held a postdoctoral research fellowship at the Center for Nonlinear Analysis at Carnegie Mellon University, Pittsburgh, whose hospitality and stimulating atmosphere are gratefully acknowledged. It is my pleasure to thank N. J. Walkington for fruitful discussion on the subject. I also thank the referees for their insightful comments.Files
DOLsiamjna99.pdf
Files
(394.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:9d8aa5b940c60c5ebc97a48eb6a258d5
|
394.0 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 3090
- Resolver ID
- CaltechAUTHORS:DOLsiamjna99
Dates
- Created
-
2006-05-15Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field