Guanglu Zhou
Orcid: 0000-0002-8811-885X
According to our database1,
Guanglu Zhou
authored at least 41 papers
between 1997 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors.
J. Glob. Optim., November, 2023
2022
J. Math. Imaging Vis., 2022
An efficient alternating minimization method for fourth degree polynomial optimization.
J. Glob. Optim., 2022
Further results on eigenvalues of symmetric decomposable tensors from multilinear dynamical systems.
Appl. Math. Lett., 2022
2021
A nonnegativity preserving algorithm for multilinear systems with nonsingular M-tensors.
Numer. Algorithms, 2021
An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP(F) involving an M-matrix.
J. Comput. Appl. Math., 2021
An index detecting algorithm for a class of TCP(A, q) equipped with nonsingular M-tensors.
J. Comput. Appl. Math., 2021
2020
J. Comput. Appl. Math., 2020
CoRR, 2020
2019
On the k-error linear complexity for p<sup>n</sup>-periodic binary sequences via hypercube theory.
Math. Found. Comput., 2019
2018
Numer. Linear Algebra Appl., 2018
A Globally and Quadratically Convergent Algorithm for Solving Multilinear Systems with ℳ-tensors.
J. Sci. Comput., 2018
2017
Positive influence maximization in signed social networks based on simulated annealing.
Neurocomputing, 2017
Proceedings of the 9th International Conference on Machine Learning and Computing, 2017
2016
J. Optim. Theory Appl., 2016
Practical exponential set stabilization for switched nonlinear systems with multiple subsystem equilibria.
J. Glob. Optim., 2016
2015
Parameter selection for nonnegative l<sub>1</sub> matrix/tensor sparse decomposition.
Oper. Res. Lett., 2015
Convergence analysis of a block improvement method for polynomial optimization over unit spheres.
Numer. Linear Algebra Appl., 2015
2014
On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory.
CoRR, 2014
2013
Numer. Linear Algebra Appl., 2013
Proceedings of the Information Security and Cryptology - 9th International Conference, 2013
2012
Nonnegative Polynomial Optimization over Unit Spheres and Convex Programming Relaxations.
SIAM J. Optim., 2012
2011
IEEE Trans. Signal Process., 2011
A smoothing Newton-type method for solving the <i>L</i><sub>2</sub> spectral estimation problem with lower and upper bounds.
Comput. Optim. Appl., 2011
Comput. Optim. Appl., 2011
2010
A Superlinearly Convergent Method for a Class of Complementarity Problems with Non-Lipschitzian Functions.
SIAM J. Optim., 2010
An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor.
J. Comput. Appl. Math., 2010
2009
SIAM J. Matrix Anal. Appl., 2009
Comput. Optim. Appl., 2009
2008
2006
2005
Optim. Methods Softw., 2005
Comput. Optim. Appl., 2005
2004
Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming.
Math. Program., 2004
Convergence Analysis of an Infeasible Interior Point Algorithm Based on a Regularized Central Path for Linear Complementarity Problems.
Comput. Optim. Appl., 2004
2003
J. Glob. Optim., 2003
2000
SIAM J. Optim., 2000
A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities.
Math. Program., 2000
1997