A dual algorithm to minimize a separable convex function under ratio constraints between variables

A dual algorithm to minimize a separable convex function under ratio constraints between variables

0.00 Avg rating0 Votes
Article ID: iaor19891082
Country: France
Volume: 23
Issue: 4
Start Page Number: 305
End Page Number: 317
Publication Date: Dec 1989
Journal: RAIRO Operations Research
Authors: , ,
Abstract:

The authors present a dual algorithm to minimize a separable convex function under ratio constraints between variables. This minimization problem occurs when the dependent variable of a regression model is discrete. The algorithm’s complexity is shown to be linear, in number of operations, for the quadratic and linear cases.

Reviews

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