A generalization of the construction of test problems for nonconvex optimization (Q1330804): 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: A level set algorithm for a class of reverse convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Successive Underestimation Method for Concave Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of large-scale global minimum concave quadratic test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of large-scale quadratic programs for use as global optimization test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A collection of test problems for constrained global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimum test problem construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01097001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976912467 / rank
 
Normal rank

Latest revision as of 09:06, 30 July 2024

scientific article
Language Label Description Also known as
English
A generalization of the construction of test problems for nonconvex optimization
scientific article

    Statements

    Identifiers