Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Lipschitz-like property for polyhedral moving sets (1811.05166v1)

Published 13 Nov 2018 in math.OC

Abstract: We give sufficient conditions for Lipschitz-likeness of a class of polyhedral set-valued mappings in Hilbert spaces based on Relaxed Constant Rank Constraint Qualification (RCRCQ) proposed recently by Minchenko and Stakhovsky. To this aim we prove the R-regularity of the considered set-valued mapping and correct the respective proof given by these authors.

Summary

We haven't generated a summary for this paper yet.