Related papers: Isolated calmness of perturbation mappings in gene…
In this paper we introduce the notions of critical and noncritical multipliers for subdifferential variational systems extending to a general framework the corresponding notions by Izmailov and Solodov developed for classical…
This paper is concerned with the strong calmness of the KKT solution mapping for a class of canonically perturbed conic programming, which plays a central role in achieving fast convergence under situations when the Lagrange multiplier…
This paper studies the robust isolated calmness property of the KKT solution mapping of a class of nonsmooth optimization problems on Riemannian manifolds. The manifold versions of the Robinson constraint qualification, the strict Robinson…
In this paper, we study continuity and Lipschitzian properties of set-valued mappings, focusing on inner-type conditions. We introduce new notions of inner calmness* and, its relaxation, fuzzy inner calmness*. We show that polyhedral maps…
The presence of Lipschitzian properties for solution mappings associated with nonlinear parametric optimization problems is desirable in the context of stability analysis or bilevel optimization. An example of such a Lipschitzian property…
In this paper two properties of recognized interest in variational analysis, known as Lipschitz lower semicontinuity and calmness, are studied with reference to a general class of variational systems, i.e. to solution mappings to…
This paper presents a perturbation analysis framework for nonsmooth optimization on connected Riemannian manifolds to bridge the gap between the rapid development of algorithmic approaches and a robust theoretical foundation. Using…
We develop a Lagrange multiplier theory for nonconvex set-valued optimization problems under Lipschitz-type regularity conditions. Instead of classical continuous linear functionals, we introduce closed convex processes -- set-valued…
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…
The paper deals with an extension of the available theory of SCD (subspace containing derivatives) mappings to mappings between spaces of different dimensions. This extension enables us to derive workable sufficient conditions for the…
This paper establishes a general topological condition under which the semilocal stability of a set-valued mapping can be exactly determined by its local stability properties. Specifically, we investigate the relationship between the…
A class of parametric optimal control problems governed by semilinear parabolic equations with mixed pointwise constraints is investigated. The perturbations appear in the objective functional, the state equation and in mixed pointwise…
This manuscript focuses on the $\mathcal{H}_\infty$ observer design for a class of nonlinear discrete systems under the presence of measurement noise or external disturbances. Two new Linear Matrix Inequality (LMI) conditions are developed…
Lagrangian generalized Nash equilibriums (LGNEs) were introduced by Rockafellar (2024) for a class of generalized Nash equilibrium problems (GNEPs) in which each player's strategy is subject to conic constraints. This paper investigates the…
This paper is concerned with the calmness of a partial perturbation to the composite rank constraint system, an intersection of the rank constraint set and a general closed set, which is shown to be equivalent to a local Lipschitz-type…
In Part 1 of this paper, we have estimated the Fr\'echet coderivative and the Mordukhovich coderivative of the stationary point set map of a smooth parametric optimization problem with one smooth functional constraint under total…
We consider independent long-range percolation models on locally finite vertex-transitive graphs. Using coupling ideas we prove strict monotonicity of the critical points with respect to local perturbations in the connection function,…
Asymptotic stationarity and regularity conditions turned out to be quite useful to study the qualitative properties of numerical solution methods for standard nonlinear and complementarity-constrained programs. In this paper, we first…
This paper studies the isolated calmness of the optimal solution mapping and the associated Lagrange system for regularized convex composite optimization problems. Several necessary and sufficient conditions for this property are…
Lagrangian Relaxation (LR) is a powerful technique for solving large-scale Mixed Integer Linear Programming (MILP), particularly those with decomposable structures, such as vehicle routing or unit commitment problems. By relaxing the…