The purpose of this paper is to characterize the weak Pareto optimality for multiobjective pseudoconvex problem. In fact, it is a first order optimality characterization that generalize the Karush-Kuhn-Tucker condition. Moreover, this work is an extension of the single-objective case [6] to the multiobjective one with pseudoconvex continuous functions. Mathematics Subject Classification: 46N10,...

Mathematics (ABSTRACT) This work is concerned with the construction of preconditioners for indefinite linear systems. The systems under investigation arise in the numerical solution of quadratic programming problems, for example in the form of Karush–Kuhn–Tucker (KKT) optimality conditions or in interior–point methods. Therefore, the system matrix is referred to as a KKT matrix. It is not the p...

Our approach to the Karush-Kuhn-Tucker theorem in [OSC] was entirely based on subdifferential calculus (essentially, it was an outgrowth of the two subdifferential calculus rules contained in the Fenchel-Moreau and Dubovitskii-Milyutin theorems, i.e., Theorems 2.9 and 2.17 of [OSC]). On the other hand, Proposition B.4(v) in [OSC] gives an intimate connection between the subdifferential of a fun...

In this paper we study necessary optimality conditions for nonsmooth optimization problems with equality, inequality and abstract set constraints. We derive the enhanced Fritz John condition which contains some new information even in the smooth case than the classical enhanced Fritz John condition. From this enhanced Fritz John condition we derive the enhanced Karush-Kuhn-Tucker (KKT) conditio...

In this paper, we study the differentiability of the trajectories of the logarithmic barrier algorithm for a nonlinear program when the set Λ∗ of the Karush-Kuhn-Tucker multiplier vectors is empty owing to the fact that the constraint qualifications are not satisfied.

This paper studies first order conditions (Karush–Kuhn–Tucker conditions) for discretized optimal control problems with nonsmooth constraints. We present a simple condition which can be used to verify that a local optimal point satisfies the first order conditions and that a point satisfying the first order conditions is a global or local optimal solution of the optimal control problem.

When studying the information leakage in programs or protocols, a natural question arises: “what is the worst case scenario?”. This problem of identifying the maximal leakage can be seen as a channel capacity problem in the information theoretical sense. In this paper, by combining two powerful theories: Information Theory and Karush–Kuhn–Tucker conditions, we demonstrate a very general solutio...

The approximate Karush-Kuhn-Tucker (AKKT) condition is introduced being a necessary of the local weak efficient solution for optimistic bilevel optimization problems with multiple objectives in upper-level problems. We transform multi-objective problem into single-level by means value function transformation or KKT transformation. then prove that AKKT point to be without any constraint qualific...

A novel model including social, environmental and economic benefits is proposed in hybrid thermal/wind power system and studied by Karush-Kuhn-Tucker and hybrid particle swarm optimization techniques. Our work is the first to develop social dispatch model by calculating risk caused by wind power. Then the novel multi-objective optimization model of social-environment-economic dispatch is establ...