Pages that link to "Item:Q1321233"
From MaRDI portal
The following pages link to Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233):
Displaying 14 items.
- A cone constrained convex program: structure and algorithms (Q384210) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- A conical algorithm for solving a class of complementarity problems (Q1089269) (← 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)
- Sufficient conditions for solving linearly constrained separable concave global minimization problems (Q1207045) (← links)
- Constraint decomposition algorithms in global optimization (Q1342897) (← links)
- Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
- Maximizing a concave function over the efficient or weakly-efficient set (Q1847166) (← links)
- An algebra-based approach for linearly constrained concave minimization (Q1876470) (← links)
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts (Q1888145) (← links)
- Decomposition approach for the global minimization of biconcave functions over polytopes (Q1918288) (← links)
- A global \(\mathbb{R}\)-linear convergence algorithm for the generalized linear complementarity problem over a closed convex cone (Q2793081) (← links)
- Convex and concave relaxations of implicit functions (Q2943829) (← links)
