Standard Quadratic Programming Algorithm Research Articles

Representation theorem for convex nonparametric least squares

Summary We examine a nonparametric least-squares regression model that endogenously selects the functional form of the regression function from the family of continuous, monotonic increasing and globally concave functions that can be nondifferentiable. We show that this family of functions can be characterized without a loss of generality by a subset of continuous, piece-wise linear functions whose intercept and slope coefficients are constrained to satisfy the required monotonicity and concavity conditions. This representation theorem is useful at least in three respects. First, it enables us to derive an explicit representation for the regression function, which can be used for assessing marginal properties and for the purposes of forecasting and ex post economic modelling. Second, it enables us to transform the infinite dimensional regression problem into a tractable quadratic programming (QP) form, which can be solved by standard QP algorithms and solver software. Importantly, the QP formulation applies to the general multiple regression setting. Third, an operational computational procedure enables us to apply bootstrap techniques to draw statistical inference.

Branch and bound algorithm for multidimensional scaling with city-block metric

A two level global optimization algorithm for multidimensional scaling (MDS) with city-block metric is proposed. The piecewise quadratic structure of the objective function is employed. At the upper level a combinatorial global optimization problem is solved by means of branch and bound method, where an objective function is defined as the minimum of a quadratic programming problem. The later is solved at the lower level by a standard quadratic programming algorithm. The proposed algorithm has been applied for auxiliary and practical problems whose global optimization counterpart was of dimensionality up to 24.

Solution of static optimal control problems in non‐linear elasticity via quadratic programming

A class of static (elliptic) optimal control problems in non-linear elasticity is considered. A new direct finite element formulation is used which results in a sequence of quadratic programming (QP) problems. The latter are solved using a standard QP algorithm. The method is applied to the problems of minimizing the lateral deflection of a membrane on a nonlinear elastic foundation and minimizing the in-plane large deformation of a hyperelastic plate.