Pages that link to "Item:Q3778553"
From MaRDI portal
The following pages link to A class of exhaustive cone splitting procedures in conical algorithms for concave minmization (Q3778553):
Displaying 15 items.
- A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- A conical algorithm for solving a class of complementarity problems (Q1089269) (← links)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
- Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms (Q1177911) (← links)
- A simplified convergence proof for the cone partitioning algorithm (Q1281480) (← links)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
- Constraint decomposition algorithms in global optimization (Q1342897) (← links)
- Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization (Q1862178) (← links)
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts (Q1888145) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- On geometry and convergence of a class of simplicial covers (Q4327931) (← links)
