Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid

European Journal of Operational Research

Volumn 94, Issue 1, 1996, Pages 167-178

  Flippo, Olaf E ^a   Jansen, Benjamin ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b CQM BV   (Netherlands)

Author keywords

Duality; Nonconvex programming; Quadratic programming; Sensitivity analysis; Trust region subproblem

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FUNCTIONS; MATHEMATICAL PROGRAMMING; SENSITIVITY ANALYSIS;

LAGRANGE DUALITY; NONCONVEX QUADRATIC OPTIMIZATION; OBJECTIVE FUNCTION; QUADRATIC PROGRAMMING; TRUST REGION SUBPROBLEM; UNCONSTRAINED MINIMIZATION;

OPTIMIZATION;

EID: 0041687075     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00199-9     Document Type: Article

References (25)

1. Bagchi, A., and Kalantari, B., "New optimality conditions and algorithms for homogeneous and polynomial optimization over spheres", RUTCOR Research Report 40-90, Rutgers University, RUTCOR, New Brunswick, NJ, 1990.
2. Dikin, I.I., "Iterative solution of problems of linear and quadratic programming", Soviet Mathematics Doklady 8 (1967) 674-675.
3. Gay, D.M., "Computing optimal locally constrained steps", SIAM Journal on Scientific and Statistical Computing 2(1981) 186-197.
4. Geoffrion, A.M., "3. Duality in Nonlinear Programming: A simplified applications-oriented development", in: A.M. Geoffrion (ed.), Perspectives on Optimization: A Collection of Expository Articles, Addison-Wesley, Reading, MA, 1972, 65-101.
5. Goldfeld, S.M., Quandt, R.E., and Trotter, H.F., "Maximization by quadratic hill-climbing", Econometrica 34 (1966) 541-551.
6. Golub, G.H., and Van Loan, C.F., Matrix Computations, 2nd ed., Johns Hopkins University Press, Baltimore, MD, 1989.
7. Hebden, M.D., "An algorithm for minimization using exact second derivatives", Report T.P. 515, Atomic Energy Research Establishment, Harwell, England, 1973.
8. Kamath, A.P., Karmarkar, N.K., Resende, M.G.C., and Ramakrishnan, K.G., "Computational experience with an interior point algorithm on the satisfiability problem", Annals of Operations Research 25 (1990) 43-58.
9. Karmarkar, N.K., Resende M.G.C., and Ramakrishnan, K.G., "An interior point algorithm to solve computationally difficult set covering problems", Mathematical Programming 52 (1991) 597-618.
10. Minoux, M., Mathematical Programming. Theory and Algorithms, Wiley, New York, 1986.
11. Moré, J.J., "Recent developments in algorithms and software for trust region methods", in: A. Bachem et al. (eds.), Mathematical Programming. The State of the Art, Springer-Verlag, Berlin, 1983, 258-287.
12. Moré, J.J., and Sorensen, D.C., "Computing a trust region step", SIAM Journal on Scientific and Statistical Computing 4 (1983) 553-572.
13. Moré, J.J., and Sorensen, D.C., "Newton's method", in: G.H. Golub (ed.), Studies in Numerical Analysis, The Mathematical Association of America, 1984, 29-82.
14. Ortega, J.M., Matrix Theory. A Second Course, Plenum, New York, 1987.
15. Reinsch, C.H., "Smoothing by spline functions", Numerische Mathematik 10 (1967) 177-183.
16. Reinsch, C.H., "Smoothing by spline functions II", Numerische Mathematik 16 (1971) 451-454.
17. Shor, N.Z., "An approach to obtaining global extremums in polynomial mathematical programming problems", Cybernetics 23 (1987) 695-700 (translated from Kibernetika 5 (1987) 102-106).
18. Shor, N.Z., "An approach to obtaining global extremums in polynomial mathematical programming problems", Cybernetics 23 (1987) 695-700 (translated from Kibernetika 5 (1987) 102-106).
19. Smale, S., "Newton's method estimates from data at one point", in: R.E. Ewing et al. (eds.), The Merging of Disciplines: New Directions in Pure, Applied and Computational Mathematics, Springer-Verlag, Berlin, 185-196.
20. Sorensen, D.C., "Newton's method with a model trust region modification", SIAM Journal on Numerical Analysis 19 (1982) 409-426.
21. Stern, R.J., and Wolkowicz, H., "Indefinite trust region subproblems and non-symmetric eigenvalue perturbations", Report CORR 92-38, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada, 1993.
22. Ye, Y., "On affine scaling algorithms for nonconvex quadratic programming", Mathematical Programming 56 (1992) 285-300.
23. Ye, Y., "A new complexity result on minimization of a quadratic function over a sphere constraint", Working Paper 90-23, College of Business Administration, The University of Iowa, Iowa City, IA, 1990.
24. Ye, Y., and Tse, E., "An extension of Karmarkar's projective algorithm for convex quadratic programming", Mathematical Programming 44 (1989) 157-179.
25. Yuan, Y., "On a subproblem of trust region algorithms for constrained optimization", Mathematical Programming 47 (1990) 53-63.