Need expert for (discrete) optimization (maximize the amount of data points (x,y) in an interval)
Budget: $250 – $750 USD
See input.png for an example of the data that you will be working with (there are thousands more like these).
The file code.R shows how a single line is being estimated.
The target function (hits) maximizes the number of data points (x,y) that are contained within an interval.
As the target function is non-convex, the parameter-search is based on grid-search and thus rather slow.
The job is to replace the grid-search approach with something that decreases the time it takes to calculate the parameters significantely.
As a reference, running code.R, the calculation of the first line (rad = 3.92, intz_rot = -0.03, hits = 892) takes about 8 seconds.
Use the word OPTIMIZATION within your proposal to be considered for bidding.
The file code.R shows how a single line is being estimated.
The target function (hits) maximizes the number of data points (x,y) that are contained within an interval.
As the target function is non-convex, the parameter-search is based on grid-search and thus rather slow.
The job is to replace the grid-search approach with something that decreases the time it takes to calculate the parameters significantely.
As a reference, running code.R, the calculation of the first line (rad = 3.92, intz_rot = -0.03, hits = 892) takes about 8 seconds.
Use the word OPTIMIZATION within your proposal to be considered for bidding.
Related categories:
Python
Mathematics
Linear Programming
R Programming Language
Statistical Analysis