2746 search results - page 39 / 550 » Bisubmodular Function Minimization |
DAM
2008
15 years 2 months ago
2008
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
107
click to vote
WCE
2007
15 years 3 months ago
2007
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
101
click to vote
VLSID
1996
IEEE
15 years 6 months ago
1996
IEEE
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set...
142
click to vote
CONSTRAINTS
2008
15 years 2 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
103
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...