Some characterizations of ideal points in vector optimization problems.
Chai, Yan-Fei, Cho, Yeol Je, Li, Jun (2008)
Journal of Inequalities and Applications [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Chebyshev inequalities and self-dual cones.”
Some characterizations of ideal points in vector optimization problems.
Diagonals of convex sets
Miroslav Fiedler, Vlastimil Pták (1978)
Czechoslovak Mathematical Journal
Similarity:
The barrier cone of a convex set and the closure of the cover.
Bair, J., Dupin, J.C. (1999)
Journal of Convex Analysis
Similarity:
An extension of results of A. McD. Mercer and I. Gavrea.
Niezgoda, Marek (2005)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Hermite-Hadamard-type inequalities for generalized convex functions.
Bessenyei, Mihály (2008)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Generalized vector complementarity problems with moving cones.
Ceng, Lu-Chuan, Lin, Yen-Cherng (2009)
Journal of Inequalities and Applications [electronic only]
Similarity:
The facial structure of the finite dimensional latticial cone.
Németh, A.B. (2004)
Mathematica Pannonica
Similarity:
A note on Gordan's theorem over cone domains.
Skarpness, Brad, Sposito, V.A. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Numerical behavior of the method of projection onto an acute cone with level control in convex minimization
Robert Dylewski (2000)
Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Similarity:
We present the numerical behavior of a projection method for convex minimization problems which was studied by Cegielski [1]. The method is a modification of the Polyak subgradient projection method [6] and of variable target value subgradient method of Kim, Ahn and Cho [2]. In each iteration of the method an obtuse cone is constructed. The obtuse cone is generated by a linearly independent system of subgradients. The next approximation of a solution is the projection onto a translated...
A review of selected topics in majorization theory
Marek Niezgoda (2013)
Banach Center Publications
Similarity:
In this expository paper, some recent developments in majorization theory are reviewed. Selected topics on group majorizations, group-induced cone orderings, Eaton triples, normal decomposition systems and similarly separable vectors are discussed. Special attention is devoted to majorization inequalities. A unified approach is presented for proving majorization relations for eigenvalues and singular values of matrices. Some methods based on the Chebyshev functional and similarly separable...
-cones and potential theory
Nicu Boboc, Gheorghe Bucur, A. Cornea (1975)
Annales de l'institut Fourier
Similarity:
The -cone is an abstract model for the cone of positive superharmonic functions on a harmonic space or for the cone of excessive functions with respect to a resolvent family, having sufficiently many properties in order to develop a good deal of balayage theory and also to construct a dual concept which is also an -cone. There are given an integral representation theorem and a representation theorem as an -cone of functions for which fine topology, thinnes, negligible sets and the...