An iterative row-action method for interval convex programming
type: Item
instance of: scholarly article
title: An iterative row-action method for interval convex programming
zbMATH Open document ID: 0431.49042
DOI: 10.1007/BF00934676
author: Yair Censor
author: Arnold Lent
published in: Journal of Optimization Theory and Applications
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C55
Mathematics Subject Classification ID: 65G30
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 3671208
zbMATH Keywords: interval convex programming
zbMATH Keywords: entropy optimization
zbMATH Keywords: large and sparse matrices
zbMATH Keywords: nonorthogonal projections
zbMATH Keywords: image reconstruction from projections
MaRDI profile type: Publication
cites work: An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
cites work: A suboptimization method for interval linear programming: A new method for linear programming
cites work: Q4171875
cites work: Relaxation methods for image reconstruction
cites work: Q5580053
cites work: Extensions of Hildreth’s Row-Action Method for Quadratic Programming
cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications
cites work: Convex Analysis
cites work: Q5603731
cites work: Seven Kinds of Convexity
cites work: Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
cites work: Q5629139
full work available at URL: https://doi.org/10.1007/bf00934676
OpenAlex ID: W1984958640
description: scientific article; zbMATH DE number 3671208