Results 161 to 170 of about 267,340 (205)

Proximal Methods in Vector Optimization

SIAM Journal on Optimization, 2005
Summary: 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, Alfredo N. Iusem, Benar Fux Svaiter   +2 more
openaire   +2 more sources

Regularity Conditions in Vector Optimization

Journal of Optimization Theory and Applications, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BIGI, GIANCARLO, PAPPALARDO, MASSIMO
openaire   +3 more sources

Optimal vector transform for vector quantization

IEEE Signal Processing Letters, 1994
The 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

Robustness in Deterministic Vector Optimization

Journal of Optimization Theory and Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Morteza Rahimi, Majid Soleimani-Damaneh
openaire   +2 more sources

Balanced Optimization with Vector Costs

SSRN Electronic Journal, 2016
An 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, Frits C. R. Spieksma, Gerhard J. Woeginger   +2 more
openaire   +1 more source

Bit-Vector Optimization

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   +1 more source

Optimality in Vector Spaces

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

Duality in vector optimization

Mathematical Programming, 1983
In 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   +2 more sources

Optimizing C++ Vector Expressions

IEEE Computer Graphics and Applications, 2000
Recently, I've been entertaining myself by studying all the nifty new programming techniques that have been invented since I was in school. I started with C++ and object-oriented programming. I'm now progressing through generic programming, aspect-oriented programming, partial evaluation and generative programming.
openaire   +1 more source

On Second-Order Optimality Conditions for Vector Optimization

Journal of Optimization Theory and Applications, 2011
A vector optimization problem (VOP) is considered. The feasible set is stated by means of equality and inequality constraints. Two constraint qualifications has been borrowed from the scalar case and used for VOP. The first one (Kuhn-Tucker constraint qualification KTCQ) is based on a feasible arc and implies that the set of feasible and descent ...
María Cristina Maciel, Sandra A. Santos 0001, Graciela N. Sottosanto   +2 more
openaire   +2 more sources