We present an iterative approach to solve separable nonlinear least squares problems arising in the estimation of wavelength-dependent point spread function (PSF) parameters for hyperspectral imaging. A variable projection Gauss-Newton method is used to solve the nonlinear least squares problem. An analysis shows that the Jacobian can be potentially very ill-conditioned. To deal with this ill-c...

Abstract. In this paper, we consider solving multiple-block separable convex minimization problems using alternating direction method of multipliers (ADMM). Motivated by the fact that the existing convergence theory for ADMM is mostly limited to the two-block case, we analyze in this paper, both theoretically and numerically, a new strategy that first transforms a multiblock problem into an equ...

In the parallel variable distribution framework for solving optimization problems (PVD), the variables are distributed among parallel processors with each processor having the primary responsibility for updating its block of variables while allowing the remaining “secondary” variables to change in a restricted fashion along some easily computable directions. For constrained nonlinear programs c...

We propose two new axioms of demand responsiveness for additive cost sharing with variable demands. Group Monotonicity requires that if a group of agents increase their demands, not all of them pay less. Solidarity says that if agent i demands more, j should not pay more if k pays less. Both axioms are compatible in the partial responsibility theory postulating Strong Ranking, i.e., the ranking...

We propose a method for obtaining high-accuracy sub-pixel motion estimates using phase correlation. Our method is motivated by recently published analysis according to which the Fourier inverse of the normalized cross-power spectrum of pairs of images which have been mutually shifted by a fractional amount can be approximated by a two-dimensional sinc function. We use a modified version of such...

This paper presents a two-step instrumental variable (IV) method to obtain the regularized and consistent parameter estimates of the Hammerstein ARMAX model based on the bilinear parameterized form. The two-step identification method consists of estimating the bilinear parameters in the first step, followed by parameter reduction in the second step. An iterative identification method is propose...

Genetic algorithms generally use a fixed problem representation that maps variables of the search space to variables of the problem, and operators of variation that are fixed over time. This limits their scalability on non-separable problems. To address this issue, methods have been proposed that coevolve explicitly represented modules. An open question is how modules in such coevolutionary set...