Sciweavers

97 search results - page 3 / 20
» Approximate center points with proofs
Sort
View
MOR
2002
72views more  MOR 2002»
13 years 7 months ago
An Analytic Center Cutting Plane Method for Semidefinite Feasibility Problems
Semidefinite feasibility problems arise in many areas of operations research. The abstract form of these problems can be described as finding a point in a nonempty bounded convex b...
Jie Sun, Kim-Chuan Toh, Gongyun Zhao
SIAMJO
2000
88views more  SIAMJO 2000»
13 years 7 months ago
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
Paul Armand, Jean Charles Gilbert, Sophie Jan-J&ea...
TC
2011
13 years 2 months ago
Exact and Approximated Error of the FMA
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
Sylvie Boldo, Jean-Michel Muller
CCCG
2008
13 years 9 months ago
Improved Bounds on the Average Distance to the Fermat-Weber Center of a Convex Object
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
A. Karim Abu-Affash, Matthew J. Katz
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth