Abadie condition for infinite programming problems under Relaxed Constant Rank Constraint Qualification Plus
Abstract
We consider infinite programming problems with constraint sets defined by systems of infinite number of inequalities and equations given by continuously differentiable functions defined on Banach spaces. In the approach proposed here we represent these systems with the help of coefficients in a given Schauder basis. We prove the Abadie condition under the new infinite-dimensional Relaxed Constant Rank Constraint Qualification Plus and we discuss the existence of Lagrange multipliers. The main tools are: Rank Theorem and Ljusternik Theorem.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.