New answers tagged

0 votes

Feasibility problem with polynomial inequalities

If you can easily compute the roots (which seems to be the case, as your $f$s are quadratics), you can turn the problem into a simple min/max problem over finitely many reals. Consider the sets $\left\...
user avatar
  • 243
0 votes

Subgradient method for nonconvex nonsmooth function

The subgradient method has indeed been utilized to optimize nonconvex nonsmooth functions and this goes back to work done in the Soviet union in the 70s. These methods rely on the assumption that an ...
user avatar
  • 883

Top 50 recent answers are included