An efficient ‘p1’ algorithm for dual mixed-integer least-squares problems with scalar real-valued parameters

HIGHLIGHTS

• What: By means of numerical simulations here based on Global Navigation Satellite System (GNSS) models the authors show the efficiency of this proposed ‘P1` algorithm meanwhile also demonstrating its quasi-optimal statistical performance. In Figure 1, the authors provide â (b) with Qâ (b) ∈ ℝn×n as conditional variance-covariance matrix of ambiguities. Based on 2,000 samples (n=3), the authors show in Figure 5 the maximum number of integer candidates (in blue) as defined by Eq , which seems to well approximate the potential number of candidates (in orange) iterated in the MAIN SEARCH step (see . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.