Convex Matroid Optimization

Shmuel Onn

Convex Matroid Optimization

Combinatorics 2018-08-21 v1 Discrete Mathematics Optimization and Control Rings and Algebras

Authors: Shmuel Onn

Abstract

We consider a problem of optimizing convex functionals over matroid bases. It is richly expressive and captures certain quadratic assignment and clustering problems. While generally NP-hard, we show it is polynomial time solvable when a suitable parameter is restricted.

Keywords

convex optimization optimization and approximation theory polynomial optimization

Cite

@article{arxiv.math/0207136,
  title  = {Convex Matroid Optimization},
  author = {Shmuel Onn},
  journal= {arXiv preprint arXiv:math/0207136},
  year   = {2018}
}

Related papers

View all related →