The trust-region subproblem minimizes a general quadratic function over an ellipsoid and can be solved in polynomial time using a semidefinite-programming (SDP) relaxation. Intersecting the feasible set with a second ellipsoid results in the two-trust-region subproblem (TTRS). Even though TTRS can also be solved in polynomial-time, existing algorithms do not use SDP. In this paper, we investiga...

Semidefinite programming (SDP) is one of the most active areas in mathematical programming, due to varied applications and the availability of interior point algorithms. In this paper we propose a new pre-processing technique for SDP instances that exhibit algebraic symmetry. We present computational results to show that the solution times of certain SDP instances may be greatly reduced via the...

We obtain a tight semidefinite relaxation of the MAX CUT problem which improves several previous SDP relaxation in the literature. Not only is it a strict improvement over the SDP relaxation obtained by adding all the triangle inequalities to the well-known SDP relaxation, but also it satisfy Slater constraint qualification (strict feasibility).

It has been shown that the problem of deterministically classifying constraints in semidefinite programming (SDP) is NP complete. An SDP is constructed that makes it possible to extend some constraint classification results from linear programming (LP) to SDP. Necessary and sufficient conditions for constraint classification, and ultimately, a deterministic method for detecting such are applied...

The experiment investigated the effect of maternal dietary supplementation of seaweed-derived polysaccharides (SDP) (-SDP v. +SDP, n   20) from day 83 of gestation until weaning (day 28) on selected sow faeces and piglet digesta microbiota populations, piglet small-intestinal morphology, and intestinal nutrient transporter and inflammatory cytokine gene expression at birth, 48 h after birth and...

Semideenite programming (denoted SDP) is an extension of linear programming (LP), with vector variables replaced by matrix variables and nonnegativity elementwise replaced by positive semideeniteness. Let us express a (primal) SDP as min C X s.t. AX = b X 0; where: C; X are in S n , the space of symmetric n n matrices; the inner product C X = trace CX; denotes nonnegativity in the LL owner part...

A significance determination process (SDP) is proposed that assigns risk characterization to inspection findings based on large early release frequency (LERF) considerations. This process is designed to interface directly with the SDP that is based on findings related to those structures, systems, and components (SSCs) that can influence the core damage frequency (CDF). The proposed LERF-based ...

This document defines a Session Description Protocol (SDP) cryptographic attribute for unicast media streams. The attribute describes a cryptographic key and other parameters that serve to configure security for a unicast media stream in either a single message or a roundtrip exchange. The attribute can be used with a variety of SDP media transports, and this document defines how to use it for ...

We consider semidefinite programming (SDP) formulations of certain truss topology optimization problems, where a lower bound is imposed on the fundamental frequency of vibration of the truss structure. These SDP formulations were introduced in: [M. Ohsaki, K. Fujisawa, N. Katoh and Y. Kanno, Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints, Co...