3244 search results - page 16 / 649 » On convex complexity measures |
MP
2008
14 years 11 months ago
2008
In this paper we propose an accelerated version of the cubic regularization of Newton's method [6]. The original version, used for minimizing a convex function with Lipschitz...
EOR
2008
14 years 11 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
101
click to vote
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
CCCG
2003
15 years 18 days ago
2003
Given a polyhedron P in Rd with n vertices, a halfspace volume query asks for the volume of P ∩ H for a given halfspace H. We show that, for d ≥ 3, such queries can require â„...
ALGORITHMICA
2010
14 years 11 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...