On the construction of test problems for concave minimization algorithms
From MaRDI portal
Publication:1342905
DOI10.1007/BF01096688zbMath0814.90098MaRDI QIDQ1342905
Publication date: 15 January 1995
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimizationconcave minimizationquasiconcave functiontest problemsconcave quadratic minimization
Related Items
A successive linear approximation algorithm for the global minimization of a concave quadratic program, Can linear programs be used to test global optimization algorithms?, On global optimality conditions and cutting plane algorithms, Global minimization algorithms for concave quadratic programming problems, Optimization methods for mixed integer weakly concave programming problems
Cites Work
- Unnamed Item
- Concave minimization via conical partitions and polyhedral outer approximation
- Active constraints, indefinite quadratic test problems, and complexity
- Constrained global optimization: algorithms and applications
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- A collection of test problems for constrained global optimization algorithms
- Generating quadratic assignment test problems with known optimal permutations
- Construction of large-scale global minimum concave quadratic test problems
- Generation of large-scale quadratic programs for use as global optimization test problems
- Construction of test problems in quadratic bivalent programming
- Global minimum test problem construction
