Results 221 to 230 of about 2,908,938 (258)
Some of the next articles are maybe not open access.
Vectorization in Set Optimization
Journal of Optimization Theory and Applications, 2013This paper presents a method to convert a set optimization problem to a vector optimization problem. The author introduces two vector maps from a family of subsets of a locally convex space equipped with an ordering cone, to the 2-dimensional and 4-dimensional spaces of functions over the positive polar cone of the ordering cone.
openaire +3 more sources
Regularity Conditions in Vector Optimization
Journal of Optimization Theory and Applications, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BIGI, GIANCARLO, PAPPALARDO, MASSIMO
openaire +3 more sources
Proximal Methods in Vector Optimization
SIAM Journal on Optimization, 2005Summary: We consider the vector optimization problem of finding weakly efficient points for maps from a Hilbert space \(X\) to a Banach space \(Y\) with respect to the partial order induced by a closed, convex, and pointed cone \(C\subset Y\) with a nonempty interior.
Henri Bonnel +2 more
openaire +2 more sources
Optimal vector transform for vector quantization
IEEE Signal Processing Letters, 1994The vector transform has previously been proposed for vector quantization image coding. It is intended for decorrelating intervector dependency and preserving intravector dependency. The present authors study optimally such a transform. It is found that the optimal vector transform in the above senses, with the first-order Gaussian Markov model, does ...
openaire +1 more source
2018 6th International Symposium on Computational and Business Intelligence (ISCBI), 2018
This research work is devoted to the general Optimaliy presented inside the best appropriate environment of the Infinite Dimensional Ordered Vector Spaces, with its natural projections in the Vectorial Optimization. It is also a short but original scientific Survey on the Efficiency by the Optimality and conversely, in the most general context of the ...
openaire +1 more source
This research work is devoted to the general Optimaliy presented inside the best appropriate environment of the Infinite Dimensional Ordered Vector Spaces, with its natural projections in the Vectorial Optimization. It is also a short but original scientific Survey on the Efficiency by the Optimality and conversely, in the most general context of the ...
openaire +1 more source
2016
A variety of applications of Satisfiability Modulo Theories SMT require finding a satisfying assignment which optimizes some user-given function. Optimization in the context of SMT is referred to as Optimization Modulo Theories OMT. Current OMT research is mostly dedicated to optimization in arithmetic domains.
Alexander Nadel, Vadim Ryvchin
openaire +2 more sources
A variety of applications of Satisfiability Modulo Theories SMT require finding a satisfying assignment which optimizes some user-given function. Optimization in the context of SMT is referred to as Optimization Modulo Theories OMT. Current OMT research is mostly dedicated to optimization in arithmetic domains.
Alexander Nadel, Vadim Ryvchin
openaire +2 more sources
Robustness in Deterministic Vector Optimization
Journal of Optimization Theory and Applications, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Morteza Rahimi, Majid Soleimani-Damaneh
openaire +3 more sources
Balanced Optimization with Vector Costs
SSRN Electronic Journal, 2016An instance of a balanced optimization problem with vector costs consists of a ground set X, a vector cost for every element of X, and a system of feasible subsets over X. The goal is to find a feasible subset that minimizes the spread (or imbalance) of values in every coordinate of the underlying vector costs.
Annette M. C. Ficker +2 more
openaire +1 more source
Duality in vector optimization
Mathematical Programming, 1983In this paper the problem dual to a convex vector optimization problem is defined. Under suitable assumptions, a weak, strong and strict converse duality theorem are proved. In the case of linear mappings the formulation of the dual is refined such that well-known dual problems of Gale, Kuhn and Tucker [8] and Isermann [12] are generalized by this ...
openaire +3 more sources
Duality in nonconvex vector optimization
Journal of Global Optimization, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Refail Kasimbeyli, Masoud Karimi
openaire +2 more sources

