Pages that link to "Item:Q1918288"
From MaRDI portal
The following pages link to Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288):
Displaying 10 items.
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- On the global optimization of sums of linear fractional functions over a convex set (Q704748) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
- Polyhedral annexation vs outer approximation for the decomposition of monotonic quasiconcave minimization problems (Q1376657) (← links)
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks (Q1384224) (← links)
- Continuous relaxation for discrete DC programming (Q1749451) (← links)
- Global optimization for the sum of concave-convex ratios problem (Q2336807) (← links)
- Biconvex sets and optimization with biconvex functions: a survey and extensions (Q2465382) (← links)
- A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
