Results 211 to 220 of about 9,205,712 (248)

Optimality Conditions for C1,1 Vector Optimization Problems

Journal of Optimization Theory and Applications, 2001
This note deals with the problem of minimizing a vector-valued function \(f: \mathbb{R}^m \to \mathbb{R}^n\), where the order in \(\mathbb{R}^n\) is given by a certain closed convex pointed cone \(K\). The function \(f\) is assumed to be of class \(C^{1,1}\).
GUERRAGGIO, ANGELO, LUC DT
openaire   +2 more sources

Interactive stability of vector optimization problems

European Journal of Operational Research, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Vector Variational Inequalities for Nondifferentiable Convex Vector Optimization Problems

Journal of Global Optimization, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gue Myung Lee, Kwang Baik Lee
openaire   +1 more source

On Vector Variational Inequalities and Vector Optimization Problems

2020
This article deals with the relations among Minty and Stampacchia vector variational inequalities and vector optimization problems involving strongly convex functions of higher order. A numerical example has been given to justify the significance of these results.
B. B. Upadhyay, Priyanka Mishra
openaire   +1 more source

Vector approximation problems in geometric vector optimization

Optimization, 1993
Using the geometric vector inequality, introduced by Elster/Elster/Go pfert [9], we consider a special case of that inequality which is a basis for treating certain classes of (nonsmooth) vector optimization problems: vector curve fitting problemslp -vector approximation problems and vector regression problems.
K. H. Elster, R. Elster
openaire   +1 more source

Vector optimization problems with quasiconvex constraints

Journal of Global Optimization, 2008
The paper considers vector optimization problems in topological real linear spaces \(X, Y, Z\): \[ \min_C f(x) \text{ subject to } g(x) \in -K, \] where \(C\subset Y\) and \(K\subset\)Z are closed convex cones, \(X_0 \subset X\) and \(f:X_0 \rightarrow Y, g:X_0 \rightarrow Z\). Optimality is defined as weak efficiency.
openaire   +4 more sources

Generalized Convexity and Nonsmooth Problems of Vector Optimization

Journal of Global Optimization, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pham Huu Sach, Do Sang Kim, Gue Myung Lee   +2 more
openaire   +3 more sources

Well Posedness in Vector Optimization Problems and Vector Variational Inequalities

Journal of Optimization Theory and Applications, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giovanni P Crespi, M Rocca
exaly   +3 more sources

Optimality Conditions for Vector Equilibrium Problems with Applications

Journal of Optimization Theory and Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alfredo N. Iusem, Felipe Lara 0001
openaire   +3 more sources

Stability for Properly Quasiconvex Vector Optimization Problem

Journal of Optimization Theory and Applications, 2012
From the abstract: ``The aim of this paper is to study the stability aspects of various types of solution sets of a vector optimization problem both in the given space and in its image space by perturbing the objective function and the feasible set. The Kuratowski-Painlevé set-convergence of the sets of minimal, weak minimal and Henig proper minimal ...
C. S. Lalitha, Prashanto Chatterjee
openaire   +3 more sources