Login / Signup
Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres.
Pham Dinh Tao
Le Thi Hoai An
Published in:
Oper. Res. Lett. (1996)
Keyphrases
</>
convex functions
global optimality
convex programming
objective function
linear program
quasiconvex
convex programs
optimization problems
convex sets
exact penalty
dc programming
piecewise linear
primal dual
global optimization
learning algorithm
constrained optimization
computational complexity