التفاصيل البيبلوغرافية
| العنوان: |
A Short Proof of the Sticky Face Lemma. |
| المؤلفون: |
Robinson, Stephen M.1 |
| المصدر: |
Mathematical Programming. Mar2018, Vol. 168 Issue 1/2, p5-9. 5p. |
| مصطلحات موضوعية: |
*MATHEMATICAL optimization, CONES, CONVEX sets, POLYHEDRAL functions, VARIATIONAL approach (Mathematics) |
| مستخلص: |
The sticky face lemma describes the local behavior of the inverse of the normal-cone operator of a polyhedral convex set. This inverse, when applied to a vector, produces a face of the set. The lemma says that small perturbations of the vector produce only subfaces of the original face. This property is useful in analyzing variational analysis and optimization problems whose underlying sets are convex and polyhedral. [ABSTRACT FROM AUTHOR] |
|
Copyright of Mathematical Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Business Source Index |
Full Text Finder