[1] RankRev: a Matlab package for computing the numerical rank and updating/downdating

[2] Solving Three Dimensional Maxwell Eigenvalue Problems with Fourteen Bravais Lattices

[3] On Generalizing Trace Minimization Principles

[4] Minimization Principle for Linear Response Eigenvalue Problem I: Theory

[5] Electromagnetic Field Behavior of 3D Maxwell's Equations for Chiral Media

[6] A Novel Algorithm for Volume-Preserving Parameterizations of 3-Manifolds

[7] Convergence of the block Lanczos method for eigenvalue clusters

[8] Minimization Principle for Linear Response Eigenvalue Problem II: Computation

[9] Perturbation Analysis for Matrix Joint Block Diagonalization

[10] Sharp Estimation Of Convergence Rate For Self-Consistent Field Iteration to Solve Eigenvector-Dependent Nonlinear Eigenvalue Problems

[11] A Riemannian Newton Algorithm for Nonlinear Eigenvalue Problems

[12] Alternating-Directional Doubling Algorithm for M-Matrix Algebraic Riccati Equations

[13] Solving the cubic regularization model by a nested restarting Lanczos method

[14] Kurdyka- Lojasiewicz exponent via inf-projection

[15] FAME: Fast Algorithms for Maxwell’s Equations for Three-Dimensional Photonic Crystals

[16] On Nonlinear Matrix Equations from the First Standard Form

[17] A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test

[18] Highly Accurate Doubling Algorithms for M-matrix Algebraic Riccati Equations

[19] A Krylov subspace method for the large-scale second-order cone complementarity problem

[20] Trace ratio optimization with an application to multi-view learning

[21] M-tensors and some applications

[22] Maximizing Sum of Coupled Traces with Applications

[23] Solving large-scale discrete-time algebraic Riccati equations by doubling

[24] The hyperbolic quadratic eigenvalue problem

[25] A Geometric Nonlinear Conjugate Gradient Method for Stochastic Inverse Eigenvalue Problems

[26] A Finite Element Based Fast Eigensolver for Three Dimensional Anisotropic Photonic Crystals

[27] Highly Accurate Doubling Algorithm for Quadratic Matrix Equation from Quasi-Birth-and-Death Process

[28] Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed Lq Minimization

[29] Note on finding an optimal deflation for quadratic matrix polynomials

[30] A positivity preserving inverse iteration for finding the Perron pair of an irreducible nonnegative third order tensor

[31] An efficient matrix splitting method for the second-order cone complementarity problem

[32] Electromagnetic Field Behavior of 3D Maxwell’s Equations for Chiral Media

[33] Computing the full spectrum of large sparse palindromic quadratic eigenvalue problems arising from surface Green's function calculations

[34] On an Eigenvector-Dependent Nonlinear Eigenvalue Problem

[35] Convergence analysis of vector extended LOBPCG for computing extreme eigenvalues

[36] Maximization of the sum of the trace ratio on the Stiefel manifold, I: Theory

[37] First-order Perturbation Theory for Eigenvalues and Eigenvectors

[38] A nested Lanczos method for the trust-region subproblem

[39] Structure-Preserving Methods for Computing Complex Band Structures of Three Dimensional Photonic Crystals

[40] Multi-view Orthonormalized Partial Least Squares: Regularizations and Deep Extensions

[41] A Scalable Algorithm for Large-scale Unsupervised Multi-view Partial Least Squares

[42] Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets

[43] Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization

[44] Maximization of the sum of the trace ratio on the Stiefel manifold, II: Computation

[45] A symmetric structure-preserving QR algorithm for linear response eigenvalue problems

[46] An efficient algorithm for second-order cone linear complementarity problems

[47] Parallel matrix factorization for low-rank tensor completion

[48] Accurate Numerical Solution for Structured M-Matrix Algebraic Riccati Equations

[49] A note on alternating projections for ill-posed semidefinite feasibility problems

[50] Accelerated Primal-Dual Proximal Block Coordinate Updating Methods for Constrained Convex Optimization

[51] Relative perturbation theory for quadratic Hermitian eigenvalue problems

[52] Randomized Primal-Dual Proximal Block Coordinate Updates

[53] A Self-Consistent-Field Iteration for Orthogonal Canonical Correlation Analysis

[54] Primal-dual stochastic gradient method for convex programs with many functional constraints

[55] A Lanczos method for large-scale extreme Lorentz eigenvalue problems

[56] Accurate Numerical Solution For Shifted M-Matrix Algebraic Riccati Equations

[57] Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming

[58] Rayleigh-Ritz approximation for the linear response eigenvalue problem

[59] The Bi-Lebedev Scheme for the Maxwell Eigenvalue Problem with 3D Bi-anisotropic Complex Media

[60] Coordinate Friendly Structures, Algorithms and Applications

[61] Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs

[62] Backward perturbation analysis and residual bounds of the linear response eigenvalue problem

[63] Proximal gradient method for huberized support vector machine

[64] A Schur-Newton algorithm for robust pole assignment

[65] A Block Chebyshev-Davidson Method for Linear Response Eigenvalue Problems

[66] The palindromic generalized eigenvalue problem A x= Ax: Numerical solution and applications

[67] Decentralized low-rank matrix completion

[68] A variant of multi-task n-vehicle exploration problem: Maximizing every processors average profit

[69] The RayleighRitz method, refinement and Arnoldi process for periodic matrix pairs

[70] Robust pole assignment for ordinary and descriptor systems via the schur form

[71] An alternating direction algorithm for matrix completion with nonnegative factors

[72] Maximum Correntropy Criterion based Sparse Subspace Learning for Unsupervised Feature Selection

[73] A Riemannian inexact Newton-CG method for constructing a nonnegative matrix with prescribed realizable spectrum