Nonlinear Optimization over a Weighted Independence System
From MaRDI portal
Abstract: We consider the problem of optimizing a nonlinear objective function over a weighted independence system presented by a linear-optimization oracle. We provide a polynomial-time algorithm that determines an r-best solution for nonlinear functions of the total weight of an independent set, where r is a constant that depends on certain Frobenius numbers of the individual weights and is independent of the size of the ground set. In contrast, we show that finding an optimal (0-best) solution requires exponential time even in a very special case of the problem.
Recommendations
- Approximate nonlinear optimization over weighted independence systems
- Approximate separable multichoice optimization over monotone systems
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections
- Nonlinear Matroid Optimization and Experimental Design
Cites work
Cited in
(4)- Parametric nonlinear discrete optimization over well-described sets and matroid intersections
- Approximate nonlinear optimization over weighted independence systems
- Nonlinear Matroid Optimization and Experimental Design
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems
This page was built for publication: Nonlinear Optimization over a Weighted Independence System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638454)