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

Learn More →

On variational inequalities over polyhedral sets

On variational inequalities over polyhedral sets The results on regularity behavior of solutions to variational inequalities over polyhedral sets proved in a series of papers by Robinson, Ralph and Dontchev-Rockafellar in the 90s has long become classics of variational analysis. But the available proofs are very complicated and practically do not use techniques of variational analysis. The only exception is the proof by Dontchev and Rockafellar of their “critical face” regularity criterion. In the paper we offer a different approach completely based on polyhedral geometry and a few basic principles of metric regularity theory. It leads to new proofs, that look simpler and shorter, and in addition gives some clarifying geometrical information. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematical Programming Springer Journals

On variational inequalities over polyhedral sets

Mathematical Programming , Volume 168 (2) – Oct 19, 2016

Loading next page...
 
/lp/springer_journal/on-variational-inequalities-over-polyhedral-sets-Y1jsXlD5Cg

References (20)

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-1077-4
Publisher site
See Article on Publisher Site

Abstract

The results on regularity behavior of solutions to variational inequalities over polyhedral sets proved in a series of papers by Robinson, Ralph and Dontchev-Rockafellar in the 90s has long become classics of variational analysis. But the available proofs are very complicated and practically do not use techniques of variational analysis. The only exception is the proof by Dontchev and Rockafellar of their “critical face” regularity criterion. In the paper we offer a different approach completely based on polyhedral geometry and a few basic principles of metric regularity theory. It leads to new proofs, that look simpler and shorter, and in addition gives some clarifying geometrical information.

Journal

Mathematical ProgrammingSpringer Journals

Published: Oct 19, 2016

There are no references for this article.