478 search results - page 22 / 96 » Convexity minimizes pseudo-triangulations |
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...
112
click to vote
ORL
2008
15 years 1 months ago
2008
We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...
110
click to vote
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
A common method for constructing a function from a finite set of moments is to solve a constrained minimization problem. The idea is to find, among all functions with the given ...
147
click to vote
ICANN
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. This paper studies a risk minimization approach to estimate a transformation model from noisy observations. It is argued that transformation models are a natural candidat...
127
click to vote
ICML
2003
IEEE
16 years 2 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...