Eigenvalue techniques for convex objective, nonconvex optimization problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6080 LNCS, Issue , 2010, Pages 29-42

  Bienstock, Daniel ^a  

^a Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COSTS; CONVEX ANALYSIS; CONVEX HULL; CONVEX OBJECTIVES; EFFICIENT COMPUTATION; EIGEN-VALUE; FEASIBLE REGIONS; FEASIBLE SET; HIGH-DIMENSIONAL; LOWER BOUNDS; MINIMIZATION PROBLEMS; MINIMUM DISTANCE; NONCONVEX; NONCONVEX OPTIMIZATION PROBLEM; OPTIMIZATION PROBLEMS;

COMBINATORIAL OPTIMIZATION; CONVEX OPTIMIZATION; DYNAMIC PROGRAMMING; EIGENVALUES AND EIGENFUNCTIONS;

INTEGER PROGRAMMING;

EID: 77954409640     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13036-6_3     Document Type: Conference Paper

References (21)

1. Ben-Tal, A., Nemirovsky, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2001)
2. Bienstock, D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Programming 74, 121-140 (1996)
3. Bienstock, D., Zuckerberg, M.: Subset algebra lift algorithms for 0-1 integer programming. SIAM J. Optimization 105, 9-27 (2006)
4. Bienstock, D., McClosky, B.:Tightening simple mixed-integer sets with guaranteed bounds (submitted 2008)
5. Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear matrix inequalities in system and control theory. SIAM, Philadelphia (1994)
6. Cook, W., Kannan, R., Schrijver, A.: Chv'atal closures for mixed integer programs. Math. Programming 47, 155-174 (1990)
7. De Farias, I., Johnson, E., Nemhauser, G.: A polyhedral study of the cardinality constrained knapsack problem. Math. Programming 95, 71-90 (2003)
8. Golub, G.H.: Some modified matrix eigenvalue problems. SIAM Review 15, 318-334 (1973)
9. Golub, G.H., van Loan, C.: Matrix Computations. Johns Hopkins University Press, Baltimore (1996)
10. Frangioni, A., Gentile, C.: Perspective cuts for a class of convex 0-1 mixed integer programs. Mathematical Programming 106, 225-236 (2006) (Pubitemid 43177353)
11. Frangioni, A., Gentile, C.: SDP Diagonalizations and Perspective Cuts for a Class of Nonseparable MIQP. Oper. Research Letters 35, 181-185 (2007) (Pubitemid 46275125)
12. Günlük, O., Linderoth, J.: Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 1-16. Springer, Heidelberg (2008)
13. Moghaddam, B., Weiss, Y., Avidan, S.: Generalized spectral bounds for sparse LDA. In: Proc. 23rd Int. Conf. on Machine Learning, pp. 641-648 (2006)
14. Moré, J.J., Sorensen, D.C.: Computing a trust region step. SIAM J. Sci. Stat. Comput. 4, 553-572 (1983)
15. Pólik, I., Terlaky, T.: A survey of the S-lemma. SIAM Review 49, 371-418 (2007)
16. Rendl, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program 77, 273-299 (1997) (Pubitemid 127412633)
17. Stern, R.J., Wolkowicz, H.: Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations. SIAM J. Optim. 5, 286-313 (1995)
18. Sturm, J., Zhang, S.: On cones of nonnegative quadratic functions. Mathematics of Operations Research 28, 246-267 (2003)
19. Miller, W., Wright, S., Zhang, Y., Schuster, S., Hayes, V.: Optimization methods for selecting founder individuals for captive breeding or reintroduction of endangered species (2009) (manuscript)
20. Yakubovich, V.A.: S-procedure in nonlinear control theory, vol. 1, pp. 62-77. Vestnik Leningrad University (1971)
21. Ye, Y., Zhang, S.: New results on quadratic minimization. SIAM J. Optim. 14, 245-267 (2003)