Results 261 to 270 of about 12,325 (304)
Some of the next articles are maybe not open access.
Rough convex cones and rough convex fuzzy cones
Soft Computing, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zuhua Liao, Juan Zhou
openaire +2 more sources
Convergent conic linear programming relaxations for cone convex polynomial programs
Operations Research Letters, 2017 In this paper we show that a hierarchy of conic linear programming relaxations of a cone-convex polynomial programming problem converges asymptotically under a mild well-posedness condition which can easily be checked numerically for polynomials. We also
Thai Doan Chuong, V Jeyakumar
exaly +2 more sources
Canadian Mathematical Bulletin, 1976
The study of general multiplier theorems (Kuhn-Tucker Conditions) for constrained optimization problems has led to extensions of the notion of a differentiable arc. Abadie [1], Varaiya [10], Guignard [5], Zlobec [11] and Massam [12] investigated the so called cone of tangent vectors to a point in a set for optimization purposes.
Borwein, J., O'Brien, R.
openaire +1 more source
The study of general multiplier theorems (Kuhn-Tucker Conditions) for constrained optimization problems has led to extensions of the notion of a differentiable arc. Abadie [1], Varaiya [10], Guignard [5], Zlobec [11] and Massam [12] investigated the so called cone of tangent vectors to a point in a set for optimization purposes.
Borwein, J., O'Brien, R.
openaire +1 more source
On calculating the normal cone to a finite union of convex polyhedra†
Optimization, 2008 The article provides formulae for calculating the limiting normal cone introduced by Mordukhovich to a finite union of convex polyhedra. In the first part, special cases of independent interest are considered (almost disjoint cones, halfspaces, orthants).
Henrion, René, Outrata, Jiří
exaly +2 more sources
On Cone-Efficiency, Cone-Convexity and Cone-Compactness
SIAM Journal on Applied Mathematics, 1978The properties of efficient (admissible) points of subsets of $R^n $ are discussed in the case when the space is ordered by a convex cone. It is demonstrated that the notion of cone-compactness (a generalization of compactness) is sufficient to guarantee the existence of an efficient point.
openaire +1 more source
Canonical Barriers on Convex Cones
Mathematics of Operations Research, 2014On the interior of a regular convex cone K in n-dimensional real space there exist two canonical Hessian metrics, the one generated by the logarithm of the characteristic function, and the Cheng-Yau metric. The former is associated with a self-concordant logarithmically homogeneous barrier on K, the universal barrier.
openaire +3 more sources
Continuity of cone-convex functions
Optimization Letters, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Issei Kuwano, Tamaki Tanaka
openaire +1 more source
Solidity indices for convex cones
Positivity, 2011The issue addressed in this work is how to measure the degree of solidity of a closed convex cone in the Euclidean space R n. One compares and establishes all sort of relations between the metric, the volumetric, and the Frobenius solidity indices.
Gourion, Daniel, Seeger, Alberto
openaire +3 more sources
On uniqueness cones, velocity cones andP-convexity
Annali di Matematica Pura ed Applicata, 1973Viene studiata l'unicita nel problema di Cauchy quando i coefficienti sono analitici. Il metodo e basato sull'uso dei coni di unicita. Un cono di unicita e il cono duale di un cono convesso e aperto di direzioni non-caratteristiche in un semi-spazio.
openaire +2 more sources