Global minimization algorithms for concave quadratic programming problems (Q3534648): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient global optimality conditions for convex maximization revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for maximizing a convex function over a simple set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for Global Concave Minimization: A Bibliographic Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of test problems for concave minimization algorithms / rank
 
Normal rank

Latest revision as of 18:40, 28 June 2024

scientific article
Language Label Description Also known as
English
Global minimization algorithms for concave quadratic programming problems
scientific article

    Statements

    Identifiers