POLYNOMIAL ALGORITHMS FOR PROJECTING A POINT ONTO A REGION DEFINED BY A LINEAR CONSTRAINT AND BOX CONSTRAINTS IN R^n

Guimarães, O., Piqueira, J. R. C., & Netto, M. L. (2011). Combining Legendre’s Polynomials and Genetic Algorithm in the Solution of Nonlinear Initial-Value Problems. Mathematical Problems in Engineering, 2011(), 644-663-140. https://doi.org/10.1155/2011/521342
Tian, M., & Gong, J. Y. (2014). Strong Convergence of Modified Algorithms Based on the Regularization for the Constrained Convex Minimization Problem. Abstract and Applied Analysis, 2014(), 928-936-1489. https://doi.org/10.1155/2014/870102
Chen, Y. C. (2015). Infinitely Many Eigenfunctions for Polynomial Problems: Exact Results. Journal of Applied Mathematics, 2015(), 627-632-063. https://doi.org/10.1155/2015/516159
Tahmasebzadeh, S., Navidi, H., & Malek, A. (2015). Novel Interior Point Algorithms for Solving Nonlinear Convex Optimization Problems. Advances in Operations Research, 2015(), 59-65. https://doi.org/10.1155/2015/487271
Su, W. S. (2008). Structured Algorithms For Palindromic Polynomial Eigenvalue Problems with Even degrees [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-2002201314382709