An algorithm for maximizing a convex function over a simple set (Q1918984): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3972966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global minimization of concave functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outer approximation by polyhedral convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post algebras as semantic bases of some many-valued logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained global optimization: algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of large-scale constrained concave quadratic problems by separable programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal conical algorithm for concave minimization over polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional bisection applied to global optimisation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02403999 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4250243394 / rank
 
Normal rank

Latest revision as of 09:33, 30 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for maximizing a convex function over a simple set
scientific article

    Statements

    Identifiers