A superlinearly convergent method for minimization problems with linear inequality constraints (Q5674331): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Variable Metric Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rapidly Convergent Descent Method for Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5806966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Convex Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639534 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:47, 12 June 2024

scientific article; zbMATH DE number 3408828
Language Label Description Also known as
English
A superlinearly convergent method for minimization problems with linear inequality constraints
scientific article; zbMATH DE number 3408828

    Statements

    A superlinearly convergent method for minimization problems with linear inequality constraints (English)
    0 references
    1973
    0 references
    0 references

    Identifiers