Tree-sparse convex programs
type: Item
instance of: scholarly article
title: Tree-sparse convex programs
zbMATH Open document ID: 1064.90033
author: Marc C. Steinbach
published in: Mathematical Methods of Operations Research
publication date: 2003-06-23T00:00:00Z
full work available at URL: http://edoc.hu-berlin.de/18452/8913
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 49K30
zbMATH DE Number: 1932767
MaRDI profile type: Publication
OpenAlex ID: W1976330321
DOI: 10.1007/S001860200227
Recommended article: Reducing Separable Convex Programs with Tree Constraints
Recommended article: Convex optimization under combinatorial sparsity constraints
Recommended article: Concave programming for finding sparse solutions to problems with convex constraints
Recommended article: Sparsity constrained optimization problems via disjunctive programming
Recommended article: Separable convex programs with ratio constraints over a directed tree
Recommended article: Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints
Recommended article: Q5297306
Recommended article: Properties of tree convex constraints
Recommended article: On sparse optimal regression trees
Recommended article: Tree decomposition and discrete optimization problems: a survey
description: scientific article; zbMATH DE number 1932767