This paper is a counterpart of [2]. Specifically, for a locally optimal solution to the nonlinear second-order cone programming (SOCP), under Robinson’s constraint qualification, we establish the equivalence among the following three conditions: the nonsingularity of Clarke’s Jacobian of Fischer-Burmeister (FB) nonsmooth system for the Karush-Kuhn-Tucker conditions, the strong second-order suff...

In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.

In this paper, we establish strong complementary approximate Karush- Kuhn-Tucker (SCAKKT) sequential optimality conditions for multiobjective optimization problems with equality and inequality constraints without any constraint qualifications introduce a weak qualification which assures the equivalence between SCAKKT Karush-Kuhn-Tucker (J Optim Theory Appl 80 (3): 483-500, 1994) problems.

Fritz John and Karush-Kuhn-Tucker type optimality conditions for a nondifferentiable multiobjective variational problem are derived. As an application of Karush-Kuhn-Tucker type optimality conditions, Mond-weir type second-order nondifferentiable multiobjective dual variational problems is constructed. Various duality results for the pair of Mond-Weir type second-order dual variational problems...

We consider a discrete bridge from (0, 0) to (2N, 0) evolving according to the corner growth dynamics, where the jump rates are subject to an upward asymmetry of order N with α > 0. We provide a classification of the static and dynamic behaviour of this model according to the value of the parameter α. Our main results concern the hydrodynamic limit and the fluctuations of the bridge. For α < 1,...

1 The " convex " KKT theorem: a recapitulation We recall the Karush-Kuhn-Tucker theorem for convex programming, as treated in the previous lecture (see Corollary 3.5 of [OSC]).

We present a new version of first order necessary optimality conditions for a static minmax problem with inequality constraints in the parametric constraint case. These conditions, after some modification, turn out to characterize strict local minimizers of order one for the given problem.

| Conics are widely accepted as one of the most fundamental image features together with points and line segments. The problem of space reconstruction and correspondence of two conics from two views is addressed in this paper. It is shown that there are two independent polynomial conditions on the corresponding pair of conics across two views, given the relative orientation of the two views. Th...

Using mountain pass arguments and the Karsuh-Kuhn-Tucker Theorem, we prove the existence of at least two positive solution of the anisotropic discrete Dirichlet boundary value problem. Our results generalize and improve those of [16]. Math Subject Classifications: 39A10, 34B18, 58E30.

In this paper, we illustrated one scenario to modify the Ivanenko-LandauKähler equation. Since Ivanenko and Landau introduced the equation in 1928, the equation has been regarded as having a certain role as a fermion in particular in the discrete Lattice. Also, although it correctly is formulated as an alternative classical field equation by the Ideal projection for the Dirac equation in the Mi...