Tao Pham Dinh

Pham Dinh Tao

Information about the author Pham Dinh Tao will soon be added to the site.
Found 5 papers in total
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
2005
The DC programming and its DC algorithm (DCA) address the problem of minimizing a...
Difference of convex functions optimization algorithms (DCAs) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
Difference of convex functions optimization algorithms (DCAs) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
1996
We present difference of convex functions optimization algorithms (DCA) for globally...
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
Numerical solution for optimization over the efficient set by d.c. optimization algorithms
1996
In this paper we outline a d.c. optimization scheme and use it for (locally)...
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method
1996
The global minimization of an indefinite quadratic function over a bounded polyhedral...
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems
1995
A decomposition branch and bound approach is considered for the global minimization of...
Papers per page: