A Simultaneous Iterative Method for Computing Projections on Polyhedra

DOI10.1137/0325014zbMATH Open0621.90061OpenAlexW2106604713MaRDI QIDQ3758566FDOQ3758566

Álvaro Rodolfo De Pierro, Alfredo Iusem

Publication date: 1987

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0325014

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

least squares norm minimization Hildreth's algorithm linearly constrained quadratic optimization projections of polyhedra

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited In (33)

A three dimensional surface-to-surface projection algorithm for non-coincident domains
A row relaxation method for large minimax problems
The \(\ell_1\) solution of linear inequalities
Computational acceleration of projection algorithms for the linear best approximation problem
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
Sinc Methods on Polyhedra
On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
Hybrid second-order iterative algorithm for orthogonal projection onto a parametric surface
A parallel projection method for solving generalized linear least-squares problems
A row relaxation method for large \(l_ 1\) problems
Asymptotically optimal row-action methods for generalized least squares problems
A hybrid algorithm for solving linear inequalities in a least squares sense
Projection onto a polyhedron that exploits sparsity
A parallel relaxation method for quadratic programming problems with interval constraints
Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
Relaxed outer projections, weighted averages and convex feasibility
On perturbed steepest descent methods with inexact line search for bilevel convex optimization
On the convergence of Han's method for convex programming with quadratic objective
Title not available (Why is that?)
On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra
Solution of projection problems over polytopes
Improved projection for CAD's of R ³
A row-action method for convex programming
The direct-projection methods
A comprehensive analysis of polyhedral lift-and-project methods
A conjugate gradient algorithm for sparse linear inequalities
How good are projection methods for convex feasibility problems?
Title not available (Why is that?)
Generalization: One technique of computational and applied mathematical methodology
A big-M type method for the computation of projections onto polyhedrons
Interval underrelaxed bregman's method with an application
On the convergence properties of Hildreth's quadratic programming algorithm
Parallel application of block-iterative methods in medical imaging and radiation therapy

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)