Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
type: Item
instance of: scholarly article
title: Convergence of a Tuy-type algorithm for concave minimization subject to linear inequality constraints
zbMATH Open document ID: 0452.90060
DOI: 10.1007/BF01442106
author: Stephen E. Jacobsen
published in: Applied Mathematics and Optimization
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 41A25
zbMATH DE Number: 3708111
zbMATH Keywords: convergence
zbMATH Keywords: concave minimization
zbMATH Keywords: linear inequality constraints
zbMATH Keywords: Tuy's cone splitting algorithm
zbMATH Keywords: convex polytopes
zbMATH Keywords: nonconvex programming
MaRDI profile type: Publication
cites work: A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
cites work: A Successive Underestimation Method for Concave Minimization Problems
cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
cites work: Global Maximization of a Convex Function with Linear Inequality Constraints
description: scientific article; zbMATH DE number 3708111