A Simultaneous Iterative Method for Computing Projections on Polyhedra
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 999656
- Finding the projection on a polytope: An iterative method
- scientific article; zbMATH DE number 3945874
- A parallel algorithm for constructing projection polyhedra
- An iteration method of constructing orthogonal projections of convex polyhedral sets
- A big-M type method for the computation of projections onto polyhedrons
- Computing Nice Projections of Convex Polyhedra
- Computing nice projections of convex polyhedra
- An Exact Algorithm for Projection onto a Polyhedral Cone
Cited in
(35)- A hybrid algorithm for solving linear inequalities in a least squares sense
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- A parallel projection method for solving generalized linear least-squares problems
- A row relaxation method for large \(l_ 1\) problems
- On the convergence of Han's method for convex programming with quadratic objective
- Solution of projection problems over polytopes
- A row-action method for convex programming
- Finding the projection on a polytope: An iterative method
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- A parallel relaxation method for quadratic programming problems with interval constraints
- Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface
- How good are projection methods for convex feasibility problems?
- Computational acceleration of projection algorithms for the linear best approximation problem
- The direct-projection methods
- A comprehensive analysis of polyhedral lift-and-project methods
- Projection onto a polyhedron that exploits sparsity
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- scientific article; zbMATH DE number 999656 (Why is no real title available?)
- scientific article; zbMATH DE number 3872172 (Why is no real title available?)
- Sinc Methods on Polyhedra
- Improved projection for CAD's of R 3
- Asymptotically optimal row-action methods for generalized least squares problems
- scientific article; zbMATH DE number 1163557 (Why is no real title available?)
- A three dimensional surface-to-surface projection algorithm for non-coincident domains
- Interval underrelaxed bregman's method with an application
- On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra
- A row relaxation method for large minimax problems
- On the convergence properties of Hildreth's quadratic programming algorithm
- Relaxed outer projections, weighted averages and convex feasibility
- A big-M type method for the computation of projections onto polyhedrons
- On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
- A conjugate gradient algorithm for sparse linear inequalities
- Generalization: One technique of computational and applied mathematical methodology
- The _1 solution of linear inequalities
This page was built for publication: A Simultaneous Iterative Method for Computing Projections on Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3758566)
