Surrogate methods for linear inequalities

DOI10.1007/BF00940518MaRDI QIDQ1321147zbMATH OpenFDO

Authors S. O. Oko

Publication date 23 August 1994

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

manifoldsorthogonal projectionslinear combinationsactive constraintshyperplanessystem of inequalitieshalfspacessurrogate constraintsoutward normals

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• New iterative methods for linear inequalities
• Iterative method for solving the linear feasibility problem
• scientific article; zbMATH DE number 176468
• A primal-dual projection method for solving systems of linear inequalities

Cites work

• scientific article; zbMATH DE number 3630144 (Why is no real title available?)
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities

Cited in

(9)

• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
• Projection methods for the linear split feasibility problems
• Iterative method for solving the linear feasibility problem
• The Surrogate Matrix Methodology: A Priori Error Estimation
• Block-iterative surrogate projection methods for convex feasibility problems
• On the entropic regularization method for solving min-max problems with applications
• Entropic perturbation method for solving a system of linear inequalities
• A point positioning algorithm to determine whether convex regions bounded by multiple linear constraints are empty.
• scientific article; zbMATH DE number 176468 (Why is no real title available?)

This page was built for publication: Surrogate methods for linear inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1321147)