Sensitivity shaping with degree constraint by nonlinear least-squares optimization
نویسندگان
چکیده
This paper presents a new approach to shaping of the frequency response of the sensitivity function. A sensitivity shaping problem is formulated as an approximation problem relative to a desired frequency response and with respect to a function in a class of sensitivity functions with a degree bound. It is reduced to a finite dimensional constrained nonlinear least-squares optimization problem. A numerical example illustrates that the proposed method generates controllers of relatively low degrees. Copyright c ©2005 IFAC
منابع مشابه
A Comparative Study of Least-Squares and the Weak-Form Galerkin Finite Element Models for the Nonlinear Analysis of Timoshenko Beams
In this paper, a comparison of weak-form Galerkin and least-squares finite element models of Timoshenko beam theory with the von Kármán strains is presented. Computational characteristics of the two models and the influence of the polynomial orders used on the relative accuracies of the two models are discussed. The degree of approximation functions used varied from linear to the 5th order. In ...
متن کاملSuperlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملSpectral estimation by least-squares optimization based on rational covariance extension
This paper proposes a new spectral estimation technique based on rational covariance extension with degree constraint. The technique finds a rational spectral density function that approximates given spectral density data under constraint on a covariance sequence. Spectral density approximation problems are formulated as nonconvex optimization problems with respect to a Schur polynomial. To for...
متن کاملRobust Modeling and Estimation of Optical Flow with Overlapped Basis Functions
Computation of optical ow has been formulated as nonlinear optimization of a cost function comprising a gradient constraint term and a eld smoothness factor. Results obtained using these techniques are often erroneous, highly sensitive to numerical precision , and determined sparsely, and they carry with them all the pitfalls of nonlinear optimization. In this paper, we regularize the gradient ...
متن کاملLocal Convergence of Sequential Convex Programming for Nonconvex Optimization
where c ∈ R, g : R → R is non-linear and smooth on its domain, and Ω is a nonempty closed convex subset in R. This paper introduces sequential convex programming (SCP), a local optimization method for solving the nonconvex problem (P). We prove that under acceptable assumptions the SCP method locally converges to a KKT point of (P) and the rate of convergence is linear. Problems in the form of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Automatica
دوره 41 شماره
صفحات -
تاریخ انتشار 2005