A new model-free method to track local optimal points in locally convex time-varying optimization problems is presented: Luke's Method. A description of the algorithm, a proof of the error boundary and the conditions that guarantee the tracking of the optimal point are given. Then simulations tests and its results are shown. Finally further work and conclusions are discussed.