A Simultaneous Iterative Method for Computing Projections on Polyhedra

DOI10.1137/0325014zbMath0621.90061OpenAlexW2106604713MaRDI QIDQ3758566

Alvaro Rodolfo de Pierro, Alfredo Noel 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

zbMATH Keywords

least squaresnorm minimizationHildreth's algorithmlinearly constrained quadratic optimizationprojections of polyhedra

Mathematics Subject Classification ID

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

Related Items (24)

A row-action method for convex programming ⋮ Asymptotically optimal row-action methods for generalized least squares problems ⋮ A parallel relaxation method for quadratic programming problems with interval constraints ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ A parallel projection method for solving generalized linear least-squares problems ⋮ Interval underrelaxed bregman's method with an application ⋮ How good are projection methods for convex feasibility problems? ⋮ On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra ⋮ A conjugate gradient algorithm for sparse linear inequalities ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ The direct-projection methods ⋮ A row relaxation method for large \(l_ 1\) problems ⋮ Generalization: One technique of computational and applied mathematical methodology ⋮ On the convergence of Han's method for convex programming with quadratic objective ⋮ Solution of projection problems over polytopes ⋮ The \(\ell_1\) solution of linear inequalities ⋮ A row relaxation method for large minimax problems ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ On the convergence properties of Hildreth's quadratic programming algorithm ⋮ Relaxed outer projections, weighted averages and convex feasibility ⋮ Block-iterative projection methods for parallel computation of solutions to convex feasibility problems ⋮ On perturbed steepest descent methods with inexact line search for bilevel convex optimization ⋮ On the convergence of SOR- and JOR-type methods for convex linear complementarity problems

This page was built for publication: A Simultaneous Iterative Method for Computing Projections on Polyhedra