checkRd: (-1) PeakSegFPOP.Rd:12: Lost braces; missing escapes or markup?
    12 | {-1,0,1} which minimize the penalized Poisson Loss,
       | ^
checkRd: (-1) PeakSegFPOP.Rd:13: Lost braces; missing escapes or markup?
    13 | penalty*sum_{i=1}^{N_1} I(c_i=1) + sum_{i=1}^N
       |             ^
checkRd: (-1) PeakSegFPOP.Rd:13: Lost braces; missing escapes or markup?
    13 | penalty*sum_{i=1}^{N_1} I(c_i=1) + sum_{i=1}^N
       |                   ^
checkRd: (-1) PeakSegFPOP.Rd:13: Lost braces; missing escapes or markup?
    13 | penalty*sum_{i=1}^{N_1} I(c_i=1) + sum_{i=1}^N
       |                                        ^
checkRd: (-1) PeakSegFPOP.Rd:15: Lost braces; missing escapes or markup?
    15 | change is up and the next change is down, etc (sum_{i=1}^t c_i in
       |                                                    ^
checkRd: (-1) PeakSegFPOP.Rd:16: Lost braces; missing escapes or markup?
    16 | {0,1} for all t<N-1), and (2) the last change is down
       | ^
checkRd: (-1) PeakSegFPOP.Rd:17: Lost braces; missing escapes or markup?
    17 | 0=sum_{i=1}^{N-1}c_i, and (3) Every zero-valued change-point
       |       ^
checkRd: (-1) PeakSegFPOP.Rd:17: Lost braces; missing escapes or markup?
    17 | 0=sum_{i=1}^{N-1}c_i, and (3) Every zero-valued change-point
       |             ^
checkRd: (-1) PeakSegFPOP.Rd:19: Lost braces; missing escapes or markup?
    19 | m_i=m_{i+1}, (4) every positive-valued change-point variable may
       |       ^
checkRd: (-1) PeakSegFPOP.Rd:20: Lost braces; missing escapes or markup?
    20 | have an up change after: c_i=1 implies m_i<=m_{i+1}, (5) every
       |                                               ^
checkRd: (-1) PeakSegFPOP.Rd:22: Lost braces; missing escapes or markup?
    22 | after: c_i=-1 implies m_i>=m_{i+1}. Note that when the equality
       |                              ^
checkRd: (-1) PeakSegPDPA.Rd:11: Lost braces; missing escapes or markup?
    11 | means) and (N-1)-vector C of change-point indicators in {-1,0,1}
       |                                                         ^
checkRd: (-1) PeakSegPDPA.Rd:12: Lost braces; missing escapes or markup?
    12 | which minimize the Poisson Loss, sum_{i=1}^N
       |                                      ^
checkRd: (-1) PeakSegPDPA.Rd:15: Lost braces; missing escapes or markup?
    15 | and the next change is down, etc (sum_{i=1}^t c_i in {0,1} for all
       |                                       ^
checkRd: (-1) PeakSegPDPA.Rd:15: Lost braces; missing escapes or markup?
    15 | and the next change is down, etc (sum_{i=1}^t c_i in {0,1} for all
       |                                                      ^
checkRd: (-1) PeakSegPDPA.Rd:17: Lost braces; missing escapes or markup?
    17 | segment mean after: c_i=0 implies m_i=m_{i+1}, (4) every
       |                                         ^
checkRd: (-1) PeakSegPDPA.Rd:19: Lost braces; missing escapes or markup?
    19 | c_i=1 implies m_i<=m_{i+1}, (5) every negative-valued change-point
       |                      ^
checkRd: (-1) PeakSegPDPA.Rd:21: Lost braces; missing escapes or markup?
    21 | m_i>=m_{i+1}. Note that when the equality constraints are active
       |        ^