Abstract:We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization. We provide a combinatorial polynomial time algorithm for arbitrary oracle-presented matroids, that makes repeated use of matroid intersection, and an algebraic algorithm for vectorial matroids.Our work is partly motivated by applications to minimum-aberration model-fitting in experimental design in statistics, which… Show more
“…More precisely: Theorem 2 Let F = P ∩ Z n be presented by an oracle for solving quadratic minimization problems of the type min c T x + τ 2 x 2 with varying c ∈ Q n and τ ∈ Q + . Let x * denote an optimal solution for the optimization problem (1). There is no polynomial time algorithm that can produce for every F = P ∩ Z n and every convex function f…”
Section: Related Literature and Main Resultsmentioning
confidence: 99%
“…If n is constant, and if s designates a bound on the binary encoding length of the data of a subproblem (8), then we can determine an optimal solution for min{ (1) .…”
Section: Modifications Of the Iterative Algorithm To Avoid Cyclingmentioning
This paper is about the minimization of Lipschitz-continuous and strongly convex functions over integer points in polytopes. Our results are related to the rate of convergence of a black-box algorithm that iteratively solves special quadratic integer problems with a constant approximation factor. Despite the generality of the underlying problem, we prove that we can find efficiently, with respect to our assumptions regarding the encoding of the problem, a feasible solution whose objective function value is close to the optimal value. We also show that this proximity result is the best possible up to a factor polynomial in the encoding length of the problem.
“…More precisely: Theorem 2 Let F = P ∩ Z n be presented by an oracle for solving quadratic minimization problems of the type min c T x + τ 2 x 2 with varying c ∈ Q n and τ ∈ Q + . Let x * denote an optimal solution for the optimization problem (1). There is no polynomial time algorithm that can produce for every F = P ∩ Z n and every convex function f…”
Section: Related Literature and Main Resultsmentioning
confidence: 99%
“…If n is constant, and if s designates a bound on the binary encoding length of the data of a subproblem (8), then we can determine an optimal solution for min{ (1) .…”
Section: Modifications Of the Iterative Algorithm To Avoid Cyclingmentioning
This paper is about the minimization of Lipschitz-continuous and strongly convex functions over integer points in polytopes. Our results are related to the rate of convergence of a black-box algorithm that iteratively solves special quadratic integer problems with a constant approximation factor. Despite the generality of the underlying problem, we prove that we can find efficiently, with respect to our assumptions regarding the encoding of the problem, a feasible solution whose objective function value is close to the optimal value. We also show that this proximity result is the best possible up to a factor polynomial in the encoding length of the problem.
“…That is to say, the set of lower vertices of the state polytope (corresponding to models in the algebraic fan) contains the solution to minimising any concave aberration function. This can be understood as minimisation over a matroid, which was studied further in Berstein et al (2008). A further development is to consider aberration A(w, S(w)) with respect to other distributions rather than the uniform.…”
“…This is a new concept in experimental designs for quantitative factors which is an alternative to aberration and is strongly related to corner cut models and state polytopes. Algorithmic and computational aspects are related to non-linear matroid optimization [11]. Another novel idea in design of experiment is to interpret an algebraic variety, not necessarily a zero-dimensional one, as a (repository of potential) designs of experiments [9,50].…”
In algebraic statistics, computational techniques from algebraic geometry become tools to address statistical problems. This, in turn, may prompt research in algebraic geometry. The basic ideas at the core of algebraic statistics will be presented. In particular we shall consider application to contingency tables and to design of experiments.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.