Partially finite convex programming. II: Explicit lattice models (Q1198329): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56935956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrange multiplier theorem and a sandwich theorem for convex relations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Continuity and Openness of Convex Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Relationships for Entropy-Like Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple constraint qualification in infinite dimensional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3704489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Partitioning Problem with Applications in Regional Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 'best' interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and well-posedness in convex interpolation<sup>∗)</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur l'interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some duality relationships for the generalized Neyman-Pearson problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4104377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained interpolation and smoothing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5534404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-infinite transportation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generalized Market Area Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained \(L_ p\) approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrals which are convex functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4049667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Solving the Generalized Market Area Problem / rank
 
Normal rank

Latest revision as of 16:00, 16 May 2024

scientific article
Language Label Description Also known as
English
Partially finite convex programming. II: Explicit lattice models
scientific article

    Statements

    Partially finite convex programming. II: Explicit lattice models (English)
    0 references
    0 references
    16 January 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    \(L^ 1\) approximation
    0 references
    constrained approximation
    0 references
    interpolation
    0 references
    spectral estimation
    0 references
    0 references
    0 references
    0 references