The Difference of Convex functions Algorithm (DCA) is used to solve nonconvex optimization problems over a certain convex set, specifically quadratic programming ones, generally by finding approximate ...
This is a preview. Log in through your library . Abstract The basic properties are stated of a linear programming problem with a linear objective function having quadratic constraints whose associated ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback