A simplified convergence proof for the cone partitioning algorithm
From MaRDI portal
Recommendations
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- A fixed parameter algorithm for optimal convex partitions
- A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
- A cone-continuity constraint qualification and algorithmic consequences
- Conical partition algorithm for maximizing the sum of dc ratios
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
- Approximation Algorithms for the Minimum Convex Partition Problem
- The convergence of partitioning dual bounds for partial convex optimization problems
- A simple finite cone covering algorithm for concave minimization
- Concave minimization via conical partitions and polyhedral outer approximation
Cited in
(8)- A generalization of -subdivision ensuring convergence of the simplicial algorithm
- A convergent simplicial algorithm with -subdivision and -bisection strategies
- A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- On the convergence of cone splitting algorithms with \(\omega\)-subdivisions
- A convergent conical algorithm with \(\omega \)-bisection for concave minimization
- Conical partition algorithm for maximizing the sum of dc ratios
- On convergence conditions of partitioned solution procedures for consolidation problems
This page was built for publication: A simplified convergence proof for the cone partitioning algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1281480)
