2019•SIAM Journal on OptimizationOpen access

On Lipschitz-Like Property for Polyhedral Moving Sets

Ewa M. Bednarczuk, Krzysztof E. Rutkowski

Open full text 4 citations

Abstract

We give sufficient conditions for Lipschitz-likeness of a class of polyhedral set-valued mappings in Hilbert spaces based on the relaxed constant rank constraint qualification (RCRCQ) proposed recently by Minchenko and Stakhovsky. To this end, we prove the $R$-regularity of the considered set-valued mapping and correct the proof given by these authors.

Open-access reader

About this research paper

What this paper is about

We give sufficient conditions for Lipschitz-likeness of a class of polyhedral set-valued mappings in Hilbert spaces based on the relaxed constant rank constraint qualification (RCRCQ) proposed recently by Minchenko and Stakhovsky. To this end, we prove the $R$-regularity of the considered set-valued mapping and correct the proof given by these authors.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We give sufficient conditions for Lipschitz-likeness of a class of polyhedral set-valued mappings in Hilbert spaces based on the relaxed constant rank constraint qualification (RCRCQ) proposed recently by Minchenko and Stakhovsky. To this end, we prove the $R$-regularity of the considered set-valued mapping and correct the proof given by these authors.

Key concepts: Lipschitz continuity, Mathematics, Property (philosophy), Class (philosophy), Constraint (computer-aided design), Set (abstract data type), Constant (computer programming), Rank (graph theory)

Related papers

Back to paper searchBrowse research topicsOriginal source
On Lipschitz-Like Property for Polyhedral Moving Sets — Research Paper | ScholarLens