Approximate cutting planes in nonlinear programming (Q4121700): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591247 / rank
 
Normal rank

Latest revision as of 20:55, 12 June 2024

scientific article; zbMATH DE number 3547065
Language Label Description Also known as
English
Approximate cutting planes in nonlinear programming
scientific article; zbMATH DE number 3547065

    Statements

    Approximate cutting planes in nonlinear programming (English)
    0 references
    0 references
    1976
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references