Pages that link to "Item:Q1342905"
From MaRDI portal
The following pages link to On the construction of test problems for concave minimization algorithms (Q1342905):
Displaying 12 items.
- Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
- A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
- The minimax direction for the direct product of a convex cone with its application to testing problems (Q1192417) (← links)
- Construction of test problems for concave minimization under linear and nonlinear constraints (Q1265043) (← links)
- A generalization of the construction of test problems for nonconvex optimization (Q1330804) (← links)
- Construction of test problems for a class of reverse convex programs (Q1331094) (← links)
- Can linear programs be used to test global optimization algorithms? (Q1365543) (← links)
- On global optimality conditions and cutting plane algorithms (Q1407243) (← links)
- Global minimization algorithms for concave quadratic programming problems (Q3534648) (← links)
- Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems (Q3686435) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- NP-hard problems and test problems for global concave minimization methods (Q3991501) (← links)
