semidefinite programs
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
A Perturbed q-Tsallis Self-Concordant Barrier for Spectrally Robust Semidefinite Programming
Announce Type: cross Abstract: We introduce and analyse a perturbed $q$-Tsallis barrier for semidefinite programming (SDP), defined as a spectral perturbation of the classical log-det barrier on the cone of positive definite matrices. The barrier introduces eigenvalue-adaptive stiffening through a Tsallis-type matrix-power term controlled by parameters $q>1$ and $\eta\geq0$. Our main theoretical contribution is a sharp characterisation of the differential self-concordance regime of the...
Semidefinite Programming Certificates for Synchronization of Kuramoto Oscillators on Arcs
arXiv:2606.03591v1 Announce Type: cross Abstract: A class of Kuramoto models with a general coupling function that can be expressed in terms of a finite number of harmonics, each comprising sinusoidal terms, is studied. We propose a novel approach for certifying local phase synchronization in this class for all initial conditions lying on an arc. The trace parametrization property and Gram matrix representation of a trigonometric polynomial are utilized along with Putinar's...
Suboptimality bounds for trace-bounded SDPs enable a faster and scalable low-rank SDP solver SDPLR+
arXiv:2406.10407v3 Announce Type: replace-cross Abstract: Semidefinite programs (SDPs) and their solvers are powerful tools with many applications in machine learning and data science. Designing scalable SDP solvers is challenging because by standard the positive semidefinite decision variable is an $n \times n$ dense matrix, even though the input is often an $n \times n$ sparse matrix. However, the solution may not require a full-rank matrix, as shown by Barvinok and Pataki.
Affine Filtering Measurements and Their Applications to Quantum Decoding
Announce Type: cross Abstract: Unambiguous state discrimination (USD) measurements are attractive because outcomes are either marked as conclusive (i.e., error free) or inconclusive (i.e., erased). We study affine filtering measurements, a structured variant of USD for decoding classical linear codes over pure-state classical-quantum channels, where a conclusive outcome identifies an affine subspace containing the transmitted codeword and an inconclusive outcome is treated as an erasure. For...
Exploiting Chordal Sparsity for Globally Optimal Estimation with Factor Graphs
arXiv:2605.30617v1 Announce Type: new Abstract: Robust and efficient state estimation is crucial for perception, navigation, and control in robotics. State estimation problems are conveniently modeled using the factor-graph framework as enabled by modern software packages such as GTSAM or g2o. However, the standard solvers included in such frameworks are local and may converge to poor local minima, posing significant safety concerns.
Bounding Eigenstate Overlap from Hamiltonian Moments: Success Probability Guarantees for Quantum Phase Estimation
Announce Type: replace-cross Abstract: Estimating the overlap between a prepared state and a target eigenstate is crucial for the efficiency of quantum phase estimation (QPE), since QPE succeeds with probability equal to this overlap. We present a systematically improvable method to compute certified upper and lower bounds on such overlaps using a finite set of Hamiltonian moments.
Data-Driven Min-Max MPC with Integral Quadratic Constraints
Announce Type: new Abstract: Data-driven control of nonlinear systems with rigorous guarantees is a challenging control problem. Integral quadratic constraints (IQCs) provide a powerful framework for modeling nonlinearities. This paper presents a data-driven min-max model predictive control (MPC) synthesis method for unknown systems subject to (nonlinear) uncertainties using the IQC framework.
Dual Lyapunov-based Synchronization Control of R\"ossler System
Announce Type: cross Abstract: This paper proposes a novel approach for the synchronization problem of nonlinear dynamical systems, integrating dual Lyapunov stability analysis with polynomial optimization. A comprehensive review of the relevant scientific literature on synchronization methods is conducted, with a particular focus on classical Lyapunov-based methods for chaotic systems. In this study, the R\"ossler system is synchronized by employing dual Lyapunov-based closed-loop...
A Reproducible and Physically Feasible Dynamic Parameter Identification Framework for a Low-Cost Robot Arm
Announce Type: replace Abstract: This paper presents a reproducible and physically feasible dynamic parameter identification framework for CRANE-X7, a low-cost robot arm driven by modular smart actuators. To improve practical identifiability, products of inertia are removed according to approximate link symmetry, reducing the rigid-body model from 65 to 39 base parameters. Identification motions are hand-designed from structured single-joint and adjacent-joint primitives under practical...
Rotatable Antenna-Enabled Mobile Edge Computing
Announce Type: replace Abstract: In the evolving landscape of mobile edge computing (MEC), enhancing communication reliability and computation efficiency to support increasingly stringent low-latency services remains a fundamental challenge. Rotatable antenna (RA) is a promising technology that introduces new spatial degrees of freedom (DoFs) to tackle this challenge. In this letter, we investigate an RA-enabled MEC system where antenna boresight directions can be independently adjusted to...