نتایج جستجو برای: Karush-Kuhn-Tucker conditions

تعداد نتایج: 851475  

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

2007
Valeriano A. De Oliveira Marko A. Rojas-Medar Nikolaos S. Papageorgiou

We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvex...

In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...

Journal: :Entropy 2015
Maria Cristina Carrisi Rita Enoh Tchame Marcel Obounou Sebastiano Pennisi

Extended Thermodynamics of dense gases is characterized by two hierarchies of field equations, which allow one to overcome some restrictions on the generality of the previous models. This idea has been introduced by Arima, Taniguchi, Ruggeri and Sugiyama. In the case of a 14-moment model, they have found the closure of the balance equations up to second order with respect to equilibrium. Here, ...

2015
S. Ahmadi N. Movahedian

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

Journal: :J. Applied Probability 2015
Krishna B. Athreya Vivekananda Roy

Let f be an integrable function on an infinite measure space (S,S , π). We show that if a regenerative sequence {Xn}n≥0 with canonical measure π could be generated then a consistent estimator of λ ≡ ∫ S fdπ can be produced. We further show that under appropriate second moment conditions, a confidence interval for λ can also be derived. This is illustrated with estimating countable sums and inte...

Journal: :Math. Oper. Res. 2006
Defeng Sun

For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson’s constraint qualification, the following conditions are proved to be equivalent: the strong second order sufficient condition and constraint nondegeneracy; the nonsingularity of Clarke’s Jacobian of the Karush-Kuhn-Tucker system; the strong regularity of the Karush-Kuhn-Tucker point; and others.

Journal: :Int. J. Math. Mathematical Sciences 2004
Ferenc Móricz Ulrich Stadtmüller

After a brief summary of Tauberian conditions for ordinary sequences of numbers, we consider summability of double sequences of real or complex numbers by weighted meanmethods which are not necessarily products of related weighted mean methods in one variable. Our goal is to obtain Tauberian conditions under which convergence of a double sequence follows from its summability, where convergence ...

Journal: :J. Comb. Theory, Ser. A 2006
Mark de Longueville Rade T. Zivaljevic

This article is concerned with a general scheme on how to obtain constructive proofs for combinatorial theorems that have topological proofs so far. To this end the combinatorial concept of Tucker-property of a finite group G is introduced and its relation to the topological Borsuk-Ulam-property is discussed. Applications of the Tucker-property in combinatorics are demonstrated.

Journal: :CoRR 2007
Christian Léonard

Entropy functionals (i.e. convex integral functionals) and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Dual equalities and characterizations of the minimizers are obtained with weak constraint qualifications.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید