Results 191 to 200 of about 6,028,400 (221)
Some of the next articles are maybe not open access.
Distribution System State Estimation: A Semidefinite Programming Approach
IEEE Transactions on Smart Grid, 2019Distribution system state estimation (DSSE) is one of the vital components in the next-generation distribution management system which allows operators to monitor the entire system’s operating conditions.
Yiyun Yao +3 more
semanticscholar +1 more source
Semidefinite Programming for NLOS Error Mitigation in TDOA Localization
IEEE Communications Letters, 2018Non-line-of-sight (NLOS) error mitigation for the time-of-arrival (TOA) localization has been extensively studied, but these methods cannot be directly applied for the time-difference-of-arrival (TDOA) systems. Recent work has applied convex optimization
Zhenqiang Su, Genfu Shao, Huaping Liu
semanticscholar +1 more source
Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
Nonlinearity, 2018We present methods for bounding infinite-time averages in dynamical systems governed by nonlinear PDEs. The methods rely on auxiliary functionals, which are similar to Lyapunov functionals but satisfy different inequalities. The inequalities are enforced
D. Goluskin, Giovanni Fantuzzi
semanticscholar +1 more source
2016
Diese Masterarbeit beschäftigt sich mit dem Thema der semidefiniten Programmierung und ihrer Anwendung im Bereich der Finanzwirtschaft. Es werden die theoretischen Grundlagen der semidefiniten Programmierung und darauf aufbauende Algorithmen vorgestellt. Danach werden verschiedene Anwendungen in der Finanzwirtschaft diskutiert.
openaire +1 more source
Diese Masterarbeit beschäftigt sich mit dem Thema der semidefiniten Programmierung und ihrer Anwendung im Bereich der Finanzwirtschaft. Es werden die theoretischen Grundlagen der semidefiniten Programmierung und darauf aufbauende Algorithmen vorgestellt. Danach werden verschiedene Anwendungen in der Finanzwirtschaft diskutiert.
openaire +1 more source
IEEE Sensors Journal, 2016
We address the problem of locating multiple sources from the Euclidean distance matrix (EDM), which can be obtained from the received signal strength or time of arrival measurements.
Xiansheng Guo, L. Chu, Xiang Sun
semanticscholar +1 more source
We address the problem of locating multiple sources from the Euclidean distance matrix (EDM), which can be obtained from the received signal strength or time of arrival measurements.
Xiansheng Guo, L. Chu, Xiang Sun
semanticscholar +1 more source
Semidefinite Programming Problems
1999Semidefinite programming involves the minimization of a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Several types of problems can be transformed to this form. This constraint is in general nonlinear and nonsmooth yet convex.
Christodoulos A. Floudas +8 more
openaire +1 more source
Semidefinite Programming Relaxation for Nonconvex Quadratic Programs
Journal of Global Optimization, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fujie, Tetsuya, Kojima, Masakazu
openaire +2 more sources
Experimental Mathematics, 2016
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc and Vallentin ...
Fabrício Caluza Machado +1 more
semanticscholar +1 more source
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere. Mittelmann and Vallentin (2010), based on the semidefinite programming bound of Bachoc and Vallentin ...
Fabrício Caluza Machado +1 more
semanticscholar +1 more source
Semidefinite programming and combinatorial optimization
Mathematical Programming, 1997We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovász theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the ...
openaire +3 more sources

