An example in which CRCQ holds. The left figure shows a set S(u) defined by 3 constraints. The normal cone NS(u)(x) is the cone generated by the two dashed halflines originated from the point x. The red curve indicates the neighborhood X. The normal cone NS(u)(x) has four nonempty faces, and the family {I(x′, u), x′ ∈ S(u)∩X} contains four elements {1, 3},{1},{3} and ∅, each of which correspond...

This paper is devoted to studying the robust isolated calmness of the Karush– Kuhn–Tucker (KKT) solution mapping for a large class of interesting conic programming problems (including most commonly known ones arising from applications) at a locally optimal solution. Under the Robinson constraint qualification, we show that the KKT solution mapping is robustly isolated calm if and only if both t...

Adaptive finite element methods for optimization problems for second order linear elliptic partial differential equations subject to pointwise constraints on the `-norm of the gradient of the state are considered. In a weak duality setting, i.e. without assuming a constraint qualification such as the existence of a Slater point, residual based a posteriori error estimators are derived. To overc...

Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The effective domain of the value function is described by a modification of the concept of convex core. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. The minimizers and generalized minimizers are explicitly d...

In this note, we revisit the classical first order necessary condition in mathematical programming in infinite dimension. The constraint set being defined by C = g−1(K) where g is a smooth map between Banach spaces, and K a closed convex cone, we show that existence of Lagrange-Karush-Kuhn-Tucker multipliers is equivalent to metric subregularity of the multifunction defining the constraint, and...

The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian–Fromovitz Constraint Qualification, we establish re...

In this paper we study the qualification problem in theories of reasoning about actions and change and the link of this problem to properties of representation for expressing such theories. We examine the interaction of the qualification problem with the frame and ramification problems and show how an integrated solution to these problems can be developed where the frame persistence and constra...