New answers tagged non-convex-optimization
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\...
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 ...
Top 50 recent answers are included
Related Tags
non-convex-optimization × 572optimization × 405
convex-optimization × 186
nonlinear-optimization × 168
convex-analysis × 94
qcqp × 64
numerical-optimization × 43
quadratic-programming × 41
linear-algebra × 40
matrices × 37
gradient-descent × 31
lagrange-multiplier × 21
discrete-optimization × 15
karush-kuhn-tucker × 15
maxima-minima × 14
real-analysis × 13
linear-programming × 13
functional-analysis × 12
reference-request × 12
convex-geometry × 11
constraints × 11
machine-learning × 10
least-squares × 10
relaxations × 10
normed-spaces × 9