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 (Q1214064): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0021-9045(75)90067-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029096605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative method, having linear rate of convergence, for solving a pair of dual linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Pseudo-Gradientenverfahren zur Lösung des diskreten linearen Tschebyscheff-Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Homogeneous Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN APPLICATION OF THE METHOD OF STEEPEST DESCENTS TO THE SOLUTION OF SYSTEMS OF NON-LINEAR SIMULTANEOUS EQUATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3846725 / rank
 
Normal rank

Latest revision as of 15:03, 12 June 2024

scientific article
Language Label Description Also known as
English
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
scientific article

    Statements

    Identifiers