Displaying similar documents to “First-Order Conditions for Optimization Problems with Quasiconvex Inequality Constraints”

A second order η -approximation method for constrained optimization problems involving second order invex functions

Tadeusz Antczak (2009)

Applications of Mathematics

Similarity:

A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order η -approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order η -approximation of both the objective function and the constraint function constituting the original problem. The equivalence between...

Saddle points criteria via a second order η -approximation approach for nonlinear mathematical programming involving second order invex functions

Tadeusz Antczak (2011)

Kybernetika

Similarity:

In this paper, by using the second order η -approximation method introduced by Antczak [3], new saddle point results are obtained for a nonlinear mathematical programming problem involving second order invex functions with respect to the same function η . Moreover, a second order η -saddle point and a second order η -Lagrange function are defined for the so-called second order η -approximated optimization problem constructed in this method. Then, the equivalence between an optimal solution...

First Order Characterizations of Pseudoconvex Functions

Ivanov, Vsevolod (2001)

Serdica Mathematical Journal

Similarity:

First order characterizations of pseudoconvex functions are investigated in terms of generalized directional derivatives. A connection with the invexity is analysed. Well-known first order characterizations of the solution sets of pseudolinear programs are generalized to the case of pseudoconvex programs. The concepts of pseudoconvexity and invexity do not depend on a single definition of the generalized directional derivative.

On constraint qualifications in directionally differentiable multiobjective optimization problems

Giorgio Giorgi, Bienvenido Jiménez, Vincente Novo (2010)

RAIRO - Operations Research

Similarity:

We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a way that generalize both the qualifications introduced by Maeda and the classical ones, when the functions are differentiable. The relationships between them are analyzed. Finally, we give...