In this paper we consider low-rank semidefinite programming (LRSDP) relaxations of the max cut problem. Using the Gramian representation of a positive semidefinite matrix, the LRSDP problem isâ€¦ (More)

2015 23rd Mediterranean Conference on Control andâ€¦

2015

Internet evolution follows the customer needs, each algorithm, protocol, architecture, equipment, functionality succeeded when the users perceived a real benefit in using it. Taking into account theâ€¦ (More)

In this paper we consider the standard linear SDP problem, and its low rank nonlinear programming reformulation, based on a Gramian representation of a positive semidefinite matrix. For thisâ€¦ (More)

A standard quadratic optimization problem (StQP) consists of finding the largest or smallest value of a (possibly indefinite) quadratic form over the standard simplex which is the intersection of aâ€¦ (More)

The training of Support Vector Machines may be a very difficult task when dealing with very large datasets. The memory requirement and the time consumption of the SVMs algorithms grow rapidly withâ€¦ (More)