Results 71 to 80 of about 9,856 (164)
An Efficient NLOS Errors Mitigation Algorithm for TOA-Based Localization
Sensors, 2020 In time-of-arrival (TOA) localization systems, errors caused by non-line-of-sight (NLOS) signal propagation could significantly degrade the location accuracy.
Yanbin Zou, Huaping Liu
doaj +1 more source
Toward the Universal Rigidity of General Frameworks [PDF]
, 2011 Let (G,P) be a bar framework of n vertices in general position in R^d, d = d+1) anchors.Comment: v2, a revised version of an earlier submission ...
Alfakih, Abdo Y. +2 more
core
A Convex Optimization Approach to Compute Trapping Regions for Lossless Quadratic Systems
International Journal of Robust and Nonlinear Control, Volume 35, Issue 6, Page 2425-2436, April 2025.ABSTRACT Quadratic systems with lossless quadratic terms arise in many applications, including models of atmosphere and incompressible fluid flows. Such systems have a trapping region if all trajectories eventually converge to and stay within a bounded set.
Shih‐Chi Liao +3 more
wiley +1 more source
Worst-Case Linear Discriminant Analysis as Scalable Semidefinite Feasibility Problems
, 2014 In this paper, we propose an efficient semidefinite programming (SDP) approach to worst-case linear discriminant analysis (WLDA). Compared with the traditional LDA, WLDA considers the dimensionality reduction problem from the worst-case viewpoint, which ...
Hengel, Anton van den +3 more
core
IngenieríaContext: This study developed an energy dispatch model (EDM) using the Cauchy-based distribution optimizer (CbDO) for coordinating battery energy storage units (BESUs) and photovoltaic (PV) sources in medium-voltage distribution networks, aiming to ...
Maria Camila Vega Peña +2 more
doaj +1 more source
Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems [PDF]
We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite ...
Berc Rustem +2 more
core
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability [PDF]
QuantumMančinska and Roberson [FOCS'20] showed that two graphs are quantum isomorphic if and only if they admit the same number of homomorphisms from any planar graph. Atserias et al.
Prem Nigam Kar +3 more
doaj +1 more source
Physical-Layer Multicasting Design for Downstream G.fast DSL Transmission
IEEE Access, 2019 This paper studies the physical-layer multicasting design for downstream G.fast digital subscriber line (DSL) transmission, which corresponds to a multi-user multi-tone (i.e., multi-carrier) scenario. The design goal is to maximize the weighted-sum-group-
Wouter Lanneer +3 more
doaj +1 more source
, 2020 Semidefinite and sum-of-squares (SOS) optimization are fundamental computational tools in many areas, including linear and nonlinear systems theory. However, the scale of problems that can be addressed reliably and efficiently is still limited.
Papachristodoulou, Antonis +2 more
core
Optimal Power Flow for radial and mesh grids using semidefinite programming
TecnoLógicas, 2017 This paper presents a convex formulation for optimal power flow (OPF) in both radial and meshed grids. A semidefinite programming (SDP) approximation transforms the quadratic non-convex model into a relaxed convex quadratic model, which can be more ...
Oscar D. Montoya-Giraldo +2 more
doaj