Background removal from spectra by designing and minimising

We present a generic regularized formulation, based on robust half–quadratic regularization, for unwrapping noisy and discontinuous wrapped phase maps. Two cases are presented: the convex and the non–convex one. The unwrapped phase with the convex formulation is unique and robust to noise; however

Abstract — Inverse optimal control is a classical problem of control theory. It was first posed by Kalman in the early sixties. The problem, as addressed in literature, answers to the following two questions: (a) Given system matrices A,B and a gain matrix K, find necessary and sufficient conditions for K to be the optimal of an infinite time LQ problem. (b) Determine all weight matrices Q, R and S which yield the given gain matrix K. In this paper, we tackle a related, but different problem. Starting from the state trajectories of an LTI system, identify the matrices Q, R and S that have generated those trajectories. Both infinite and finite time optimal control problems are considered. The motivation lies in the characterization of the trajectories of LTI systems in terms of the control task. I.

Abstract The paper shows how a synthetic gradient of a quadratic cost function can be used to monitor performance. The method requires a model of the closed loop system. In the current paper this is obtained from the recommended tuning rule. The tuning rule requires a simple model of the process

Abstract: An algorithm to approximate a solution to the Hamilton-Jacobi equation for a generating function for a nonlinear optimal control problem with a quadratic cost function with respect to the input is proposed in this paper. An approximate generating function based on Taylor series up

We consider a Gaussian cheap talk game with quadratic cost functions. The cost function of the receiver is equal to the estimation error variance, however, the cost function of each senders contains an extra term which is captured by its private information. Following the cheap talk literature, we

In this paper, the problem of estimating the background of a spectrum is addressed. We propose to fit this background to a low-order polynomial, but rather than determining the polynomial parameters that minimise a least-squares criterion (i.e. a quadratic cost function), non-quadratic cost

quadratic cost function

In this paper, the problem of non-response with significant travel costs in multivariate stratified sample surveys has been formulated of as a Multi-Objective Geometric Programming Problem (MOGPP). The fuzzy programming approach has been described for solving the formulated MOGPP. The formulated

Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective and constraints. Here we consider problems with general inequality constraints (linear and nonlinear). We assume that first