A bilinear formulation for vector sparsity optimization

Signal Processing

Volumn 88, Issue 2, 2008, Pages 375-389

  Peleg, Dori ^a   Meir, Ron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Indefinite quadratic programming; Pattern classification; Regression; Sparsity; Total variation

Indexed keywords

ALGORITHMS; OPTIMIZATION; PATTERN RECOGNITION; PROBLEM SOLVING; REGRESSION ANALYSIS; VECTOR QUANTIZATION;

BILINEAR FORMULATION; CARDINALITY PENALTY FUNCTION; INDEFINITE QUADRATIC PROGRAMMING; SPARSITY; VECTOR SPARSITY OPTIMIZATION;

SIGNAL PROCESSING;

EID: 35248871506     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sigpro.2007.08.015     Document Type: Article

References (35)

1. 1 minimization. Proc. Natl. Amer. Soc. 100 (2003) 2197-2202
2. Gribonval R., and Nielsen M. Sparse decompositions in "incoherent" dictionaries. Proceedings of the International Conference on Image Processing vol. 1 (September 2003) I33-I36
3. Fazel M., Hindi H., and Boyd S.P. Log-det heuristic for matrix rank minimization with applications to hankel and euclidean distance matrices. Proceedings of the American Control Conference vol. 3 (June 2003) 2156-2162
4. Bertsimas D., and Tsitsiklis J.N. Introduction to Linear Optimization (1997), Athena Scientific
5. Ye Y. On affine scaling algorithm for nonconvex quadratic programming. Math. Programming 56 1-3 (August 1992) 285-300
6. S.P. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, MA, 2004, 〈http://www.stanford.edu/∼boyd/cvxbook.html〉.
7. Sherali H.D., and Shetty C.M. A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts. Math. Programming 19 1 (December 1980) 14-31
8. Thieu T.V. A note on the solution of bilinear programming problems by reduction to concave minimization. Math. Programming 41 1-3 (May 1988) 249-260
9. Júdice J., and Faustino A.M. A computational analysis of LCP methods for bilinear and concave quadratic programming. Comput. Oper. Res. 18 9 (May 1991) 645-654
10. Audet C., Hansen P., Jaumard B., and Savard G. A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Programming 85 3 (August 1999) 573-592
11. Fernandes L., Friedlander A., Guedes M., and Júdice J. Solution of a general linear complementarity problem using smooth optimization and its application to bilinear programming and LCP. Appl. Math. Optim. 43 1 (January 2001) 1-19
12. Alarie S., Audet C., Jaumard B., and Savard G. Concavity cuts for disjoint bilinear programming. Math. Programming 90 2 (April 2001) 373-398
13. Floudas C.A., and Visweswaran V. Quadratic Optimization, Handbook of Global Optimization (1994), Kluwer Academic Publishers pp. 217-270
14. Ye Y. On the complexity of approximating a KKT point of quadratic programming. Math. Programming 80 2 (January 1998) 195-211
15. Cambini R., and Sodini C. Decomposition methods for solving nonconvex quadratic programs via branch and bound. J. Global Optim. 33 3 (November 2005) 313-336
16. Bomze I.M., and de Klerk E. Solving standard quadratic optimization problems via linear, semidefinite and copositive programming. J. Global Optim. 24 2 (2002) 163-185
17. Ben-Tal A., and Teboulle M. Hidden convexity in some nonconvex quadratically constrained quadratic programming. Math. Programming 72 1 (1996) 51-63
18. Ye Y. Approximating global quadratic optimization with convex quadratic constraints. J. Global Optim. 15 1 (July 1999) 1-17
19. Zhang S. Quadratic maximization and semidefinite relaxation. Math. Programming 87 3 (May 2000) 453-465
20. Hansen P., Jaumard B., Ruiz M., and Xiong J. Global minimization of indefinite quadratic functions subject to box constraints. Naval Res. Logist. 40 3 (April 1993) 373-392
21. Hoai An L.T., and Pham Dinh T. A branch and bound method via d.c. optimization algorithms and llipsoidal technique for box constrained nonconvex quadratic problems. J. Global Optim. 13 2 (September 1998) 171-206
22. Vandenbussche D., and Nemhauser G.L. A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Programming 102 3 (April 2005) 559-575
23. Vandenbussche D., and Nemhauser G.L. A polyhedral study of nonconvex quadratic programs with box constraints. Math. Programming 102 3 (April 2005) 531-557
24. Hoai An L.T., Pham Dinh T., and Muu L.D. A Combined D.C. Optimization-ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems. J. Combin. Optim. 2 1 (March 1998) 9-28
25. S. Burer, D. Vandenbussche, A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations, Math. Programming, December 2006.
26. Bomze I.M. Branch-and-bound approaches to standard quadratic optimization problems. J. Global Optim. 22 1-4 (January 2002) 17-37
27. Raber U. A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J. Global Optim. 13 4 (December 1998) 417-432
28. Nowak I. Dual bounds and optimality cuts for all-quadratic programs with convex constraints. J. Global Optim. 18 4 (December 2000) 337-356
29. Ye Y. New results on quadratic minimization. SIAM J. Optim. 14 1 (January 2003) 245-267
30. The MOSEK Optimization Software, 〈http://www.mosek.com/〉.
31. Gorodnitsky I.F., and Rao B.D. Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm. IEEE Trans. Signal Process. 45 3 (March 1997) 600-616
32. Duda R.O., Hart P.E., and Stork D.G. Pattern Classification. second ed. (2000), Cambridge University Press, Cambridge
33. Cristianini N., and Shawe-Taylor J. An introduction to support vector machines and other kernel-based learning methods (2001), Wiley, New York
34. Zhang T. Statistical behavior and consistency of classification methods based on convex risk minimization. Ann. Statist. 32 1 (2004) 56-85
35. Weston J., Elisseeff A., Schölkopf B., and Tipping M. Use of the zero norm with linear models and kernel methods. J. Mach. Learn. Res. 3 (March 2003) 1439-1461