Variable metric methods for linearly constrained nonlinear minimax approximation (Q1051247): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Rank-one and Rank-two Corrections to Positive Definite Matrices Expressed in Product Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable form of the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton-type methods for unconstrained and linearly constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined lp and quasi-Newton methods for minimax optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3660803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearly constrained minimax optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection methods for non-linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nearest point in A polytope / rank
 
Normal rank

Revision as of 09:26, 14 June 2024

scientific article
Language Label Description Also known as
English
Variable metric methods for linearly constrained nonlinear minimax approximation
scientific article

    Statements

    Variable metric methods for linearly constrained nonlinear minimax approximation (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    linearly constrained optimization
    0 references
    nondifferentiable optimization
    0 references
    nonlinear minimax approximation
    0 references
    variable metric methods
    0 references
    0 references