Results 131 to 140 of about 6,081 (225)

A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming

, 1997
This note establishes a new sufficient condition for the existence and uniqueness of the Alizadeh-Haeberly-Overton direction for semidefinite programming.
Monteiro, Renato D. C., Zanjácomo, Paulo R.   +1 more
core  

Imaging through scattering media using semidefinite programming. [PDF]

J Biomed Opt, 2018
Chen H, Gao Y, Liu X, Zhou Z.
europepmc   +1 more source

Matrix convex functions with applications to weighted centers for semidefinite programming

In this paper, we develop various calculus rules for general smooth matrix-valued functions and for the class of matrix convex (or concave) functions first introduced by Loewner and Kraus in 1930s.
Zhang, S., Luo, Z-Q., Brinkhuis, J.
core  

Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming [PDF]

, 1996
In this paper we generalize the primal--dual cone affine scaling algorithm of Sturm and Zhang to semidefinite programming. We show in this paper that the underlying ideas of the cone affine scaling algorithm can be naturely applied to semidefinite ...
Zhang, S (Shuzhong), Sturm, JF, Sturm, J.F., Sturm, Jos F., Berkelaar, Arjan B., Zhang, S. (Shuzhong), Zhang, Shuzhong, Berkelaar, A.B. (Arjan), Berkelaar, AB (Arjan)   +8 more
core  

Theory and algorithms in semidefinite programming.

, 2001
During this decade, semidefinite programming has emerged as an important area of optimization due to both the success of interior point methods at solving this problem and the growing number of its application areas such as combinatorial optimization ...
Choi, Beong
core  

Learning the kernel matrix with semidefinite programming

, 2004
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points.
Nello Cristianini, Bernhard Schölkopf, Peter Bartlett, Bartlett, P. L., Lanckriet, G, Laurent El Ghaoui, Lanckriet, G. R. G., Cristianini, N, Jordan, MI, Jordan, M. I., Cristianini, N., Michael I. Jordan, El Ghaoui, L, Bartlett, P, Gert R. G. Lanckriet, Gert Lanckriet, El Ghaoui, L.   +16 more
core  

Polynomial optimization using semidefinite programming

, 2018
In this thesis, our goal is to study the problem of minimizing a polynomial p(x) using semidefinite matrices. Our discussion will cover Lagrangian duality and conic programming, followed by a discussion on how nonnegative polynomials can be approximated ...
Smith, Michael D.
core  

Graph coloring and semidefinite rank

This paper considers the interplay between semidefinite programming, matrix rank, and graph coloring. Karger et al. (J ACM 45(2):246–265, 1998) give a vector program in which a coloring of a graph can be encoded as a semidefinite matrix of low rank.
Williamson, David P., Smedira, Devin, Mirka, Renee   +2 more
core   +1 more source

Complementarity and nondegeneracy in semidefinite programming

, 1997
Primal and dual nondegeneracy conditions are defined for semidefinite programming. Given the existence of primal and dual solutions, it is shown that primal nondegeneracy implies a unique dual solution and that dual nondegeneracy implies a unique primal ...
Haeberly, Jean-Pierre A., Overton, Michael L., Alizadeh, Farid   +2 more
core  

Determining protein structures from NOESY distance constraints by semidefinite programming. [PDF]

J Comput Biol, 2013
Alipanahi B, Krislock N, Ghodsi A, Wolkowicz H, Donaldson L, Li M.   +5 more
europepmc   +1 more source