Citation: Ming-Wen Chen, XIn-Feng Wang, Fei Wang, Guo-biao Lin, Zi-Zong Wang. (2013). " The effect of interfacial kinetics on the morphological stability of a spherical particle. " Journal of Crystal Growth. 362(1), Pages 20-23.

A note on geometric involutive bases for positive dimensional polynomial ideals and SDP methods

Citation: Greg Reid, Fei Wang, Wenyuan Wu. (2014). " A note on geometric involutive bases for positive dimensional polynomial ideals and SDP methods. " Proceedings of the 2014 Symposium on Symbolic-Numeric Computation. Pages 41-42.

The asymptotic analysis of some interrpolated nonlinear recurrence relations

Citation: Robert Corless, David Jeffrey, Fei Wang. (2014). " The asymptotic analysis of some interrpolated nonlinear recurrence relations. " Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation. Pages 115-121.

Proof of a series solution for Euler’s trinomial equation

Citation: Fei Wang. (2016). " Proof of a serie's solution for Eulers trinomial equation. " ACM Communications in Computer Algebra. 50(4), Pages 136-144.

An SDP-based method for real radical ideal membership test

Citation: Fei Wang, Greg Reid, Henry Wolkowicz. (2017). " An SDP-based method for the real radical ideal membership test. " 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing. Pages 86-93.

Noisy Euclidean Distance Matrix Completion with a Single Missing Node

Citation: Stefan Sremac, Fei Wang, Henry Wolkowicz, Lucas Petterson. (2019). " Noisy Euclidean Distance Matrix Completion with a Single Missing Node." Journal of Global Optimization. 75(4), Pages 973-1002

Parametric Convex Quadratic Relaxational of the Quadratic Knapsack Problem

Citation: Marcia Fampa, Daniela Luke, Fei Wang, Henry Wolkowicz. (2020). " Parametric Convex Quadratic Relaxational of the Quadratic Knapsack Problem. " European Journal of Operational Research. 281(1), Pages 36-49.

Robust Principap Component Analysis using Facial Reduction

Citation: Shiqian Ma, Fei Wang, Linchuan Wei, Henry Wolkowicz. (2020). " Robust Principal Component Analysis using Facial Reduction. " Optimization and Engineering. 21(3), Pages 1195-1219.

On the existence of a short pivoting sequence for a linear program

Citation: Anders Forsgren, Fei Wang. (2020). " On the existence of a short pivoting sequence for a linear program." Operational Research Letters. 48(6), Pages 697-702.

Singularity Degree of Non-Facially Exposed Faces

Citation: Fei Wang, Henry Wolkowicz. (2022). " Singularite degree of non-facially exposed faces." 10.48550/ARXIV.2211.00834v2.

Uniqueness of Low Rank Matrix Completion and Schur Complement

Citation: Fei Wang. (2022). " Uniqueness of Low Rank Matrix Completion and Schur Complement." 10.48550/ARXIV.2206.15018.

talks

Proof of a series solution for Euler’s trinomial equation

Published: July 25, 2016

In 1779, Leonhard Euler published a paper about Lambert’s transcendental equation in the symmetric form. In the paper, he studied the series solution of this equation and other results based on an assumption which was not proved in the paper. Euler’s paper gave the first series expanion for the so-called Lambert W function. In this work, we briefly review Euler’s results and give a proof to modern standards of rigor of the series solution of Lambert’s transcendental equation.

Polynomial optimization by SDP and facial reduction

Published: December 02, 2016

2016 CMS Winter Meeting Large Scale Optimization: Theory, Algorithms and Applications in memoriam Jonathan Borwein

An SDP-based method for the real radical ideal membership test

Published: September 22, 2017

SYNASC 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

Low matrix completion by a majorized penalty approach

Published: July 03, 2018

ISMP 2018 the 23rd International Symposium on Mathematical Programming.

Noisy Euclidean Distance Matrix completion with 1 missing node

Published: August 03, 2019

ICCOPT 2019 the 6th International Coneference on Continuous Optimization.

Guest lectures: Graduate Course on Real algebraic & Distance geometry in Discrete Structures and Kinematics

Published: May 18, 2021

Graduate Course on Real algebraic & Distance geometry in Discrete Structures and Kinematics

On the Singularity degree of non-facially exposed faces

Published: December 07, 2022

Abstract: We define the singularity degree of a face which is not necessarily facially exposed. We show that the singularity degree of a linear conic optimization problem is equal to the singularity degree of the minimal face on the linear image of the convex cone, which generalises the result by Drusvyatskiy, Pataki and Wolkowicz in 2015. Given pairwise distances of a framework (G, p), the singularity degree of the corresponding EDM completion problem is related to the stability of the framework (high singularity means the framework is less stable). As an application, we give an upper bound of the singularity degree for generic frameworks and tensegrities underlying a Laman plus d graph ( Laman graph plus d edges).

teaching

Math 115 Linear Algebra for Engineering, Fall 2020

Undergraduate course, University of Waterloo, 2020

Course Description: This is a course on linear algebra and its applications to engineering. Topics to be covered include complex numbers; vectors, lines and planes; systems of linear equations; matrices, linear transformations and determinants; introduction to vector spaces; eigenvalues, eigenvectors and diagonaliza- tion; and additional topics as time permits. We approach the material through a blend of theoretical ideas, computational methods and some applications.

CO 367 Nonlinear Optimization, Fall 2021

Undergraduate course, Department of Combinatorics and Optimization, University of Waterloo, 2021

An introductory course to the mathematics of nonlinear optimization. Necessary and sufficient optimality conditions for unconstrained and constrained problems. Convexity and its applications. Computational algorithms and their analysis. Application to machine learning.

CO250 Introduction to optimization, Spring 2022

Undergraduate course, University of Waterloo, Department of Combinatorics and Optimization, 2022

This is an introductory course to linear programming, integer programming, and a very basic introduction to nonlinear optimization