Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres

We present DCA for globally minimizing quadratic forms on Euclidean balls and spheres. Since these problems admit at most one local-nonglobal minimizer, DCA converges in general to a solution for these problems. Numerical simulations show robustness, stability and efficiency of DCA with respect to r...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Operations research letters Ročník 19; číslo 5; s. 207 - 216
Hlavní autori: Tao, Pham Dinh, An, Le Thi Hoai
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 01.11.1996
Elsevier
Predmet:
Applied sciences
Computer Science
d.c. optimization
d.c. optimization algorithms
Exact sciences and technology
Local and global optimality conditions
Mathematical programming
Nonconvex quadratic minimization
Operational research and scientific management
Operational research. Management science
Optimization. Search problems
d.c. optimization algorithms
Local and global optimality conditions
Nonconvex quadratic minimization
d.c. optimization
Non convex programming
Algorithms
Euclidean theory
Optimality condition
Spheres
Quadratic programming
Optimization
ISSN:0167-6377, 1872-7468
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present DCA for globally minimizing quadratic forms on Euclidean balls and spheres. Since these problems admit at most one local-nonglobal minimizer, DCA converges in general to a solution for these problems. Numerical simulations show robustness, stability and efficiency of DCA with respect to related standard methods.
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(96)00036-3