Learn More
Iterative methods are proposed for certain augmented systems of linear equations that arise in interior methods for general nonlinear optimization. Interior methods define a sequence of KKT equations that represent the symmetrized (but indefinite) equations associated with New-ton's method for a point satisfying the perturbed optimality conditions. These(More)
We consider the problem of finding an approximate minimizer of a general quadratic function subject to a two-norm constraint. The Steihaug-Toint method minimizes the quadratic over a sequence of expanding subspaces until the iterates either converge to an interior point or cross the constraint boundary. The benefit of this approach is that an approximate(More)
Optimization for complex systems in engineering often involves the use of expensive computer simulation. By combining statistical emulation using treed Gaussian processes with pattern search optimization, we are able to perform robust local optimization more efficiently and effectively than using either method alone. Our approach is based on the(More)
We describe an asynchronous parallel derivative-free algorithm for linearly constrained optimization. Generating set search (GSS) is the basis of our method. At each iteration , a GSS algorithm computes a set of search directions and corresponding trial points and then evaluates the objective function value at each trial point. Asynchronous versions of the(More)
— High-frequency backscatter radio systems operate in the dyadic backscatter channel, a pinhole channel whose envelope probability density function and bit-error-rate performance are strongly affected by link envelope correlation – the envelope correlation between the forward and backscatter links of the dyadic backscatter channel. This paper shows that(More)
A novel approach for pairing RFID-enabled devices is introduced and evaluated in this work. Two or more devices are moved simultaneously through the radio field in close proximity of one or more RFID readers. Gesture recognition is applied to identify the movements of the devices, to mark them as a pair. This application is of interest for social networks(More)
(Received 00 Month 200x; in final form 00 Month 200x) In this paper we explore hybrid parallel global optimization using DIRECT and asynchronous generating set search (GSS). Both DIRECT and GSS are derivative-free and so require only objective function values; this makes these methods applicable to a wide variety of science and engineering problems. DIRECT(More)