The Relaxation Method for Linear Inequalities

1954/01/01 by T. S. Motzkin, I. J. Schoenberg · 13 citations
Mathematics · Computer Science · #Advanced Optimization Algorithms Research #Optimization and Variational Analysis #Numerical methods in inverse problems

paper · pdf · doi:10.4153/cjm-1954-038-x

Abstract

Let A be a closed set of points in the n-dimensional euclidean space E n . If p and p 1 are points of E n such that 1.1 then p 1 is said to be point-wise closer than p to the set A. If p is such that there is no point p 1 which is point-wise closer than p to A , then p is called a closest point to the set A.

Cited by

• Smoothing methods for convex inequalities and linear complementarity problems
• T-SKM-Net: Trainable Neural Network Framework for Linear Constraint Satisfaction via Sampling Kaczmarz-Motzkin Method
• Extending Douglas-Rachford Splitting for Convex Optimization
• Greed Works: An Improved Analysis of Sampling Kaczmarz-Motzkin
• Randomized Kaczmarz for Tensor Linear Systems
• GPU-accelerated FREDopt package for simultaneous dose and LETd proton radiotherapy plan optimization via superiorization methods
• Revisiting Perceptron: Efficient and Label-Optimal Learning of Halfspaces
• Random iterations of paracontraction maps and applications to feasibility problems
• Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
• Convergence of Adaptive, Randomized, Iterative Linear Solvers
• On the Effectiveness of Projection Methods for Convex Feasibility Problems with Linear Inequality Constraints
• Variable Metric Quasi-Fejér Monotonicity
• Superiorization of projection algorithms for linearly constrained inverse radiotherapy treatment planning. [europepmc]

Related

• A note on some best proximity point theorems proved under P-property
• Improving proximity bounds using sparsity
• Fitting lines to points in the plane
• Nearly equal distances in the plane, II
• Arbitrarily Close