Related papers: Formalization of Optimality Conditions for Smooth …
We present a unified study of first and second order necessary and sufficient optimality conditions for minimax and Chebyshev optimisation problems with cone constraints. First order optimality conditions for such problems can be formulated…
Second-order optimality conditions for vector nonlinear programming problems with inequality constraints are studied in this paper. We introduce a new second-order constraint qualification, which includes Mangasarian-Fromovitz constraint…
This paper is devoted to study of optimality conditions at infinity in nonsmooth minimax programming problems and applications. By means of the limiting subdifferential and normal cone at infinity, we dirive necessary and sufficient…
Sequential optimality conditions play an important role in constrained optimization since they provide necessary conditions without requiring constraint qualifications (CQs). This paper introduces a second-order extension of the Approximate…
Given a non-convex optimization problem, we study conditions under which every Karush-Kuhn-Tucker (KKT) point is a global optimizer. This property is known as KT-invexity and allows to identify the subset of problems where an interior point…
Most numerical methods developed for solving nonlinear programming problems are designed to find points that satisfy certain optimality conditions. While the Karush-Kuhn-Tucker conditions are well-known, they become invalid when constraint…
We present a systematic introduction to first-order optimality conditions for mathematical programs with equilibrium constraints (MPECs), emphasizing the limitations of classical nonlinear programming techniques. The goal is twofold. First,…
The classical method to solve a quadratic optimization problem with nonlinear equality constraints is to solve the Karush-Kuhn-Tucker (KKT) optimality conditions using Newton's method. This approach however is usually computationally…
In this article we consider a convex feasible set described by inequality constraints that are continuous and not necessarily Lipschitz or convex. We show that if the Slater constraint qualification and a non-degeneracy condition are…
In this paper we obtain second- and first-order optimality conditions of Kuhn-Tucker type and Fritz John one for weak efficiency in the vector problem with inequality constraints. In the necessary conditions we suppose that the objective…
In the present paper, we are concerned with a class of constrained vector optimization problems, where the objective functions and active constraint functions are locally Lipschitz at the referee point. Some second-order constraint…
In this paper, we provide a complete characterization on the robust isolated calmness of the Karush-Kuhn-Tucker (KKT) solution mapping for convex constrained optimization problems regularized by the nuclear norm function. This study is…
We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical pro\-gra\-mming problems. We pay special attention in the case that the functional constraint belongs to a…
Minimax optimization problems arises from both modern machine learning including generative adversarial networks, adversarial training and multi-agent reinforcement learning, as well as from tradition research areas such as saddle point…
We consider non-autonomous calculus of variations problems with a state constraint represented by a given closed set. We prove that if the interior of the Clarke tangent cone of the state constraint set is non-empty (this is the constraint…
This expository paper contains a concise introduction to some significant works concerning the Karush-Kuhn-Tucker condition, a necessary condition for a solution in local optimality in problems with equality and inequality constraints. The…
Recently, Yamanaka and Yamashita proposed the so-called positively homogeneous optimization problem, which includes many important problems, such as the absolute-value and the gauge optimizations. They presented a closed form of the dual…
We establish new results of first-order necessary conditions of optimality for finite-dimensional problems with inequality constraints and for problems with equality and inequality constraints, in the form of John's theorem and in the form…
Minimax optimization problems are an important class of optimization problems arising from both modern machine learning and from traditional research areas. We focus on the stability of constrained minimax optimization problems based on the…
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…