On Standard Quadratic Optimization Problems

Journal of Global Optimization

Volumn 13, Issue 4, 1998, Pages 369-387

  Bomze, Immanuel M ^a  

^a UNIVERSITY OF VIENNA   (Austria)

Author keywords

Maximum clique; Optimality conditions; Portfolio selection; Quadratic programming

Indexed keywords

COMPUTATIONAL METHODS; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SET THEORY; THEOREM PROVING; VECTORS;

MAXIMUM CLIQUE; OPTIMALITY CONDITIONS; OPTIMIZATION PROBLEMS (OP); PORTFOLIO SELECTION;

OPTIMIZATION;

EID: 0000462690     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008369322970     Document Type: Article

References (55)

1. Alizadeh, F. (1991), A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs, ACM-SIAM Symposium on Discrete Algorithms 2: 188-194.
2. Balas, E., Chvátal, V. and Nesetril, J. (1987), On the maximum weight clique problem, Math. Oper. Res. 12: 522-535.
3. Balas, E. and Xue, J. (1991), Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs, SIAM J. Comput. 20: 209-221.
4. Balas, E. and Yu, C.S. (1989), On graphs with polynomially solvable maximum-weight clique problem, Networks 19: 247-253.
5. Ballard, D.H. and Brown, C.M. (1982), Computer Vision, Prentice-Hall, Englewood Cliffs, NJ.
6. Baum, L.E. and Eagon, J.A. (1967), An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology, Bull. Amer. Math. Soc. 73: 360-363.
7. Baum, L.E. and Sell, G.R. (1968), Growth transformations for functions on manifolds, Pacif. J. Math. 27: 211-227.
8. Best, M.J. and Ding, B. (1997), Global and local quadratic minimization, J. Global Optimiz. 10: 77-90.
9. Bomze, I.M. (1983), Lotka-Volterra equation and replicator dynamics: a two-dimensional classification, Biol. Cybern. 48: 201-211.
10. Bomze, I.M. (1992), Copositivity conditions for global optimality in indefinite quadratic programming problems, Czechoslovak J. Oper. Res. 1: 7-19.
11. Bomze, I.M. (1992), Detecting all evolutionarily stable strategies, J. Optimization Theory Appl. 75: 313-329.
12. Bomze, I.M. (1996), Block pivoting and shortcut strategies for detecting copositivity, Linear Algebra and its Appl. 248: 161-184.
13. Bomze, I.M. (1997), Evolution towards the maximum clique, J. Global Optimiz. 10: 143-164.
14. Bomze, I.M. (1997), Global escape strategies for maximizing quadratic forms over a simplex, J. Global Optimiz. 11: 325-338.
15. Bomze I.M. and Danninger, G. (1994), A finite algorithm for solving general quadratic problems, J. Global Optimiz. 4: 1-16.
16. Bomze, I.M., Pelillo, M. and Giacomini, R. (1997), Evolutionary approach to the maximum clique problem: empirical evidence on a larger scale, in: I.M. Bomze, T. Csendes, R. Horst and P.M. Pardalos (eds.), Developments in Global Optimization, pp. 95-108. Kluwer Academic Publishers, Dordrecht/Boston/London.
17. Bomze, I.M., Pelillo, M. and Stix, V. (1998), Approximating the maximum weight clique: an evolutionary game theory approach, in preparation.
18. Bomze, I.M. and Stix, V. (1998), Genetical engineering via negative fitness: evolutionary dynamics for global optimization, to appear in Annals of O.R.
19. Budinich, M. (1997), Properties of the adjacency matrix and the maximum clique problem, presented at MAX-CLIQUE'97 - A Workshop on the Maximum Clique Problem and Its Applications, Trieste, Italy.
20. Chamberlain, G. (1983), A characterization of the distributions that imply mean-variance utility functions, J. Econ. Theo. 29: 185-201.
21. Comtet, L. Advanced Combinatorics, Reidel, Dordrecht.
22. Churilov, L., Bomze, I.M. and Sniedovich, M. (1997), Hypersensitivity analysis for portfolio selection, in preparation.
23. Cohen, J. and Hickey, T. (1979), Two algorithms for determining volumes of convex polyhedra, J. ACM 26: 401-414.
24. Crow, J.F. and Kimura, M. (1970), An introduction to population genetics theory, Harper & Row, New York.
25. Danninger, G. (1990), A recursive algorithm to detect (strict) copositivity of a symmetric matrix, in: U. Rieder, P. Gessner, A. Peyerimhoff and FJ. Radermacher (eds.), Methods of Operations Research, Vol. 62, pp. 45-52. Hain, Meisenheim.
26. De Angelis, P.L., Pardalos, P.M. and Toraldo, G. (1997), Quadratic programming with box constraints, in: I.M. Bomze, T. Csendes, R. Horst and P.M. Pardalos (eds.), Developments in Global Optimization, pp. 73-93, Kluwer Academic Publishers, Dordrecht/Boston/London.
27. Epstein, L. (1985), Decreasing risk aversion and mean-variance analysis, Econometrica 53: 945-962.
28. Gibbons, L.E., Hearn, D.W. and Pardalos, P.M. (1996), A continuous based heuristic for the maximum clique problem, in: D. Johnson and M. Trick (eds.), Cliques, Coloring, and Satisfiability: Second DlMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, American Mathematical Society.
29. Gibbons, L.E., Hearn, D.W., Pardalos, P.M. and Ramana, M.V. (1997), Continuous characterizations of the maximum clique problem, Math. Oper. Res. 22: 754-768.
30. Hofbauer, J. and Sigmund, K. The Theory of Evolution and Dynamical Systems, Cambridge University Press, Cambridge, UK.
31. Horaud, R. and Skordas, T. (1989), Stereo correspondence through feature grouping and maximal cliques, IEEE Trans. Pattern Anal. Machine Intell. 11: 1168-1180.
32. Horst, R., Pardalos, P.M. and Thoai, N.V., (1995), Introduction to Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
33. Huang, C.-F. and Litzenberger, R.H. (1988), Foundations for Financial Economics, 6th print, North-Holland, Amsterdam.
34. Hummel, R.A. and Zucker, S.W. (1983), On the foundations of relaxation labeling processes, IEEE Trans. Pattern Anal. Machine Intell. 5: 267-287.
35. Knuth, D.E. (1994), The sandwich theorem, Electronic J. Combinatorics A1.
36. Levinson, S.E., Rabiner, L.R. and Sondhi, M.M. (1983), An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition, Bell Syst. Tech. J. 62: 1035-1074.
37. Loukakis, E. and Tsouros, C. (1983), An algorithm for the maximally internally stable set in a weighted graph, Int. J. Computer Math. 13: 117-129.
38. Lyubich, Yu., Maistrowskii, G.D. and Ol'khovskii, Yu.G. (1980), Selection-induced convergence to equilibrium in a single-locus autosomal population, Problems of Information Transmission 16: 66-75.
39. Markowitz, H.M. (1952), Portfolio selection, J. of Finance 7: 77-91.
40. Markowitz, H.M. (1995), The general mean-variance portfolio selection problem, in: S.D. Howison, F.P. Kelly and P. Wilmott (eds.), Mathematical Models in Finance, pp. 93-99. Chapman & Hall, London.
41. Motzkin, T.S. and Straus, E.G. (1965), Maxima for graphs and a new proof of a theorem of Turán, Canad. J. Math. 17: 533-540.
42. Nemhauser, G.L. and Sigismondi, G. (1992), A strong cutting plane/branch-and-bound algorithm for node packing, J. Opl. Res. Soc. 43, 443-457.
43. Nemhauser, G.L. and Trotter, L.E. (1975), Vertex packings: Structural properties and algorithms, Math. Programming 8: 232-248.
44. Newey, W.K. and West, K.D. (1987), A simple, positive semi-definite, heteroskedasticity and autocorrelation consistent covariance matrix, Econometrica 55: 703-708.
45. Pardalos, P.M. and Desai, N. (1991), An algorithm for finding a maximum weighted independent set in an arbitrary graph, Int. J. Computer Math. 38: 163-175.
46. Pardalos, P.M. and Phillips, A.T. (1990), A global optimization approach for solving the maximum clique problem, Int. J. Computer Math. 33: 209-216.
47. Pardalos, P.M. and Xue, J. (1994), The maximum clique problem, J. Global Optimiz. 4: 301-328.
48. Pelillo, M. (1994), On the dynamics of relaxation labeling processes, Proc. IEEE Int. Conf. Neural Networks, Orlando, FL, pp. 1006-1011.
49. Pelillo, M. (1995), Relaxation labeling networks for the maximum clique problem, J. Artif. Neural Networks 2: 313-327.
50. Pelillo, M. and Jagota, A. (1995), Feasible and infeasible maxima in a quadratic program for maximum clique, J. Artif. Neural Networks 2: 411-420.
51. Pötscher, B.M. and Prucha, I.R. (1997), Dynamic Nonlinear Econometric Models - Asymptotic Theory, Springer, Berlin.
52. Rosenfeld, A., Hummel, R.A. and Zucker, S.W. (1976), Scene labeling by relaxation operations, IEEE Trans. Syst. Man Cybern. 6: 420-433.
53. Sigmund, K. (1987), Game dynamics, mixed strategies, and gradient systems, Theor. Pop. Biol. 32: 114-126.
54. Venkateswar, V. and Chellappa, R. (1995), Hierarchical stereo and motion correspondence using feature groupings, Int. J. Computer Vision 15: 245-269.
55. Ye, Y. (1997), Approximating quadratic programming with quadratic constraints, Working Paper, Department of Management Science, University of Iowa, Iowa City, IA 52242.