This paper considers the estimation problem of structural models for which empirical restrictions are characterized by a fixed point constraint, such as structural dynamic discrete choice models or models of dynamic games. We analyze the conditions under which the nested pseudo-likelihood (NPL)...

This paper considers the estimation problem of structural models for which empirical restrictions are characterized by a fixed point constraint, such as structural dynamic discrete choice models or models of dynamic games. We analyze the conditions under which the nested pseudo-likelihood (NPL)...

This paper considers the estimation problem of structural models for which empirical restrictions are characterized by a fixed point constraint, such as structural dynamic discrete choice models or models of dynamic games. We analyze the conditions under which the nested pseudo-likelihood (NPL)...

A new algorithm is developed to solve models with heterogeneous agents and aggregate uncertainty. Projection methods are the main building blocks of the algorithm and – in contrast to the most popular solution procedure – simulations only play a very minor role. The paper also develops a new...

In this paper, we consider a least square semidefinite programming problem under ellipsoidal data uncertainty. We show that the robustification of this uncertain problem can be reformulated as a semidefinite linear programming problem with an additional second-order cone constraint. We then...

Purpose – The mechanization of the meat cutting companies has become essential due to the lack of skilled workers and to working conditions. This paper deals with the analysis of human gestures in order to improve the performance of a redundant robotic cell. The aim is to define optimization...

The variable projection algorithm of Golub and Pereyra (SIAM J. Numer. Anal. 10:413–432, <CitationRef CitationID="CR12">1973</CitationRef>) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a...</citationref>

Let C be a nonempty closed convex subset of a uniformly convex and 2-uniformly smooth Banach space E and let Π<Subscript> C </Subscript> be a sunny nonexpansive retraction from E onto C. Let the mappings <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$${T, S: C \to E}$$</EquationSource> </InlineEquation> be γ <Subscript>1</Subscript>-strongly accretive, μ <Subscript>1</Subscript>-Lipschitz continuous and γ <Subscript>2</Subscript>-strongly accretive, μ...</subscript></subscript></subscript></subscript></equationsource></inlineequation></subscript>