AbstractGiven a closed convex cone C in a Hilbert space H, we investigate the function which assigns to each point x in H the nearest point of C to x. We call this function the projection of H onto C and we give an algebraic characterization of this function which generalizes the well-known characterization of a projection onto a closed subspace as an idempotent, symmetric linear operator
Suppose T is a continuous linear operator between two Hilbert spaces X and Y and let K be a closed ...
AbstractThe Schur–Horn Convexity Theorem states that forain Rnp({U*diag(a)U:U∈U(n)})=conv(Sna),where...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
AbstractGiven a closed convex cone C in a Hilbert space H, we investigate the function which assigns...
Let k be a fixed natural number. We show that if C is a closed and nonconvex set in Hilbert space su...
Let k be a fixed natural number. In an earlier paper the authors show that if C is a closed and nonc...
The author proves that the closed convex cones in a Hilbert space form an ortholattice (with the ord...
Let C(H) denote the class of closed convex cones in a Hilbert space H. One possible way of measuring...
Let k be a fixed natural number. In an earlier paper the authors show that if C is a closed and nonc...
Let A be a linear space of operators on a Hilbert space H, x a vector in H,and Ax the subspace of H ...
AbstractThe problem considered is that of characterizing the best approximation, to a given x in a H...
AbstractIn this paper, we investigate new properties of the generalized projection operators on conv...
AbstractThis paper concerns a problem of minimization of a quadratic functional on a cone in a Hilbe...
Suppose T is a continuous linear operator between two Hilbert spaces X and Y and let K be a closed c...
Alternating projection onto convex sets is powerful tool for signal and image restoration. The exten...
Suppose T is a continuous linear operator between two Hilbert spaces X and Y and let K be a closed ...
AbstractThe Schur–Horn Convexity Theorem states that forain Rnp({U*diag(a)U:U∈U(n)})=conv(Sna),where...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
AbstractGiven a closed convex cone C in a Hilbert space H, we investigate the function which assigns...
Let k be a fixed natural number. We show that if C is a closed and nonconvex set in Hilbert space su...
Let k be a fixed natural number. In an earlier paper the authors show that if C is a closed and nonc...
The author proves that the closed convex cones in a Hilbert space form an ortholattice (with the ord...
Let C(H) denote the class of closed convex cones in a Hilbert space H. One possible way of measuring...
Let k be a fixed natural number. In an earlier paper the authors show that if C is a closed and nonc...
Let A be a linear space of operators on a Hilbert space H, x a vector in H,and Ax the subspace of H ...
AbstractThe problem considered is that of characterizing the best approximation, to a given x in a H...
AbstractIn this paper, we investigate new properties of the generalized projection operators on conv...
AbstractThis paper concerns a problem of minimization of a quadratic functional on a cone in a Hilbe...
Suppose T is a continuous linear operator between two Hilbert spaces X and Y and let K be a closed c...
Alternating projection onto convex sets is powerful tool for signal and image restoration. The exten...
Suppose T is a continuous linear operator between two Hilbert spaces X and Y and let K be a closed ...
AbstractThe Schur–Horn Convexity Theorem states that forain Rnp({U*diag(a)U:U∈U(n)})=conv(Sna),where...
AbstractThe asymptotic duality theory of linear programming over closed convex cones [4] is extended...
DOI
Add to ORKG