On some properties of quadratic programs with a convex quadratic constraint

SIAM Journal on Optimization

Volumn 8, Issue 1, 1998, Pages 105-122

  Lucidi, Stefano ^a   Palagi, Laura ^a   Roma, Massimo ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Merit function; Quadratic function; 2 norm constraint

Indexed keywords

EID: 0032326764     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494278049     Document Type: Article

References (42)

1. A. BAGCHI AND B. KALANTARI, New Optimality Conditions and Algorithms for Homogeneous and Polynomial Optimization over Spheres, Tech. report 40-90, RUTCOR, Rutgers University, New Brunswick, NJ, 1990.
2. J. BUNCH AND B. PARLETT, Direct methods for solving symmetric indefinite systems of linear equations, SIAM J. Numer. Anal., 8 (1971), pp. 639-655.
3. T. F. COLEMAN AND C. HEMPEL, Computing a trust region step for a penalty function, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 180-201.
4. J. K. CULLUM AND R. A. WILLOUGHBY, Lanczos Algorithms for Large Symmetric Eigenvalue Computation, Birkhäuser Boston, Cambridge, MA, 1985.
5. R. DEMBO AND T. STEIHAUG, Truncated-Newton methods algorithms for large-scale unconstrained optimization, Math. Programming, 26 (1983), pp. 190-212.
6. G. DI PILLO AND L. GRIPPO, An exact penalty method with global convergence properties for nonlinear programming problems, Math. Programming, 36 (1986), pp. 1-18.
7. G. DI PILLO AND L. GRIPPO, Exact penalty functions in constrained optimization, SIAM J. Control Optim., 27 (1989), pp. 1333-1360.
8. F. FACCHINEI AND S. LUCIDI, Quadratically and superlinear convergent algorithms for the solution of inequality constrained optimization problems, J. Optim. Theory Appl., 85 (1985), pp. 265-289.
9. R. E. FLETCHER, A class of methods for nonlinear programming with termination and convergence properties, in Integer and Nonlinear Programming, J. Abadie, ed., North-Holland, Amsterdam, 1979, pp. 157-173.
10. A. FORSGREN, P. GILL, AND W. MURRAY, Computing modified Newton directions using a partial Cholesky factorization, SIAM J. Sci. Comput., 16 (1995), pp. 139-150.
11. G. FORSYTHE AND G. GOLUB, On the stationary values of a second-degree polynomial on the unit sphere. J. Soc. Indust. Appl. Math., 13 (1965), pp. 1050-1068.
12. D. M. GAY, Computing optimal locally constrained steps, SIAM J. Sci. Statist. Comput., 2 (1981), pp. 186-197.
13. T. GLAD AND E. POLAK, A multiplier method with automatic limitation of penalty growth, Math. Programming, 17 (1979), pp. 140-155.
14. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A nonmonotone line search technique for Newton's method, SIAM J. Numer. Anal., 23 (1986), pp. 707-716.
15. L. GRIPPO, F. LAMPARIELLO, AND S. LUCIDI, A truncated Newton method with nonmonotone linesearch for unconstrained optimization, J. Optim. Theory Appl., 60 (1989), pp. 401-419.
16. L. GRIPPO AND S. LUCIDI, A differentiable exact penalty function for bound constrained quadratic programming problems, Optimization, 22 (1991), pp. 557-578.
17. M. HEINKENSCHLOSS, On the solution of a two ball trust region subproblem, Math. Programming, 64 (1994), pp. 249-276.
18. M. HESTENES, Multiplier and gradient methods, J. Optim. Theory Appl., 4 (1969), pp. 303-320.
19. A. KAMATH AND N. KARMARKAR, A continuous approach to compute upper bounds in quadratic maximization problems with integer constraints, in Recent Advances in Global Optimization, C. A. Floudas and P. M. Pardalos, eds., Princeton University Press, Princeton, NJ, 1991, pp. 125-140.
20. S. KAPOOR AND P. VAIDYA, Fast algorithms for convex quadratic programming and multicommodity flows, in Proc. 18th Annual ACM Symp. Theory Comput., ACM, New York, 1986, pp. 147-159.
21. N. KARMARKAR, An interior-point approach to NP-complete problems, in Proc. Mathematical Programming Society Conference on Integer Programming and Combinatorial Optimization, University of Waterloo, Waterloo, ON, Canada, 1990, pp. 351-366.
22. N. KARMARKAR, M. G. C. RESENDE, AND K. RAMAKRISHNAN, An interior point algorithm to solve computationally difficult set covering problems, Math. Programming, 52 (1991), pp. 597-618.
23. W. LI, Differentiable piecewise quadratic exact penalty functions for quadratic programs with simple bound constraints, SIAM J. Optim., 6 (1996), pp. 299-315.
24. S. LUCIDI AND L. PALAGI, A class of algorithms for large scale trust region problems, Tech. report 36.96, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza," Roma, Italy, 1996.
25. S. LUCIDI, L. PALAGI, AND M. ROMA, Quadratic Programs with Quadratic Constraint: Characterization of KKT Points and Equivalence with an Unconstrained Problem, Tech. report 24.94, Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza," Roma, Italy, 1994.
26. J. MARTÍNEZ, Local minimizers of quadratic functions on Euclidean balls and spheres, SIAM J. Optim., 4 (1994), pp. 159-176.
27. J. MARTÍNEZ AND S. A. SANTOS, Trust region algorithms on arbitrary domains, Math. Programming, 68 (1995), pp. 267-302.
28. J. MORÉ, Generalization of the trust region problem, Optimization Methods and Software, 2 (1993), pp. 189-209.
29. J. MORÉ AND D. SORENSEN, On the use of directions of negative curvature in a modified Newton method, Math. Programming, 16 (1979), pp. 1-20.
30. J. MORÉ AND D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
31. P. M. PARDALOS, Y. YE, AND C.-G. HAN, Algorithms for the solution of quadratic knapsack problems, Linear Algebra Appl., 25 (1991), pp. 69-91.
32. M. J. D. POWELL, A method for nonlinear constraints in minimization problem, in Optimization, R. Fletcher, ed., Academic Press, New York, 1969, pp. 283-298.
33. F. RENDL AND H. WOLKOWICZ, A Semidefinite Framework to Trust Region Subproblems with Applications to Large Scale Minimization, Tech. report CORR Rep. 94-32, University of Waterloo, Department of Combinatorics and Optimization, Waterloo, ON, Canada, 1994.
34. S. A. SANTOS AND D. C. SORENSEN, A New Matrix-Free for the Large Scale Trust Region Subproblem, Tech. report TR95-20, Rice University, Houston, TX, 1995.
35. D. C. SORENSEN, Newton's method with a model trust region modification, SIAM J. Numer. Anal., 19 (1982), pp. 409-426.
36. D. C. SORENSEN, Minimization of a Large Scale Quadratic Function Subject to an Ellipsoidal Constraint, Tech. report TR94-27, Rice University, Houston, TX, 1994.
37. P. TOINT, Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, I. S. Duff, ed., Academic Press, London, 1981, pp. 57-88.
38. S. A. VAVASIS, Nonlinear Optimization, Oxford University Press, London, 1991.
39. S. A. VAVASIS AND R. ZIPPEL, Proving Polynomial-Time for Sphere-Constrained Quadratic Programming, Tech. report 90-1182, Department of Computer Science, Cornell University, Ithaca, NY, 1990.
40. Y. YE, A new complexity result on minimization of a quadratic function with a sphere constraint, in Recent Advances in Global Optimization, C. A. Floudas and P. M. Pardalos, eds., Princeton University Press, Princeton, NJ, 1991, pp. 19-31.
41. Y. YE, On affine scaling algorithms for nonconvex quadratic programming, Math. Programming, 56 (1992), pp. 285-300.
42. Y. YE AND E. TSE, An extension of Karmarkar's projective algorithm for convex quadratic programming, Math. Programming, 44 (1989), pp. 157-179.