A convergent simplicial algorithm with ω-subdivision and ω-bisection strategies
Year of publication: |
2012
|
---|---|
Authors: | Kuno, Takahito ; Buckland, Paul |
Published in: |
Journal of Global Optimization. - Springer. - Vol. 52.2012, 3, p. 371-390
|
Publisher: |
Springer |
Subject: | Global optimization | Convex maximization | Branch-and-bound | Simplicial algorithm | Subdivision strategy |
-
An algorithm for maximizing a convex function based on its minimum
Ben-Tal, Aharon, (2022)
-
Solving linear multiplicative programs via branch-and-bound : a computational experience
Cambini, Riccardo, (2023)
-
Optimal rank-sparsity decomposition
Lee, Jon, (2014)
- More ...
-
Buckland, Paul, (1999)
-
Nagai, Hidetoshi, (2005)
-
A Variant of the Outer Approximation Method for Globally Minimizing a Class of Composite Functions
Kuno, Takahito, (1997)
- More ...