Results 201 to 210 of about 9,205,712 (248)
Some of the next articles are maybe not open access.
Vector optimization problems with nonconvex preferences
Journal of Global Optimization, 2007This paper studies vector optimization problems where the order is defined by a cone, which is not necessarily convex. First, the authors study six types of variational inequalities. For example, let \(X\) and \(Y\) be two Banach spaces ordered by cones \(C\subset X\) and \(P\subset Y\), respectively. The cone \(C\) is convex, whereas \(P\) is not. Let
Nan-Jing Huang +2 more
openaire +1 more source
On general vector quasi-optimization problems
Mathematical Methods of Operations Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelo Guerraggio, Nguyen Xuan Tan
openaire +1 more source
Vector optimization problem and generalized convexity
Journal of Global Optimization, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Oveisiha, Jafar Zafarani
openaire +1 more source
Query optimization for vector space problems
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval, 2001We present performance measurement results for a parallel SQL based information retrieval system implemented on a PC cluster system. We used the Web-TREC dataset under a left-deep query execution plan. We achieved satisfactory speed up.
Kazuo Goda +4 more
openaire +1 more source
On the Existence of Solutions to Vector Optimization Problems
2006The existence of solutions to a Vector Optimization Problem is carried out by means of the image space analysis. Classic existence results are revisited and presented under suitable compactness assumptions on the image of the Vector Optimization Problem.
MASTROENI, GIANDOMENICO +1 more
openaire +3 more sources
Optimality Conditions for Quasi-Solutions of Vector Optimization Problems
Journal of Optimization Theory and Applications, 2013In this paper, the authors deal with quasi-solutions of constrained vector optimization problems. These solutions are a kind of approximate minimal solutions and they are motivated by the Ekeland variational principle. They introduce several notions of quasi-minimality based on free disposal sets and characterize these solutions through scalarization ...
César Gutiérrez +2 more
openaire +3 more sources
Reducing a Multi Stage Vector Optimization Problem to a Single Stage Vector Optimization Problem
OPSEARCH, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A Subgradient Method for Vector Optimization Problems
SIAM Journal on Optimization, 2013Vector optimization problems are a significant extension of scalar optimization and have many real life applications. We consider an extension of the projected subgradient method to convex vector optimization, which works directly with vector-valued functions, without using scalar-valued objectives.
openaire +2 more sources
Vector Optimization Problems via Improvement Sets
Journal of Optimization Theory and Applications, 2011The authors introduce the concept of improvement sets and optimal points with respect to the preference relation given by an improvement set (a nonempty set \(E\) in \(\mathbb R^n\) is called an improvement set if it does not contain the origin and has a free disposal property: \(E+\mathbb R^n_+ \subseteq E\); and a point \(a\) of a nonempty set \(A ...
CHICCO, MAURIZIO +3 more
openaire +3 more sources
Some Remarks On Vector Optimization Problems
Journal of Optimization Theory and Applications, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source