Abstract
We prove in this paper the stability of the Lagrangian duality in nonconvex quadratic minimization over Euclidean balls and spheres. As direct consequences we state both global optimality conditions in these problems and detailed descriptions of the structure of their solution sets. These results are essential for devising solution algorithms.
References
- J.R. Clermont, M.E de la Lande and Pham Dinh Tao: Analysis of plane and axisymmetric flows of incompressible fluids with the stream tube method: Numerical simulation by Trust region algorithm, Inter. J. for Numer. Method in Fluids, vol. 13, 371–399, 1991.https://doi.org/10.1002/fld.1650130308Google Scholar
- R. Fletcher: Practical methods of optimization, A Wiley-Interscience publication, Second Edition, 1991.Google Scholar
- W. Gander, G.H. Golub and U. von Matt: A constrained eigenvalue problem, Linear Algebra and its Application, 114/115, 815–839, 1989.https://doi.org/10.1016/0024-3795(89)90494-1Google Scholar
- D.M. Gay: Computing optimal locally constrained steps, SIAM J. Sci. Stat. Comput., 2, 186–197, 1981.https://doi.org/10.1137/0902016Google Scholar
- G.H Golub, C. van Loan: Matrix computation, North Oxford Academic, Oxford, 1989.Google Scholar
- G.H. Golub, U. von Matt: Quadratically constrained least squares and quadratic problems, Numer. Math. 59, 561–580, 1991.https://doi.org/10.1007/BF01385796Google Scholar
- J. Martinez: Local minimizers of quadratic functions on euclidean balls and spheres, SIAM J. Optimization, Vol.4, No 1, 159–176, 1994.https://doi.org/10.1137/0804009Google Scholar
- J.J. More: Recent developments in algorithm and software for Trust Region Methods. Mathematical Programming, The State of the Art, Springer, Berlin, 258–287, 1983.https://doi.org/10.1007/978-3-642-68874-4_11Google Scholar
- J.J. More, D.C. Sorensen: Computing a trust region step. SIAM J. Sci. Stat. Comput., 4, 553–572, 1983.https://doi.org/10.1137/0904038Google Scholar
- Pham Dinh Tao: Méthodes numériques pour la minimisation globale d’une forme quadratique (convexe ou non convexe) sur une boule et une sphère euclidiennes. Rapport de recherche. Université Joseph-Fourier, Grenoble, 1989.Google Scholar
- Pham Dinh Tao, S.Wang: Training multi-layered neural network with a Trust region based algorithm, Math. Modell. Numer. Anal. (M2 AN), 24(4), 523–553, 1990.https://doi.org/10.1051/m2an/1990240405231Google Scholar
- Pham Dinh Tao, Le Thi Hoai An: Minimisation globale d’une forme quadratique sur une boule et une sphère euclidiennes. Stabilité de la dualité lagrangienne. Optimalité globale. Méthodes numériques. Rapport de Recherche, L.M.I, CNRS URA 1378, INSA-Rouen, 1992.Google Scholar
- Pham Dinh Tao, Le Thi Hoai An and Thai Quynh Phong: Numerical methods for globally solving a class of nonconvex quadratic programming, SubmittedGoogle Scholar
- B. Polyak: Introduction to Optimization. Optimization Software, Inc., Publication Division, New York, 1987.Google Scholar
- R.T. Rockafellar: Monotone operators and the proximal point algorithm in convex programming, SIAM J. on Control and Optim., 14, 877–898, 1976.https://doi.org/10.1137/0314056Google Scholar
- D.C. Sorensen: Newton’s method with a model trust region modification, SIAM J. Numer. Anal., 19(2), 409–426, 1982.https://doi.org/10.1137/0719026Google Scholar
- J.F. Toland: Duality in Nonconvex Optimization. J. Math. Anal. Appl., 66, 399–415, 1978.https://doi.org/10.1016/0022-247X(78)90243-3Google Scholar
Suggested citation
Published by Heldermann Verlag, 1995. Rights now held by Banach Press LLC.
