Guanglu Zhou

Orcid: 0000-0002-8811-885X

According to our database1, Guanglu Zhou authored at least 41 papers between 1997 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

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
Further results on sum-of-squares tensors.
Optim. Methods Softw., 2022

Using the Split Bregman Algorithm to Solve the Self-repelling Snakes Model.
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
On copositiveness identification of partially symmetric rectangular tensors.
J. Comput. Appl. Math., 2020

Using the Split Bregman Algorithm to Solve the Self-Repelling Snake Model.
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
A fast algorithm for the spectral radii of weakly reducible nonnegative tensors.
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

Convolutional Neural Network for Freight Train Information Recognition.
Proceedings of the 9th International Conference on Machine Learning and Computing, 2017

2016
The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction.
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
M-Tensors and Some Applications.
SIAM J. Matrix Anal. Appl., 2014

On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory.
CoRR, 2014

2013
On the largest eigenvalue of a symmetric nonnegative tensor.
Numer. Linear Algebra Appl., 2013

Cube Theory and Stable k -Error Linear Complexity for Periodic Sequences.
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
An Alternative Lagrange-Dual Based Algorithm for Sparse Signal Reconstruction.
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

A globally and quadratically convergent method for absolute value equations.
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
Finding the Largest Eigenvalue of a Nonnegative Tensor.
SIAM J. Matrix Anal. Appl., 2009

A smoothing projected Newton-type algorithm for semi-infinite programming.
Comput. Optim. Appl., 2009

2008
The SC.
Oper. Res. Lett., 2008

2006
On the convergence of an inexact Newton-type method.
Oper. Res. Lett., 2006

2005
An iterative method for solving KKT system of the semi-infinite programming.
Optim. Methods Softw., 2005

Efficient Algorithms for the Smallest Enclosing Ball Problem.
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
Semismooth Newton Methods for Solving Semi-Infinite Programming Problems.
J. Glob. Optim., 2003

2000
A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms.
SIAM J. Optim., 2000

A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities.
Math. Program., 2000

1997
A Modified SQP Method and Its Global Convergence.
J. Glob. Optim., 1997


  Loading...