# Optim Control the number of search steps during an iteration

**URL:** <https://discourse.julialang.org/t/optim-control-the-number-of-search-steps-during-an-iteration/70457>\
**Category:** Optimization (Mathematical)\
**Tags:** optim\
**Created:** [October 27, 2021, 7:44am UTC](https://discourse.julialang.org/t/optim-control-the-number-of-search-steps-during-an-iteration/70457 "2021-10-27T07:44:57Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![phy-lxf](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/phy-lxf/32/24687_2.png) [@phy-lxf](https://discourse.julialang.org/u/phy-lxf)\
**Post date:** [October 27, 2021, 7:44am UTC](https://discourse.julialang.org/t/optim-control-the-number-of-search-steps-during-an-iteration/70457/1 "2021-10-27T07:44:57Z")

</div>

When optim.jl uses L-BFGS method to optimize the objective function, the derivative between each step of the optimization process often needs to search 3-4 steps. Can we fix the search step number to 1?
