A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
type: Item
instance of: scholarly article
title: A new successive partition algorithm for concave minimization based on cone decomposition and decomposition cuts
zbMATH Open document ID: 1084.90047
author: Marcus Porembski
published in: Journal of Global Optimization
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 2117676
zbMATH Keywords: Concave minimization
zbMATH Keywords: cone decomposition
zbMATH Keywords: decomposition cut
zbMATH Keywords: successive partition
MaRDI profile type: Publication
DOI: 10.1023/B:JOGO.0000042113.68493.DA
Recommended article: A class of exhaustive cone splitting procedures in conical algorithms for concave minmization
Recommended article: Concave minimization via conical partitions and polyhedral outer approximation
Recommended article: Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems
Recommended article: New Partitioning Method for a Class of Nonconvex Optimization Problems
Recommended article: A convergent conical algorithm with \(\omega \)-bisection for concave minimization
Recommended article: A simplified convergence proof for the cone partitioning algorithm
Recommended article: Refining the partition for multifold conic optimization problems
Recommended article: The convergence of partitioning dual bounds for partial convex optimization problems
Recommended article: An approximate decomposition algorithm for convex minimization
Recommended article: Q4552722
description: scientific article; zbMATH DE number 2117676