# How exactly do optimizers reject infinity loss?

**URL:** <https://discourse.julialang.org/t/how-exactly-do-optimizers-reject-infinity-loss/91597>\
**Category:** Optimization (Mathematical)\
**Tags:** diffeq\
**Created:** [December 13, 2022, 11:26am UTC](https://discourse.julialang.org/t/how-exactly-do-optimizers-reject-infinity-loss/91597 "2022-12-13T11:26:08Z")\
**Posts on this page:** 1\
**Showing post:** 2

<div class="post-metadata">

**Author:** ![ChrisRackauckas](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/chrisrackauckas/32/77_2.png) [@ChrisRackauckas](https://discourse.julialang.org/u/ChrisRackauckas)\
**Post date:** [December 13, 2022, 12:17pm UTC](https://discourse.julialang.org/t/how-exactly-do-optimizers-reject-infinity-loss/91597/2 "2022-12-13T12:17:42Z")

</div>

> [@fanny1](#):
>
> I wonder which optimizers will do that? and how exactly do they “reject the steps”? (e.g.: do they simply skip the current step? or do they randomly initialize a new set of parameters?)

They skip the current step and do some line search thing. I know the Optim.jl algorithms support this. I need to dig around to see which others do it well.

---

_[View the full topic](https://discourse.julialang.org/t/how-exactly-do-optimizers-reject-infinity-loss/91597)._