Page 1

Displaying 1 – 19 of 19

Showing per page

Saddle point criteria for second order η -approximated vector optimization problems

Anurag Jayswal, Shalini Jha, Sarita Choudhury (2016)

Kybernetika

The purpose of this paper is to apply second order η -approximation method introduced to optimization theory by Antczak [2] to obtain a new second order η -saddle point criteria for vector optimization problems involving second order invex functions. Therefore, a second order η -saddle point and the second order η -Lagrange function are defined for the second order η -approximated vector optimization problem constructed in this approach. Then, the equivalence between an (weak) efficient solution of the...

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

Tadeusz Antczak (2011)

Kybernetika

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 in the original...

Second order optimality conditions for differentiable multiobjective problems

Giancarlo Bigi, Marco Castellani (2010)

RAIRO - Operations Research

A second order optimality condition for multiobjective optimization with a set constraint is developed; this condition is expressed as the impossibility of nonhomogeneous linear systems. When the constraint is given in terms of inequalities and equalities, it can be turned into a John type multipliers rule, using a nonhomogeneous Motzkin Theorem of the Alternative. Adding weak second order regularity assumptions, Karush, Kuhn-Tucker type conditions are therefore deduced.

Second-order optimality conditions for nondominated solutions of multiobjective programming with C 1 , 1 data

Liping Liu, Pekka Neittaanmäki, Michal Křížek (2000)

Applications of Mathematics

We examine new second-order necessary conditions and sufficient conditions which characterize nondominated solutions of a generalized constrained multiobjective programming problem. The vector-valued criterion function as well as constraint functions are supposed to be from the class C 1 , 1 . Second-order optimality conditions for local Pareto solutions are derived as a special case.

Slice convergence : stabilité et optimisation dans les espaces non réflexifs

Khalid El Hajioui, Driss Mentagui (2004)

ESAIM: Control, Optimisation and Calculus of Variations

Il est démontré par Mentagui [ESAIM : COCV 9 (2003) 297-315] que, dans le cas des espaces de Banach généraux, la convergence d’Attouch-Wets est stable par une classe d’opérations classiques de l’analyse convexe, lorsque les limites des suites d’ensembles et de fonctions satisfont certaines conditions de qualification naturelles. Ceci tombe en défaut avec la slice convergence. Dans cet article, nous établissons des conditions de qualification uniformes assurant la stabilité de la slice convergence...

Slice convergence: stabilité et optimisation dans les espaces non réflexifs

Khalid El Hajioui, Driss Mentagui (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Il est démontré par Mentagui [ESAIM: COCV9 (2003) 297-315] que, dans le cas des espaces de Banach généraux, la convergence d'Attouch-Wets est stable par une classe d'opérations classiques de l'analyse convexe, lorsque les limites des suites d'ensembles et de fonctions satisfont certaines conditions de qualification naturelles. Ceci tombe en défaut avec la slice convergence. Dans cet article, nous établissons des conditions de qualification uniformes assurant la stabilité de la slice convergence...

Solution set in a special case of generalized Nash equilibrium games

Josef Cach (2001)

Kybernetika

A special class of generalized Nash equilibrium problems is studied. Both variational and quasi-variational inequalities are used to derive some results concerning the structure of the sets of equilibria. These results are applied to the Cournot oligopoly problem.

Stick-slip transition capturing by using an adaptive finite element method

Nicolas Roquet, Pierre Saramito (2004)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

The numerical modeling of the fully developed Poiseuille flow of a newtonian fluid in a square section with slip yield boundary condition at the wall is presented. The stick regions in outer corners and the slip region in the center of the pipe faces are exhibited. Numerical computations cover the complete range of the dimensionless number describing the slip yield effect, from a full slip to a full stick flow regime. The resolution of variational inequalities describing the flow is based on the...

Stick-slip transition capturing by using an adaptive finite element method

Nicolas Roquet, Pierre Saramito (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

The numerical modeling of the fully developed Poiseuille flow of a Newtonian fluid in a square section with slip yield boundary condition at the wall is presented. The stick regions in outer corners and the slip region in the center of the pipe faces are exhibited. Numerical computations cover the complete range of the dimensionless number describing the slip yield effect, from a full slip to a full stick flow regime. The resolution of variational inequalities describing the flow is based on the...

Strict convex regularizations, proximal points and augmented lagrangians

Carlos Humes Jr., Paulo Jose Da Silva E Silva (2010)

RAIRO - Operations Research

Proximal Point Methods (PPM) can be traced to the pioneer works of Moreau [16], Martinet [14, 15] and Rockafellar [19, 20] who used as regularization function the square of the Euclidean norm. In this work, we study PPM in the context of optimization and we derive a class of such methods which contains Rockafellar's result. We also present a less stringent criterion to the acceptance of an approximate solution to the subproblems that arise in the inner loops of PPM. Moreover, we introduce a new...

Strict minimizers of order m in nonsmooth optimization problems

Tadeusz Antczak, Krzysztof Kisiel (2006)

Commentationes Mathematicae Universitatis Carolinae

In the paper, some sufficient optimality conditions for strict minima of order m in constrained nonlinear mathematical programming problems involving (locally Lipschitz) ( F , ρ ) -convex functions of order m are presented. Furthermore, the concept of strict local minimizer of order m is also used to state various duality results in the sense of Mond-Weir and in the sense of Wolfe for such nondifferentiable optimization problems.

Sufficient Second Order Optimality Conditions for C^1 Multiobjective Optimization Problems

Gadhi, N. (2003)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: Primary 90C29; Secondary 90C30.In this work, we use the notion of Approximate Hessian introduced by Jeyakumar and Luc [19], and a special scalarization to establish sufficient optimality conditions for constrained multiobjective optimization problems. Throughout this paper, the data are assumed to be of class C^1, but not necessarily of class C^(1.1).

Currently displaying 1 – 19 of 19

Page 1