Newton's method for convex programming and Tschebyscheff approximation (Q1131571): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q97724060, #quickstatements; #temporary_batch_1712260040974
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5828400 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3229784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über diskrete und lineare Tschebyscheff-Approximationen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity Maps for Convex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4753788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebychev Approximation in Locally Compact Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm for the solution of consistent linear equations and inequalities and for the Tchebycheff approximation of inconsistent linear equations / rank
 
Normal rank

Latest revision as of 20:14, 11 June 2024

scientific article
Language Label Description Also known as
English
Newton's method for convex programming and Tschebyscheff approximation
scientific article

    Statements