A finite algorithm to maximize certain pseudoconcave functions on polytopes (Q4086973): 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: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Finite Algorithms for Solving Quasiconvex Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and optimal portfolios by homogeneous programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial decomposition in nonlinear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5564917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5591247 / rank
 
Normal rank

Revision as of 17:23, 12 June 2024

scientific article; zbMATH DE number 3506452
Language Label Description Also known as
English
A finite algorithm to maximize certain pseudoconcave functions on polytopes
scientific article; zbMATH DE number 3506452

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references