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
type: Item
instance of: scholarly article
title: 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
zbMATH Open document ID: 0297.41015
DOI: 10.1016/0021-9045(75)90067-2
published in: Journal of Approximation Theory
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 41A50
zbMATH DE Number: 3465892
author: Werner Oettli
MaRDI profile type: Publication
full work available at URL: 0021-9045(75)90067-2
OpenAlex ID: W2029096605
cites work: An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
cites work: Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems
cites work: Q3236244
cites work: Duality in Homogeneous Programming
cites work: AN APPLICATION OF THE METHOD OF STEEPEST DESCENTS TO THE SOLUTION OF SYSTEMS OF NON-LINEAR SIMULTANEOUS EQUATIONS
cites work: Minimization of unsmooth functionals
cites work: Q3846725
description: scientific article; zbMATH DE number 3465892