Generalized projections onto convex sets
From MaRDI portal
Publication:427407
DOI10.1007/S10898-011-9714-1zbMath1268.90045OpenAlexW2039410269MaRDI QIDQ427407
Orizon P. Ferreira, Sándor Zoltan Németh
Publication date: 13 June 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-011-9714-1
Related Items (4)
Convexity of generalized proximinal sets in Banach spaces ⋮ The representation and continuity of a generalized metric projection onto a closed hyperplane in Banach spaces ⋮ Characterizations of generalized proximinal subspaces in real Banach spaces ⋮ Isotonicity of the metric projection with respect to the mutually dual orders and complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterization of latticial cones in Hilbert spaces by isotonicity and generalized infimum
- How to project onto an isotone projection cone
- Isotone retraction cones in Hilbert spaces
- Monotonicity of metric projection onto positive cones of ordered Euclidean spaces
- Arbitrary-norm separating plane
- Theorems of the alternative and duality
- Generalized projections for non-negative functions
- Globally optimal solutions of max-min systems
- A finite steps algorithm for solving convex feasibility problems
- Incomplete oblique projections for solving large inconsistent linear systems
- The distance between two convex sets
- Iterative methods for nonlinear complementarity problems on isotone projection cones
- Dual Cones, Dual Norms, and Simultaneous Inference for Partially Ordered Means
- Optimal Expected-Distance Separating Halfspace
- An Algorithm for Restricted Least Squares Regression
- On Diagonally Relaxed Orthogonal Projection Methods
- A Block Projection Method for Sparse Matrices
- On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
- Polyhedral Boundary Projection
- On Projection Algorithms for Solving Convex Feasibility Problems
- Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem
- A Proximal-Projection Method for Finding Zeros of Set-Valued Operators
- Convex Analysis
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
- Gauge distances and median hyperplanes
This page was built for publication: Generalized projections onto convex sets
