2008
DOI: 10.1137/070696465
|View full text |Cite
|
Sign up to set email alerts
|

Nonlinear Matroid Optimization and Experimental Design

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
37
0

Year Published

2008
2008
2016
2016

Publication Types

Select...
5
3

Relationship

4
4

Authors

Journals

citations
Cited by 24 publications
(37 citation statements)
references
References 12 publications
0
37
0
Order By: Relevance
“…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%
See 1 more Smart Citation
“…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
confidence: 99%
“…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.…”
Section: Generalised Concave Aberrationmentioning
confidence: 97%
“…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].…”
Section: Advanced Topicsmentioning
confidence: 99%