Tree-sparse convex programs
From MaRDI portal
Recommendations
- Reducing Separable Convex Programs with Tree Constraints
- Convex optimization under combinatorial sparsity constraints
- Concave programming for finding sparse solutions to problems with convex constraints
- Sparsity constrained optimization problems via disjunctive programming
- Separable convex programs with ratio constraints over a directed tree
- Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints
- scientific article; zbMATH DE number 5172313
- Properties of tree convex constraints
- On sparse optimal regression trees
- Tree decomposition and discrete optimization problems: a survey
Cited in
(11)- On PDE solution in transient optimization of gas networks
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- A graph-based modeling abstraction for optimization: concepts and implementation in Plasmo.jl
- Hierarchical sparsity in multistage stochastic programs
- Reducing Separable Convex Programs with Tree Constraints
- scientific article; zbMATH DE number 5818908 (Why is no real title available?)
- A Distributed Interior-Point KKT Solver for Multistage Stochastic Optimization
- Robust process control by dynamic stochastic programming
- A dual Newton strategy for tree-sparse quadratic programs and its implementation in the open-source software treeQP
- On shape optimization with stochastic loadings
- Optimization techniques for tree-structured nonlinear problems
This page was built for publication: Tree-sparse convex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812288)
