A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation
نویسندگان
چکیده
منابع مشابه
Shrinkage estimation for convex polyhedral cones
Estimation of a multivariate normal mean is considered when the latter is known to belong to a convex polyhedron. It is shown that shrinking the maximum likelihood estimator towards an appropriate target can reduce mean squared error. The proof combines an unbiased estimator of a risk difference with some geometrical considerations. When applied to the monotone regression problem, the main resu...
متن کاملAn Algorithm for Finding All Extremal Rays of Polyhedral Convex Cones with Some Complementarity Conditions
In this paper, we show a method for finding all extremal rays of polyhedral convex cones with some complementarity conditions. The polyhedral convex cone is defined as the intersection of half-spaces expressed by linear inequalities. By a complementarity extremal ray, we mean an extremal ray vector that satisfies some complementarity conditions among its elen~nts. Our method is iterative in the...
متن کاملAn active index algorithm for the nearest point problem in a polyhedral cone
We consider the problem of finding the nearest point in a polyhedral cone C = {x ∈ Rn : Dx ≤ 0} to a given point b ∈ Rn, where D ∈ Rm×n. This problem can be formulated as a convex quadratic programming problem with special structure. We study the structure of this problem and its relationship with the nearest point problem in a pos cone through the concept of polar cones. We then use this relat...
متن کاملA critical index algorithm for nearest point problems on simplicial cones
We consider the linear complementarity problem (q, M) in which M is a positive definite symmetric matrix of order n. This problem is equivalent to a nearest point problem [/'; b] in which F = {A4, ..., A~} is a basis for R", b is a given point in R ' ; and it is required to find the nearest point in the simplicial cone Pos(F) to b. We develop an algorithm for solving the linear complementarity ...
متن کاملA Unifying Polyhedral Approximation Framework for Convex Optimization
We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, but also includes new methods and new versions/extensions of old methods, such as a simplicial decomposition method for nondifferentiable optimization and a new piecewise linear approximation method for convex single commodity ne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1976
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1976-0394439-5