Results 81 to 90 of about 6,028,400 (221)
Recently, there has been significant interest in filter methods for solving nonlinear problems. Extensions of these methods to nonlinear semidefinite programming (NLSDP) problems are described.
Dandan Li, Songhua Wang
doaj +1 more source
Semidefinite Programming Methods for Alleviating Sensor Position Error in TDOA Localization
This paper develops a unified solution for time-difference-of-arrival (TDOA) localization in the presence of sensor position errors. This technique starts with maximum likelihood estimation (MLE), which is known to be nonconvex.
Yanbin Zou, Huaping Liu, Wei Xie, Q. Wan
semanticscholar +1 more source
Abstract Alcohol policy liberalization is a contentious issue in the United States, including debates over whether grocery stores should be allowed to sell wine. This issue reflects a dilemma between accommodating consumer convenience, promoting wine industry growth, and generating tax revenue, versus concerns about potential harm to liquor stores ...
Jiayu Sun +3 more
wiley +1 more source
We devise two algorithms for approximating solutions of PSDisation, a problem in actuarial science and finance, to find the nearest valid correlation matrix that is positive semidefinite (PSD).
Vali Asimit +3 more
doaj +1 more source
Quantum algorithms for conformal bootstrap
With the help of recent developments in quantum algorithms for semidefinite programming, we discuss the possibility for quantum speedup for the numerical conformal bootstrap in conformal field theory.
Ning Bao, Junyu Liu
doaj +1 more source
A hybrid constraint programming and semidefinite programming approach for the stable set problem
This work presents a hybrid approach to solve the maximum stable set problem, using constraint and semidefinite programming. The approach consists of two steps: subproblem generation and subproblem solution.
B. Borchers +18 more
core +4 more sources
Computing Skinning Weights via Convex Duality
We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
Semidefinite Programming (SDP) is a fairly recent way of solving optimization problems which are becoming more and more important in our fast moving world. It is a minimization of linear function over the intersection of the cone of positive semidefinite
Rasa Giniūnaitė
doaj +1 more source
Ethnic Conflicts, Civil War, and Economic Growth: Region‐Level Evidence From Former Yugoslavia
ABSTRACT This paper studies the long‐term effects of the Yugoslav civil war (1987–1995) on subnational economic growth across 78 regions in five former Yugoslav republics from 1950 to 2015. We construct counterfactual growth trajectories using a robust region‐level donor pool from 32 conflict‐free countries.
Aleksandar Kešeljević +2 more
wiley +1 more source
Semidefinite Relaxation Method for Target Localization by MIMO Radar Using Bistatic Ranges
We address the target localization problem by using bistatic range (BR) measurements in widely separated multiple-input multiple-output (MIMO) radar network.
Bin Sun +3 more
doaj +1 more source

