Results 271 to 280 of about 709,020 (315)

An Optimal Set of Discriminant Vectors

IEEE Transactions on Computers, 1975
A new method for the extraction of features in a two-class pattern recognition problem is derived. The main advantage is that the method for selecting features is based entirely upon discrimination or separability as opposed to the more common approach of fitting.
Donald H. Foley, John W. Sammon Jr.
openaire   +1 more source

Vectorization in Set Optimization

Journal of Optimization Theory and Applications, 2013
This 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   +2 more sources

Nonseparation of Sets and Optimality Conditions

SIAM Journal on Control and Optimization, 2017
Summary: Two new concepts of uniform approximating cones are introduced and discussed. The main result is a theorem for nonseparability of two closed sets. As an application of this result, an abstract Lagrange multiplier rule and a necessary optimality condition of Pontryagin maximum principle type for an optimal control problem in infinite ...
Mikhail Ivanov Krastanov, N. K. Ribarska
openaire   +2 more sources

Set optimization of set-valued risk measures

Annals of Operations Research, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elisa Mastrogiacomo, Matteo Rocca
openaire   +2 more sources

OPTIMAL SETS OF CANDIDATES

Economics & Politics, 2006
We consider the optimal choice set of candidates standing for elected office. The decision dimensions are in the number of candidates standing for election, the experiential base of the candidates standing for election as measured by the length of prior experience held by the candidates, and the proportion of candidates with such prior experience.
openaire   +1 more source

The Setting and Optimization of Quick Queue

Journal of Optimization Theory and Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kai Li 0019, Yuqian Pan, Bayi Cheng, Bo-hai Liu   +3 more
openaire   +1 more source

On optimizing the evaluation of a set of expressions

International Journal of Computer & Information Sciences, 1982
A branch- and-bound type algorithm is developed to optimize the evaluation of a set of expressions. The algorithm proceeds in a depth-first manner and achieves an optimal solution. The algorithm is applied to optimize the evaluation of sets of relational expressions.
John Grant, Jack Minker
openaire   +1 more source

On the Selection of an Optimal Set of Indexes

IEEE Transactions on Software Engineering, 1983
A problem of considerable interest in the design of a database is the selection of indexes. In this paper, we present a probabilistic model of transactions (queries, updates, insertions, and deletions) to a file. An evaluation function, which is based on the cost saving (in terms of the number of page accesses) attributable to the use of an index set ...
Maggie Y. L. Ip, Lawrence V. Saxton, Vijay V. Raghavan 0001   +2 more
openaire   +1 more source

Optimality conditions for set-valued maps with set optimization

Nonlinear Analysis: Theory, Methods & Applications, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alonso, María, Rodríguez-Marín, Luis
openaire   +1 more source

An Asymptotically Optimal Set Approach for Simulation Optimization

INFORMS Journal on Computing, 2019
We propose an asymptotically optimal set (AOS) approach for solving stochastic optimization problems with discrete or continuous feasible regions. Our AOS approach is a framework for designing provably convergent algorithms that are adaptive in seeking new points and in resampling or discarding already sampled points.
Liujia Hu, Sigrún Andradóttir
openaire   +2 more sources