The barrier cone of a convex set and the closure of the cover.
Bair, J., Dupin, J.C. (1999)
Journal of Convex Analysis
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.
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.
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 “Some characterizations of ideal points in vector optimization problems.”
The barrier cone of a convex set and the closure of the cover.
Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity.
Qiu, Qiusheng (2009)
Journal of Inequalities and Applications [electronic only]
Similarity:
A note on Gordan's theorem over cone domains.
Skarpness, Brad, Sposito, V.A. (1982)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps.
Xu, Y.D., Li, S.J. (2011)
Journal of Inequalities and Applications [electronic only]
Similarity:
Diagonals of convex sets
Miroslav Fiedler, Vlastimil Pták (1978)
Czechoslovak Mathematical Journal
Similarity:
Optimality conditions of vector set-valued optimization problem involving relative interior.
Zhou, Zhiang (2011)
Journal of Inequalities and Applications [electronic only]
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...
Optimality conditions for approximate solutions in multiobjective optimization problems.
Gao, Ying, Yang, Xinmin, Lee, Heung Wing Joseph (2010)
Journal of Inequalities and Applications [electronic only]
Similarity:
-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...