A short proof of the sticky face lemma

DOI10.1007/S10107-016-1037-ZzbMath1395.90231OpenAlexW2409501024WikidataQ125057414 ScholiaQ125057414MaRDI QIDQ2413077

Stephen M. Robinson

Publication date: 6 April 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-016-1037-z

zbMATH Keywords

optimizationnormal conevariational analysispolyhedral convex set

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Polytopes and polyhedra (52B99)

Cites Work

• Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
• Some continuity properties of polyhedral multifunctions
• An Implicit-Function Theorem for a Class of Nonsmooth Functions
• Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
• Implicit Functions and Solution Mappings

This page was built for publication: A short proof of the sticky face lemma