62,945 research outputs found
Improved determination of Q-factor and resonant frequency by a quadratic curve-fitting method
The Q-factor and peak frequency of resonant phenomena give useful information about the propagation and storage of energy in an electronic system and therefore its electromagnetic compatibility performance. However, the calculation of Q by linear interpolation of a discrete frequency response to obtain the half-power bandwidth can give inaccurate results, particularly if the data are noisy or the frequency resolution is low. We describe a more accurate method that makes use of the Lorentzian shape of the resonant peaks and involves fitting a second-order polynomial to the reciprocal power plotted against angular frequency. We demonstrate that this new method requires less than one quarter the number of frequency points as the linear method to give comparable accuracy in Q. The new method also gives comparable accuracy for signal-to-noise ratios that are approximately 8 dB greater. It is also more accurate for determination of peak frequency. Examples are given both from measured frequency responses and from simulated data obtained by the transmission line matrix method
A visible difference: an evaluation of the second phase of the Police Community Support Officers in West Yorkshire
Efficient Estimation of a Dynamic Error-Shock Model
This paper is concerned with the estimation of the parameters in a dynamic simultaneous equation model with stationary disturbances under the assumption that the variables are subject to random measurement errors. The conditions under which the parameters are identified are stated. An asymptotically efficient frequency-domain class of instrumental variables estimators is suggested. The procedure consists of two basic steps. The first step transforms the model in such a way that the observed exogenous variables are asymptotically orthogonal to the residual terms. The second step involves an iterative procedure like that of Robinson [13].
A second derivative SQP method: theoretical issues
Sequential quadratic programming (SQP) methods form a class of highly efficient algorithms for solving nonlinearly constrained optimization problems. Although second derivative information may often be calculated, there is little practical theory that justifies exact-Hessian SQP methods. In particular, the resulting quadratic programming (QP) subproblems are often nonconvex, and thus finding their global solutions may be computationally nonviable. This paper presents a second-derivative SQP method based on quadratic subproblems that are either convex, and thus may be solved efficiently, or need not be solved globally. Additionally, an explicit descent-constraint is imposed on certain QP subproblems, which “guides” the iterates through areas in which nonconvexity is a concern. Global convergence of the resulting algorithm is established
A second derivative SQP method: local convergence
In [19], we gave global convergence results for a second-derivative SQP method for minimizing the exact â„“1-merit function for a fixed value of the penalty parameter. To establish this result, we used the properties of the so-called Cauchy step, which was itself computed from the so-called predictor step. In addition, we allowed for the computation of a variety of (optional) SQP steps that were intended to improve the efficiency of the algorithm. \ud
\ud
Although we established global convergence of the algorithm, we did not discuss certain aspects that are critical when developing software capable of solving general optimization problems. In particular, we must have strategies for updating the penalty parameter and better techniques for defining the positive-definite matrix Bk used in computing the predictor step. In this paper we address both of these issues. We consider two techniques for defining the positive-definite matrix Bk—a simple diagonal approximation and a more sophisticated limited-memory BFGS update. We also analyze a strategy for updating the penalty paramter based on approximately minimizing the ℓ1-penalty function over a sequence of increasing values of the penalty parameter.\ud
\ud
Algorithms based on exact penalty functions have certain desirable properties. To be practical, however, these algorithms must be guaranteed to avoid the so-called Maratos effect. We show that a nonmonotone varient of our algorithm avoids this phenomenon and, therefore, results in asymptotically superlinear local convergence; this is verified by preliminary numerical results on the Hock and Shittkowski test set
Polynomial Cointegration among Stationary Processes with Long Memory
n this paper we consider polynomial cointegrating relationships among
stationary processes with long range dependence. We express the regression
functions in terms of Hermite polynomials and we consider a form of spectral
regression around frequency zero. For these estimates, we establish consistency
by means of a more general result on continuously averaged estimates of the
spectral density matrix at frequency zeroComment: 25 pages, 7 figures. Submitted in August 200
A second-derivative trust-region SQP method with a "trust-region-free" predictor step
In (NAR 08/18 and 08/21, Oxford University Computing Laboratory, 2008) we introduced a second-derivative SQP method (S2QP) for solving nonlinear nonconvex optimization problems. We proved that the method is globally convergent and locally superlinearly convergent under standard assumptions. A critical component of the algorithm is the so-called predictor step, which is computed from a strictly convex quadratic program with a trust-region constraint. This step is essential for proving global convergence, but its propensity to identify the optimal active set is Paramount for recovering fast local convergence. Thus the global and local efficiency of the method is intimately coupled with the quality of the predictor step.\ud
\ud
In this paper we study the effects of removing the trust-region constraint from the computation of the predictor step; this is reasonable since the resulting problem is still strictly convex and thus well-defined. Although this is an interesting theoretical question, our motivation is based on practicality. Our preliminary numerical experience with S2QP indicates that the trust-region constraint occasionally degrades the quality of the predictor step and diminishes its ability to correctly identify the optimal active set. Moreover, removal of the trust-region constraint allows for re-use of the predictor step over a sequence of failed iterations thus reducing computation. We show that the modified algorithm remains globally convergent and preserves local superlinear convergence provided a nonmonotone strategy is incorporated
Testing the bus guardian unit of the FTMP
Fault-tolerant multiprocessor (FTMP) operation is discussed. Fault-modeling in the bus guardian units (BGUs) is covered. Testing the BGU is discussed. A testing algorithm is proposed
Developmental Programming: Granulosa cell mRNA expression of differentiation, growth and apoptosis genes in abnormally large progestagenic follicles from androgenized ewes
On solving trust-region and other regularised subproblems in optimization
The solution of trust-region and regularisation subproblems which arise in unconstrained optimization is considered. Building on the pioneering work of Gay, Mor´e and Sorensen, methods which obtain the solution of a sequence of parametrized linear systems by factorization are used. Enhancements using high-order polynomial approximation and inverse iteration ensure that the resulting method is both globally and asymptotically at least superlinearly convergent in all cases, including in the notorious hard case. Numerical experiments validate the effectiveness of our approach. The resulting software is available as packages TRS and RQS as part of the GALAHAD optimization library, and is especially designed for large-scale problems
- …