Simplicial Decomposition for Convex Generalized Networks (Q4712275): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Projected Newton Methods for Optimization Problems with Simple Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reporting computational experiments in mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: OR Practice—Large-Scale Nonlinear Network Models and Their Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Large-Scale Mathematical Programming Part I: Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite algorithm to maximize certain pseudoconcave functions on polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial decomposition in nonlinear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the frank and Wolfe method of feasible directions / rank
 
Normal rank
Property / cites work
 
Property / cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large Scale Generalized Networks / rank
 
Normal rank

Latest revision as of 09:36, 15 May 2024

scientific article; zbMATH DE number 6370
Language Label Description Also known as
English
Simplicial Decomposition for Convex Generalized Networks
scientific article; zbMATH DE number 6370

    Statements

    Simplicial Decomposition for Convex Generalized Networks (English)
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    large scale nonlinear programs
    0 references
    generalized network constraints
    0 references
    simplicial decomposition
    0 references
    forcing sequence strategy
    0 references
    quasi-Newton algorithm
    0 references
    0 references