Search Results - "Complex semidefinite programming"

Phase recovery, MaxCut and complex semidefinite programming by Waldspurger, Irène, d’Aspremont, Alexandre, Mallat, Stéphane

“…Phase retrieval seeks to recover a signal x ∈ C p from the amplitude | A x | of linear measurements A x ∈ C n . We cast the phase retrieval problem as a…”
Get full text

An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding by Wu, Chenchen, Xu, Dachuan, Du, Donglei, Xu, Wenqing

“…Graph partition problems have been investigated extensively in combinatorial optimization. In this work, we consider an important graph partition problem which…”
Get full text

Approximation algorithms for Max-3-Cut and other problems via complex semidefinite programming by Goemans, Michel X., Williamson, David P.

Get full text

Certified and accurate SDP bounds for the ACOPF problem by Oustry, Antoine, D’Ambrosio, Claudia, Liberti, Leo, Ruiz, Manuel

“…We propose a new method for improving the bound tightness of the popular semidefinite programming (SDP) relaxation for the ACOPF introduced in Lavaei and Low…”
Get full text

Cuts and semidefinite liftings for the complex cut polytope by Sinjorgo, Lennart, Sotirov, Renata, Anjos, Miguel F.

“…We consider the complex cut polytope: the convex hull of Hermitian rank 1 matrices $$xx^\textrm{H}$$ x x H , where the elements of $$x \in \mathbb {C}^n$$ x ∈…”
Get full text

A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis by Sun, Jian, Zhang, Zan-Bo, Chen, Yannan, Han, Deren, Du, Donglei, Zhang, Xiaoyan

“… We formulate the MH3C-LU as a ternary quadratic program and present a randomized approximation algorithm based on the complex semidefinite programming relaxation technique…”
Get full text

On approximating complex quadratic optimization problems via semidefinite programming relaxations by So, Anthony Man-Cho, Zhang, Jiawei, Ye, Yinyu

“…In this paper the authors study semidefinite programming (SDP) models for a class of discrete and continuous quadratic optimization problems in the complex…”
Get full text

Complex Semidefinite Programming and Max-k-Cut by Newman, Alantha

“…In a second seminal paper on the application of semidefinite programming to graph partitioning problems, Goemans and Williamson showed how to formulate and…”
Get full text

Approximation algorithms for M ax-3-C ut and other problems via complex semidefinite programming by Goemans, Michel X., Williamson, David P.

“…A number of recent papers on approximation algorithms have used the square roots of unity, −1 and 1, to represent binary decision variables for problems in…”
Get full text

Phase Recovery, MaxCut and Complex Semidefinite Programming by Waldspurger, Irène, d'Aspremont, Alexandre, Mallat, Stéphane

“…Phase retrieval seeks to recover a signal x from the amplitude |Ax| of linear measurements. We cast the phase retrieval problem as a non-convex quadratic…”
Get full text

Mode control in a multimode fiber through acquiring its transmission matrix from a reference-less optical system by N'Gom, Moussa, Norris, Theodore B, Michielssen, Eric, Nadakuditi, Raj Rao

“…A simple imaging system, together with complex semidefinite programming, is used to generate the transmission matrix (TM…”
Get more information

Complex Matrix Decomposition and Quadratic Programming by Huang, Yongwei, Zhang, Shuzhong

“…This paper studies the possibilities of the linear matrix inequality characterization of the matrix cones formed by nonnegative complex Hermitian quadratic…”
Get full text

CPL-SLAM: Efficient and Certifiably Correct Planar Graph-Based SLAM Using the Complex Number Representation by Fan, Taosha, Wang, Hanlin, Rubenstein, Michael, Murphey, Todd

“… to convex complex semidefinite programming (SDP). Furthermore, we simplify the corresponding complex SDP to Riemannian staircase optimization (RSO…”
Get full text

Efficient and Guaranteed Planar Pose Graph optimization Using the Complex Number Representation by Fan, Taosha, Wang, Hanlin, Rubenstein, Michael, Murphey, Todd

“…) on the product of unit complex numbers, and relax this nonconvex quadratic complex optimization problem to complex semidefinite programming (SDP…”
Get full text

Complex Quadratic Optimization and Semidefinite Programming by Zhang, Shuzhong, Huang, Yongwei

“…) solution based on the optimal solution of the complex semidefinite programming relaxation problem…”
Get full text

High-dimensional analysis of semidefinite relaxations for sparse principal components by Amini, A.A., Wainwright, M.J.

“…)] separating success from failure. We then analyze a more complex semidefinite programming (SDP) relaxation due to dpsilaAspremont et al…”
Get full text

Mode Control in a Multimode Fiber Through Acquiring its Transmission Matrix from a Reference-less Optical System by N'Gom, Moussa, Norris, Theodore B, Michielssen, Eric, Raj Rao Nadakuditi

“…A simple imaging system together with complex semidefinite programming is used to generate the transmission matrix of a multimode fiber…”
Get full text

Efficient Convex Algorithms for Universal Kernel Learning by Talitckii, Aleksandr, Colbert, Brendon K, Peet, Matthew M

“… Semidefinite Programming (SDP) algorithms. In this paper, we pose the problem…”
Get full text

CPL-SLAM: Efficient and Certifiably Correct Planar Graph-Based SLAM Using the Complex Number Representation by Fan, Taosha, Wang, Hanlin, Rubenstein, Michael, Murphey, Todd

“… We formulate and simplify planar graph-based SLAM as the maximum likelihood estimation (MLE) on the product of unit complex numbers, and relax this nonconvex quadratic complex optimization problem to convex complex semidefinite programming (SDP…”
Get full text

Reference-less Method for Computing the Transmission Matrix of a Multimode Fiber by N'Gom, Moussa, Norris, Theodore B., Michielssen, Eric, Nadakuditi, Raj Rao

“…A simple imaging system together with complex semidefinite programming is used to generate the transmission matrix of a multimode fiber…”
Get full text