A class of programming problems whose objective function contains a norm
type: Item
instance of: scholarly article
title: A class of programming problems whose objective function contains a norm
zbMATH Open document ID: 0398.41019
DOI: 10.1016/0021-9045(78)90091-6
published in: Journal of Approximation Theory
publication date: 1978-01-01T00:00:00Z
Mathematics Subject Classification ID: 41A50
Mathematics Subject Classification ID: 41A29
Mathematics Subject Classification ID: 41A65
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3618718
zbMATH Keywords: Programming Problems
zbMATH Keywords: Constrained Best Approximation Problems
zbMATH Keywords: Optimization Algorithms
author: G. A. Watson
MaRDI profile type: Publication
full work available at URL: 0021-9045(78)90091-6
OpenAlex ID: W2011986332
cites work: On an algorithm for best approximate solutions to Av=b in normed linear spaces
cites work: Algorithms for solving the dual problem for Av = b with varying norms
cites work: Q5543516
cites work: Q5588268
cites work: Q5543004
cites work: A class of nondifferentiable mathematical programming problems
cites work: A programming problem with an Lp norm in the objective function
cites work: Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
cites work: Q5638112
cites work: Solutions of overdetermined linear equations which minimize error in an abstract norm
cites work: Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
description: scientific article; zbMATH DE number 3618718