Feng Guo, Associate Professor

School of mathematical Sciences

Dalian University of Technology

Education：

• 2007/09 – 2012/01, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Doctor degree 

• 2003/09 – 2007/06, Shandong University, Bachelor degree

Work experiences：

• 2018/01 - now, Dalian University of Technology, Associate Professor

• 2013/09 – 2017/12, Dalian University of Technology, Assistant Professor

• 2012/02 – 2013/07, University of California, San Diego, PostDoc

Research interests:

Polynomial and algebraic optimization

Publications：

[20] Feng Guo; Jie Wang; A moment-SOS hierarchy for robust polynomial matrix inequality optimization with SOS-convexity, Mathematics of Operations Research, 2024, to appear.

[19] Feng Guo; Sizhuo Yan; Lihong Zhi; Extensions of S-lemma for noncommutative polynomials, Journal of Operator Theory, to appear, 2024.

[18] Feng Guo; Meijun Zhang; An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, Optimization Letters, 2024, 18:105-133.

[17] Feng Guo; Liguo Jiao; Do Sang Kim; On continuous selections of polynomial functions. Optimization, 2024, 73(2): 295-328.

[16] Feng Guo; Liguo Jiao; Do Sang Kim; Tien-Son Pham; On types of KKT points in polynomial optimization, Journal of Systems Science & Complexity, 2023,36: 2186-2213.

[15] Feng Guo; Liguo Jiao; A new scheme for approximating the weakly efficient solution set of vector rational optimization problems, Journal of Global Optimization, 2023, 86:905–930.

[14] Feng Guo; Liguo Jiao; On solving a class of fractional semi-infinite polynomial programming problems, Computational Optimization and Applications, 2021, 80: 439-481.

[13] Si-Tiep Dinh; Feng Guo; Tien-Son Pham; Global Łojasiewicz inequalities on comparing the rate of growth of polynomial functions, Journal of Mathematical Analysis and Applications, 2021, 499: 125057.

[12] Feng Guo; Xiaoxia Sun; On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems, Computational Optimization and Applications, 2020, 75:669-699.

[11] Feng Guo; Tien-Son Pham; On types of degenerate critical points of real polynomial functions, Journal of Symbolic Computation, 2020, 99:108-126.

[10] Feng Guo; Xiaoxia Sun; Semidefinite programming relaxations for linear semi-infinite polynomial programming, Pacific Journal of Optimization, 2020, 16(3): 395-418.

[9] Feng Guo; Xiaoxia Sun; LP relaxations for a class of linear semi-infinite programming problems. Optimization, 2017, 66(5): 657-673.

[8] Feng Guo; Chu Wang; Lihong Zhi; Semidefinite representations of noncompact convex sets, SIAM Journal on Optimization，2015, 25(1): 377-395.

[7] Feng Guo; Mohab Safey El Din; Chu Wang; Lihong Zhi; Optimizing a parametric linear function over a noncompact real algebraic variety. In Proceedings of 2015 International Symposium on Symbolic and Algebraic Computation (ISSAC), Bath, UK, 2015, pages 205-212.

[6] Li Wang; Feng Guo; Semidefinite relaxations for semi-infinite polynomial programming,Computational Optimization and Applications, 2014, 58(1): 133-159.

[5] Feng Guo; Li Wang; Guangming Zhou; Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities, Journal of Global Optimization, 2014, 58: 261-284.

[4] Feng Guo，Chu Wang, and Lihong Zhi. Optimizing a linear function over a noncompact real algebraic variety. In Proceedings of the 2014 International Symposium on Symbolic-Numeric Computation, pages 39-40, 2014.

[3] Aurélien Greuet; Feng Guo; Mohab Safey El Din; Lihong Zhi; Global optimization of polynomials restricted to a smooth variety using sums of squares. Journal of Symbolic Computation, 2012, 47:503-518.

[2] Feng Guo; Erich Kaltofen; Lihong Zhi. Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. In Proceedings of 2012 International Symposium on Symbolic and Algebraic Computation (ISSAC), Grenoble, France, 2012, pages 195-202.

[1] Feng Guo; Mohab Safey El Din; Lihong Zhi; Global optimization of polynomials using generalized critical values and sums of squares. In Proceedings of 2010 International Symposium on Symbolic and Algebraic Computation (ISSAC), Munich, Germany, 2010, pages 107-114.