Results 331 to 340 of about 6,795,119 (352)
Some of the next articles are maybe not open access.
Convex (s,t]-fuzzy sets and convex R -fuzzy sets
2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE), 2010Following the Rosedfeld approach in investigating convex fuzzy sets, two new kinds of definitions of convex fuzzy sets are proposed in this paper. First, by the use of the relations between fuzzy points and fuzzy subsets, the definition of a convex (s,t]-fuzzy sets is introduced and their properties are discussed.
openaire +2 more sources
A necessary and sufficient criterion for the stability of a convex set of matrices
IEEE Transactions on Automatic Control, 1993A Hurwitz stability criterion for the convex hull of two matrices, due to C.R. Johnson (1976), is generalized to the case of any compact convex set of matrices. It is shown that the same criterion is not available in the case of Schur stability. >
Noy Cohen, I. Lewkowicz
semanticscholar +1 more source
Convex sets and their representation
2008The purpose of this section is to remind the reader essential notions about convex sets and functions which will be useful in the sequel. For a more detailed exposition on convexity, the reader is referred to specialized literature (Rockafellar, Convex analysis, Princeton University Press, Princeton, 1970; Rockafellar and Wets, Variational analysis ...
Franco Blanchini, Stefano Miani
openaire +2 more sources
On the Estimation of a Convex Set from Noisy Data on its Support Function
, 1997In problems of medical imaging and robotic vision, measurements of a convex set are sometimes obtained via the set's support function. The standard way in which the convex set is recovered from such data is to suppose that it is polygonal, model the ...
N. Fisher +3 more
semanticscholar +1 more source
Convex Sets and Convex Programming
1981In this chapter we concentrate on properties of convex sets in a Hilbert space and some of the related problems of importance in application to convex programming: variational problems for convex functions over convex sets, central to which are the Kuhn-Tucker theorem and the minimax theorem of von Neumann, which in turn are based on the “separation ...
openaire +2 more sources
Structural And Multidisciplinary Optimization, 2018
Fangyi Li, Jie Liu, G. Wen, J. Rong
semanticscholar +1 more source
Fangyi Li, Jie Liu, G. Wen, J. Rong
semanticscholar +1 more source
Convex feasible set algorithm for constrained trajectory smoothing
American Control Conference, 2017Changliu Liu +3 more
semanticscholar +1 more source
On selections of generalized convex set-valued maps
, 2014D. Inoan, D. Popa
semanticscholar +1 more source
A convex variational level set model for image segmentation
Signal Processing, 2015Yongfei Wu, Chuanjiang He
semanticscholar +1 more source
Note: An algorithm to solve polyhedral convex set optimization problems
, 2013Andreas Löhne, Carola Schrage
semanticscholar +1 more source