Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Short Proof of the Sticky Face Lemma

A Short Proof of the Sticky Face Lemma 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematical Programming Springer Journals

A Short Proof of the Sticky Face Lemma

Robinson, Stephen
Mathematical Programming , Volume 168 (2) – Jun 13, 2016
Download PDF
5 pages

Loading next page...
1
 
/lp/springer_journal/a-short-proof-of-the-sticky-face-lemma-xEpymGH6ME

References (6)

Publisher
Springer Journals
Copyright
Copyright © 2016 by Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society
Subject
Mathematics; Calculus of Variations and Optimal Control; Optimization; Mathematics of Computing; Numerical Analysis; Combinatorics; Theoretical, Mathematical and Computational Physics; Mathematical Methods in Physics
ISSN
0025-5610
eISSN
1436-4646
DOI
10.1007/s10107-016-1037-z
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Mathematical Programming – Springer Journals

Published: Jun 13, 2016

There are no references for this article.