Which algorithms are suitable for solving problems of the form $$ \min_x \lbrace f(x) \; | \; Ax \leq b \rbrace $$ with nonconvex, differentiable obfective $f$. Unfortunately, $f$ cannot be assumed to be differentiable twice. I am also interested in the case where $f$ has Lipschitz continuous gradients.
Nonconvex optimization with linear constraints
Marita
- 31
- 1