Search Results - 90C22 Mathematical Programming - semidefinite programming

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

“… ) similar to the classical MaxCut semidefinite program. We solve this problem using a provably convergent block coordinate descent algorithm whose structure is similar…”
Get full text

Generalized Gauss inequalities via semidefinite programming by Van Parys, Bart P. G., Goulart, Paul J., Kuhn, Daniel

“…A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming…”
Get full text

Positive semidefinite rank by Fawzi, Hamza, Gouveia, João, Parrilo, Pablo A., Robinson, Richard Z., Thomas, Rekha R.

“…Let M ∈ R p × q be a nonnegative matrix. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices A i , B j of size k…”
Get full text

Weak notions of nondegeneracy in nonlinear semidefinite programming by Andreani, Roberto, Haeser, Gabriel, Mito, Leonardo M., Ramírez, Héctor

“…The constraint nondegeneracy condition is one of the most relevant and useful constraint qualifications in nonlinear semidefinite programming…”
Get full text

New lower bounds on crossing numbers of Km,n from semidefinite programming by Brosch, Daniel, C. Polak, Sven

“…In this paper, we use semidefinite programming and representation theory to compute new lower bounds on the crossing number of the complete bipartite graph…”
Get full text

Sparse sums of squares on finite abelian groups and improved semidefinite lifts by Fawzi, Hamza, Saunderson, James, Parrilo, Pablo A.

“… ^ , S ) ) with maximal cliques related to T . Our result relies on two main ingredients: the decomposition of sparse positive semidefinite matrices with a chordal sparsity pattern…”
Get full text

Distributionally robust joint chance constraints with second-order moment information by Zymler, Steve, Kuhn, Daniel, Rustem, Berç

“…We develop tractable semidefinite programming based approximations for distributionally robust individual and joint chance constraints, assuming that only the first- and second-order moments as well…”
Get full text

On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming by Zhao, Qi, Chen, Zhongwen

“…This paper is concerned with a sequentially semidefinite programming (SSDP) algorithm for solving nonlinear semidefinite programming problems (NLSDP…”
Get full text

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

“… of $$x \in \mathbb {C}^n$$ x ∈ C n are m th unit roots. These polytopes have applications in MAX-3-CUT, digital communication technology, angular synchronization and more generally, complex quadratic programming. For $$m=2$$ m…”
Get full text

Two proposals for robust PCA using semidefinite programming by McCoy, Michael, Tropp, Joel A.

Get full text

A Line Search SQP-type Method with Bi-object Strategy for Nonlinear Semidefinite Programming by Fu, Wen-hao, Chen, Zhong-wen

“…We propose a line search exact penalty method with bi-object strategy for nonlinear semidefinite programming…”
Get full text

Copositivity and constrained fractional quadratic problems by Amaral, Paula, Bomze, Immanuel M., Júdice, Joaquim

“…) and Standard Fractional Quadratic Problem (StFQP). Based on these formulations, Semidefinite Programming relaxations are derived for finding good lower bounds…”
Get full text

Convex hull results on quadratic programs with non-intersecting constraints by Joyce, Alexander, Yang, Boshi

“…Let F ⊆ R n be a nonempty closed set. Understanding the structure of the closed convex hull C ¯ ( F ) : = conv ¯ { ( x , x x T ) | x ∈ F } in the lifted space…”
Get full text

Semidefinite relaxations of ordering problems by Hungerländer, P., Rendl, F.

“… The quadratic ordering problem does not seem to have attracted similar attention. We present a systematic investigation of semidefinite optimization based relaxations for the quadratic ordering problem, extending and improving existing approaches…”
Get full text

Solving clustered low-rank semidefinite programs arising from polynomial optimization by Leijenhorst, Nando, de Laat, David

“…We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix…”
Get full text

Sum-of-squares relaxations for polynomial min–max problems over simple sets by Bach, Francis

“…We consider min–max optimization problems for polynomial functions, where a multivariate polynomial is maximized with respect to a subset of variables, and the…”
Get full text

A preconditioned iterative interior point approach to the conic bundle subproblem by Helmberg, Christoph

“…The conic bundle implementation of the spectral bundle method for large scale semidefinite programming solves in each iteration a semidefinite quadratic subproblem by an interior point approach…”
Get full text

Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems by Sheen, Heejune, Yamashita, Makoto

“…Among many approaches to increase the computational efficiency of semidefinite programming (SDP…”
Get full text

On the tightness of an SDP relaxation for homogeneous QCQP with three real or four complex homogeneous constraints by Ai, Wenbao, Liang, Wei, Yuan, Jianhua

“… For this problem, we present a sufficient and necessary test condition to detect whether its standard semi-definite programming (SDP…”
Get full text

Models and algorithms for distributionally robust least squares problems by Mehrotra, Sanjay, Zhang, He

“… For the first case, we give an equivalent formulation and show that the optimization problem can be solved using a semidefinite optimization reformulation or polynomial time algorithms…”
Get full text