Add to ORKGWe 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
In the field of nonlinear program-ming (in continuous variables) convex analysis [22, 23] plays a pi...
AbstractIn this paper we introduce the concept of convex optimization problem. Convex optimization p...
A matroid is a notion of independence in combi-natorial optimization which is closely related to com...
AbstractMatroids of rank n are studied in which each element has a real-valued cost and one of d > 1...
able discrete optimization problems by means of a combination of the ideas in continuous optimiza-ti...
The paper considers the minimization of a separable convex function subject to linear ascending cons...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
In this thesis we study fundamental problems that arise in optimization and its applications. We pre...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles ...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles ...
We revisit a problem studied by Padakandla and Sundaresan SIAM J. Optim., August 2009] on the minimi...
In this article we study convex integer maximization problems with com-posite objective functions of...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...
We consider the problem of minimizing a convex function plus a poly-nomial 푝 over a convex body 퐾. W...
In the field of nonlinear program-ming (in continuous variables) convex analysis [22, 23] plays a pi...
AbstractIn this paper we introduce the concept of convex optimization problem. Convex optimization p...
A matroid is a notion of independence in combi-natorial optimization which is closely related to com...
AbstractMatroids of rank n are studied in which each element has a real-valued cost and one of d > 1...
able discrete optimization problems by means of a combination of the ideas in continuous optimiza-ti...
The paper considers the minimization of a separable convex function subject to linear ascending cons...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
This is a survey of algorithmic results in the theory of "discrete convex analysis" for in...
In this thesis we study fundamental problems that arise in optimization and its applications. We pre...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles ...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles ...
We revisit a problem studied by Padakandla and Sundaresan SIAM J. Optim., August 2009] on the minimi...
In this article we study convex integer maximization problems with com-posite objective functions of...
Presented at the Georgia Tech Algorithms & Randomness Center workshop: Modern Aspects of Submodular...
We consider the problem of minimizing a convex function plus a poly-nomial 푝 over a convex body 퐾. W...
In the field of nonlinear program-ming (in continuous variables) convex analysis [22, 23] plays a pi...
AbstractIn this paper we introduce the concept of convex optimization problem. Convex optimization p...
A matroid is a notion of independence in combi-natorial optimization which is closely related to com...