References
- Faigle U, Kern W, Still G. Kluwer texts in the mathematical sciences. Vol. 24. Dordrecht: Springer; 2002. Algorithmic principles of mathematical programming.
- Peterson DW. A review of constraint qualifications in finite-dimensional spaces. SIAM Rev. 1973;15:639–654.
- Danninger G. Role of copositivity in optimality criteria for nonconvex optimization problems. J. Optim. Theor. Appl. 1992;75:535–558.
- Bomze IM, Overton ML. Narrowing the difficulty gap for the Celis--Dennis--Tapia problem. Math. Program. Ser. B. 2015;151:459–476.
- Borwein JM. Necessary and sufficient conditions for quadratic minimality. Numer. Funct. Anal. Optim. 1982;5:127–140.
- Contesse LB. Une caractérisation complète des minima locaux [A complete characterization of local minima]. Numer. Math. 1980;34:315–332.
- Majthay A. Optimality conditions for quadratic programming. Math. Program. 1971;1:359–365.
- Izmailov AF, Solodov MV. Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints. Comput. Optim. Appl. 2009;42:231–264.
- Yuan Y-X. On a subproblem of trust region algorithms for constrained optimization. Math. Program. Ser. A. 1990;47:53–63.
- Bomze IM, Demyanov V, Fletcher R, Terlaky T, Pólik I. Lecture notes in mathematics. Vol. 1989. New York (NY): Springer-Verlag; 2010. Nonlinear optimization.
- Bomze IM. Copositivity conditions for global optimality in indefinite quadratic programming problems. Czech. J. Oper. Res. 1992;1:7–19.
- Bomze IM. Copositive relaxation beats Lagrangian dual bounds in quadratically and linearly constrained QPs. SIAM J. Optim. 2015;25:1249–1275.
- Gay DM. Computing optimal locally constrained steps. SIAM J. Sci. Stat. Comput. 1981;2:186–197.
- Martínez JM. Local minimizers of quadratic functions on euclidean balls and spheres. SIAM J. Optim. 1994;4:159–176.