Optimal objective function approximation for separable convex quadratic programming

Optimal objective function approximation for separable convex quadratic programming

0.00 Avg rating0 Votes
Article ID: iaor19961444
Country: Netherlands
Volume: 67
Issue: 1
Start Page Number: 133
End Page Number: 142
Publication Date: Oct 1994
Journal: Mathematical Programming (Series A)
Authors: ,
Abstract:

The authors present an optimal piecewise-linear approximation method for the objective function of separable convex quadratic programs. The method provides guidelines on how many grid points to use and how to position them for a piecewise-linear approximation if the error induced by the approximation is to be bounded a priori.

Reviews

Required fields are marked *. Your email address will not be published.