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

[1]  O. E. Flippo,et al.  Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid , 1996 .

[2]  Marc Teboulle,et al.  Hidden convexity in some nonconvex quadratically constrained quadratic programming , 1996, Math. Program..

[3]  Tao Pham Dinh,et al.  Proximal Decomposition on the Graph of a Maximal Monotone Operator , 1995, SIAM J. Optim..

[4]  Henry Wolkowicz,et al.  Indefinite Trust Region Subproblems and Nonsymmetric Eigenvalue Perturbations , 1995, SIAM J. Optim..

[5]  P. D. Tao.  Lagrangian Stability and Global Optimality in Nonconvex Quadratic Minimization Over Euclidean Balls and Spheres , 1995 .

[6]  José Mario Martínez,et al.  Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres , 1994, SIAM J. Optim..

[7]  Hoai An Le Thi,et al.  STABILITE DE LA DUALITE LAGRANGIENNE EN OPTIMISATION D.C. (DIFFERENCE DE DEUX FONCTIONS CONVEXES) , 1994 .

[8]  L. Thi,et al.  Analyse numérique des algorithmes de l'optimisation D. C. . Approches locale et globale. Codes et simulations numériques en grande dimension. Applications , 1994 .

[9]  P. D. Tao,et al.  Partial regularization of the sum of two maximal monotone operators , 1993 .

[10]  G. Golub,et al.  Quadratically constrained least squares and quadratic problems , 1991 .

[11]  T. P. Dinh,et al.  Analysis of plane and axisymmetric flows of incompressible fluids with the stream tube method: Numerical simulation by trust‐region optimization algorithm , 1991 .

[12]  T. Dinh,et al.  Training multi-layered neural network with a trust-region based algorithm , 1990 .

[13]  W. Gander,et al.  A Constrained Eigenvalue Problem , 1989 .

[14]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[15]  Pham Dinh Tao,et al.  Duality in D.C. (Difference of Convex functions) Optimization. Subgradient Methods , 1988 .

[16]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[17]  J. Hiriart-Urruty,et al.  Trends in Mathematical Optimization , 1987 .

[18]  El Bernoussi Souad,et al.  Algorithms for Solving a Class of Nonconvex Optimization Problems. Methods of Subgradients , 1986 .

[19]  J. Hiriart-Urruty,et al.  FERMAT Days 85 : mathematics for optimization , 1986 .

[20]  P. D. Tao.  Convergence of a subgradient method for computing the bound norm of matrices , 1984 .

[21]  Pham Dinh Tao.  Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du maximum , 1984 .

[22]  Jorge J. Moré,et al.  Computing a Trust Region Step , 1983 .

[23]  Martin Grötschel,et al.  Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.

[24]  D. Sorensen.  Newton's method with a model trust region modification , 1982 .

[25]  Jorge J. Moré,et al.  Recent Developments in Algorithms and Software for Trust Region Methods , 1982, ISMP.

[26]  David M. author-Gay.  Computing Optimal Locally Constrained Steps , 1981 .

[27]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .