Constrained Least Squares, SDP, and QCQP Perspectives on Joint Biconvex Radar Receiver and Waveform design
Joint radar receive filter and waveform design is non-convex, but is individually convex for a fixed receiver filter while optimizing the waveform, and vice versa. Such classes of problems are fre- quently encountered in optimization, and are referred to biconvex programs. Alternating minimization (AM) is perhaps the most popu- lar, effective, and simplest algorithm that can deal with bi-convexity. In this paper we consider new perspectives on this problem via older, well established problems in the optimization literature. It is shown here specifically that the radar waveform optimization may be cast as constrained least squares, semi-definite programs (SDP), and quadratically constrained quadratic programs (QCQP). The bi-convex constraint introduces sets which vary for each iteration in the alternat- ing minimization. We prove convergence of alternating minimization for biconvex problems with biconvex constraints by showing the equivalence of this to a biconvex problem with constrained Cartesian product convex sets but for convex hulls of small diameter.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Error analysis for denoising smooth modulo signals on a graph
In many applications, we are given access to noisy modulo samples of a smooth function with the goal being to robustly unwrap the samples, i.e., to estimate the original samples of the function. In a recent work, Cucurin…
DenoisingEfficient Estimation of Sensor Biases for the 3-Dimensional Asynchronous Multi-Sensor System
An important preliminary procedure in multi-sensor data fusion is \textit{sensor registration}, and the key step in this procedure is to estimate sensor biases from their noisy measurements. There are generally two diffi…
Denoising modulo samples: k-NN regression and tightness of SDP relaxation
Many modern applications involve the acquisition of noisy modulo samples of a function $f$, with the goal being to recover estimates of the original samples of $f$. For a Lipschitz function $f:[0,1]^d \to \mathbb{R}$, su…
DenoisingregressionIterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
We study randomized sketching methods for approximately solving least-squares problem with a general convex constraint. The quality of a least-squares approximation can be assessed in different ways: either in terms of t…
Provably robust estimation of modulo 1 samples of a smooth function with applications to phase unwrapping
Consider an unknown smooth function $f: [0,1]^d \rightarrow \mathbb{R}$, and say we are given $n$ noisy mod 1 samples of $f$, i.e., $y_i = (f(x_i) + \eta_i)\mod 1$, for $x_i \in [0,1]^d$, where $\eta_i$ denotes the noise…
DenoisingRiemannian optimization