A primal-dual projection method for solving systems of linear inequalities

DOI10.1016/0024-3795(85)90086-2zbMath0564.65044OpenAlexW2010015872MaRDI QIDQ1058270

Jonathan E. Spingarn

Publication date: 1985

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(85)90086-2

zbMATH Keywords

projection methodslinear inequalitiesrelaxation methodsdual solution

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Linear inequalities of matrices (15A39)

Related Items

On the order of the operators in the Douglas-Rachford algorithm ⋮ On Slater's condition and finite convergence of the Douglas-Rachford algorithm for solving convex feasibility problems in Euclidean spaces ⋮ Conic optimization via operator splitting and homogeneous self-dual embedding ⋮ An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems ⋮ A finitely convergent ``row-action method for the convex feasibility problem ⋮ A parallel projection method for solving generalized linear least-squares problems ⋮ Finding best approximation pairs relative to two closed convex sets in Hilbert spaces ⋮ Finite convergence of the partial inverse algorithm ⋮ A primal-dual algorithm for the fermat-weber problem involving mixed gauges ⋮ Local linear convergence of approximate projections onto regularized sets ⋮ On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators ⋮ Relaxed outer projections, weighted averages and convex feasibility ⋮ A projection method for least-squares solutions to overdetermined systems of linear inequalities ⋮ The cluster set of a nonexpansive mapping ⋮ Applications of the method of partial inverses to convex programming: Decomposition

Cites Work

• Partial inverse of a monotone operator
• Monotone (nonlinear) operators in Hilbert space
• The limiting Lagrangian as a consequence of Helly's theorem
• Theorems on the dimensions of convex sets
• A projection method for least-squares solutions to overdetermined systems of linear inequalities
• The multiplier method of Hestenes and Powell applied to convex programming
• Applications of the method of partial inverses to convex programming: Decomposition
• The Relaxation Method for Solving Systems of Linear Inequalities
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Proximité et dualité dans un espace hilbertien
• The general theory of relaxation methods applied to linear systems
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A primal-dual projection method for solving systems of linear inequalities