https://orcid.org/0000-0002-9993-3681
References
- Niu YS. On difference-of-sos and difference-of-convex-sos decompositions for polynomials; 2018. arXiv preprint arXiv:180309900.
- Heubach S, Mansour T. Compositions of n with parts in a set. Congressus Numerantium. 2004;168:127.
- Hartman P. On functions representable as a difference of convex functions. Pac J Math. 1959;9(3):707–713.
- Pham DT, Le Thi HA. Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math Vietnam. 1997;22(1):289–355.
- Le Thi HA, Pham DT. DC programming and DCA: thirty years of developments. Math Program. 2018;169(1):5–68.
- Ahmadi AA, Hall G. DC decomposition of nonconvex polynomials with algebraic techniques. Math Program. 2018;169(1):69–94.
- Niu YS, Judice J, Le Thi HA, et al. Improved DC programming approaches for solving the quadratic eigenvalue complementarity problem. Appl Math Comput. 2019;353:95–113.
- Niu YS, Wang YJ. High-order moment portfolio optimization via an accelerated difference-of-convex programming approach and sums-of-squares; 2019. arXiv preprint arXiv:190601509.
- Reznick B. Sums of even powers of real linear forms. Mem Am Math Soc. 1992;96(463):viii+155.
- Fischer I. Sums of like powers of multivariate linear forms. Math Mag. 1994;67(1):59–61.
- Comon P, Mourrain B. Decomposition of quantics in sums of powers of linear forms. Signal Process. 1996;53(2–3):93–107.
- D'Andrea C, Tabera L. Tropicalization and irreducibility of generalized vandermonde determinants. Proc Am Math Soc. 2009;137(11):3647–3656.
- Stanley RP. Enumerative combinatorics. Vol. 1, 2nd ed., Cambridge University Press; 2011. (Cambridge studies in advanced mathematics).
- Loehr N. Bijective combinatorics. Boca Raton (FL): CRC Press; 2011.