Abstract
We address optimization of parametric nonlinear functions of the form f(Wx), where \({f : \mathbb {R}^d \rightarrow \mathbb {R}}\) is a nonlinear function, W is a d × n matrix, and feasible x are in some large finite set \({\mathcal {F}}\) of integer points in \({\mathbb {R}^n}\). Generally, such problems are intractable, so we obtain positive algorithmic results by looking at broad natural classes of f, W and \({\mathcal {F}}\). One of our main motivations is multi-objective discrete optimization, where f trades off the linear functions given by the rows of W. Another motivation is that we want to extend as much as possible the known results about polynomial-time linear optimization over trees, assignments, matroids, polymatroids, etc. to nonlinear optimization over such structures. We assume that \({\mathcal {F}}\) is well described (i.e., we can efficiently optimize a linear objective function on \({\mathcal {F}}\); equivalently, we have an efficient separation oracle for the convex hull of \({\mathcal {F}}\)). For example, the sets of characteristic vectors of (i) matchings of a graph, and (ii) common bases of a pair of matroids on a common ground set satisfy this property. In this setting, the problem is already known to be intractable (even for a single matroid), for general f (given by a comparison oracle), for (i) d = 1 and binary-encoded W, and for (ii) d = n and W = I. Our main results (a few technicalities and some generality suppressed):
-
1.
When \({\mathcal {F}}\) is well described, f is convex (or even quasi-convex), and W has a fixed number of rows and is unary encoded or with entries in a fixed set, we give an efficient deterministic algorithm for maximization.
-
2.
When \({\mathcal {F}}\) is well described, f is a norm, and W is binary-encoded, we give an efficient deterministic constant-approximation algorithm for maximization (Note that the approximation factor depends on the norm, and hence implicitly on the number of rows of W, while the running time increases only linearly in the number of rows of W).
-
3.
When non-negative \({\mathcal {F}}\) is well described, f is “ray concave” and non-decreasing, and non-negative W has a fixed number of rows and is unary encoded or with entries in a fixed set, we give an efficient deterministic constant-approximation algorithm for minimization.
-
4.
When \({\mathcal {F}}\) is the set of characteristic vectors of common independent sets or bases of a pair of rational vectorial matroids on a common ground set, f is arbitrary, and W has a fixed number of rows and is unary encoded, we give an efficient randomized algorithm for optimization.
Similar content being viewed by others
References
Avriel M., Diewert W.E., Schaible S., Zang I.: Generalized Concavity, Mathematical Concepts and Methods in Science and Engineering, vol. 36. Plenum Press, New York (1988)
Berstein Y., Lee J., Maruri-Aguilar H., Onn S., Riccomagno E., Weismantel R., Wynn H.: Nonlinear matroid optimization and experimental design. SIAM J. Discrete Math. 22(3), 901–919 (2008)
Berstein Y., Onn S.: Nonlinear bipartite matching. Discrete Optim. 5(1), 53–65 (2008)
DeMillo R., Lipton R.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193–195 (1978)
Grötschel M., Lovász L., Schrijver A.: Geometric Algorithms and Combinatorial Optimization, Second Corrected. Edition Algorithms and Combinatorics. Springer, Berlin (1993)
Gunnels, J., Lee, J., Margulies, S.: Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization. Preprint (April 2009). Earlier version available as: efficient high-precision dense matrix algebra on parallel architectures for nonlinear discrete optimization. IBM Research Report RC24682, October (2008)
Lee J.: A First Course in Combinatorial Optimization. Cambridge Texts in Applied Mathematics. Cambridge University Press, Cambridge (2004)
Lee J., Onn S., Weismantel R.: Approximate nonlinear optimization over weighted independence systems. SIAM J. Discrete Math. 23(4), 1667–1681 (2009)
Lee, J., Onn, S., Weismantel, R.: Nonlinear Discrete Optimization. Draft monograph (2008)
Lee, J., Onn, S., Weismantel, R.: Nonlinear optimization over a weighted independence system. In: Proceedings of the “5th International Conference on Algorithmic Aspects in Information and Management,” 15–17 June 2009, San Francisco, CA, USA. AAIM 2009, Lecture Notes in Computer Science 5564, pp. 251–264. Springer (2009)
Onn S.: Convex matroid optimization. SIAM J. Discrete Math 17(2), 249–253 (2003)
Onn S., Rothblum U.: Convex combinatorial optimization. Discrete Comput. Geom. 32, 549–566 (2004)
Schrijver A.: Combinatorial Optimization. Springer, Berlin, Germany (2002)
Schwartz J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27(4), 701–717 (1980)
Ziegler G.M.: Lectures on Polytopes, Grduate Texts in Mathematics, vol. 152. Springer, New York (1995)
Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation (EUROSAM ’79, Marseille, 1979). Lecture Notes in Computer Science, vol. 72, pp. 216–226. Springer, Berlin (1979)
Zippel R.: Effective Polynomial Computation. Kluwer, Boston (1993)
Author information
Authors and Affiliations
Corresponding author
Additional information
For Tom Liebling, on the occasion of his retirement.
Rights and permissions
About this article
Cite this article
Berstein, Y., Lee, J., Onn, S. et al. Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124, 233–253 (2010). https://doi.org/10.1007/s10107-010-0358-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-010-0358-6