Liqun Qi

According to our database1, Liqun Qi authored at least 207 papers between 1981 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Hypergraph Clustering Using a New Laplacian Tensor with Applications in Image Processing.
SIAM J. Imaging Sci., 2020

Modified gradient dynamic approach to the tensor complementarity problem.
Optim. Methods Softw., 2020

Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion.
CoRR, 2020

A Parallelizable Method for Missing Internet Traffic Tensor Data.
CoRR, 2020

A Tensor Rank Theory, Full Rank Tensors and The Sub-Full-Rank Property.
CoRR, 2020

Triple Decomposition and Tensor Recovery of Third Order Tensors.
CoRR, 2020

Expected residual minimization method for monotone stochastic tensor complementarity problem.
Comput. Optim. Appl., 2020

Elasticity M-tensors and the strong ellipticity condition.
Appl. Math. Comput., 2020

2019
DrPOCS: Drug Repositioning Based on Projection Onto Convex Sets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019

On semi-definiteness and minimal H-eigenvalue of a symmetric space tensor using nonnegative polynomial optimization techniques.
Signal Process. Image Commun., 2019

Stochastic $$R_0$$ R 0 tensors to stochastic tensor complementarity problems.
Optim. Lett., 2019

High performance hardware architecture for singular spectrum analysis of Hankel tensors.
Microprocess. Microsystems, 2019

Tensor Complementarity Problems - Part II: Solution Methods.
J. Optim. Theory Appl., 2019

Tensor Complementarity Problems - Part III: Applications.
J. Optim. Theory Appl., 2019

Tensor Complementarity Problems - Part I: Basic Theory.
J. Optim. Theory Appl., 2019

Biquadratic Tensors, Biquadratic Decomposition and Norms of Biquadratic Tensors.
CoRR, 2019

Nuclear Norm and Spectral Norm of Tensor Product.
CoRR, 2019

Spectral Norm and Nuclear Norm of a Third Order Tensor.
CoRR, 2019

2018
A fast algorithm for the spectral radii of weakly reducible nonnegative tensors.
Numer. Linear Algebra Appl., 2018

A semidefinite program approach for computing the maximum eigenvalue of a class of structured tensors and its applications in hypergraphs and copositivity test.
Numer. Linear Algebra Appl., 2018

A Globally and Quadratically Convergent Algorithm for Solving Multilinear Systems with ℳ-tensors.
J. Sci. Comput., 2018

Computing the p-Spectral Radii of Uniform Hypergraphs with Applications.
J. Sci. Comput., 2018

Global Uniqueness and Solvability of Tensor Variational Inequalities.
J. Optim. Theory Appl., 2018

A quadratic penalty method for hypergraph matching.
J. Glob. Optim., 2018

Positive definiteness of paired symmetric tensors and elasticity tensors.
J. Comput. Appl. Math., 2018

Geometric measures of entanglement in multipartite pure states via complex-valued neural networks.
Neurocomputing, 2018

Some properties and applications of odd-colorable -hypergraphs.
Discret. Appl. Math., 2018

Copositive tensor detection and its applications in physics and hypergraphs.
Comput. Optim. Appl., 2018

Spectral radii of two kinds of uniform hypergraphs.
Appl. Math. Comput., 2018

2017
The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning.
SIAM J. Sci. Comput., 2017

Strictly semi-positive tensors and the boundedness of tensor complementarity problems.
Optim. Lett., 2017

The sparsest solutions to Z-tensor complementarity problems.
Optim. Lett., 2017

Improved approximation results on standard quartic polynomial optimization.
Optim. Lett., 2017

Programmable criteria for strong ℋ-tensors.
Numer. Algorithms, 2017

Copositivity Detection of Tensors: Theory and Algorithm.
J. Optim. Theory Appl., 2017

Iterative algorithms for computing US- and U-eigenpairs of complex tensors.
J. Comput. Appl. Math., 2017

Formulating an <i>n</i>-person noncooperative game as a tensor complementarity problem.
Comput. Optim. Appl., 2017

2016
Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph.
SIAM J. Sci. Comput., 2016

Comon's Conjecture, Rank Decomposition, and Symmetric Rank Decomposition of Symmetric Tensors.
SIAM J. Matrix Anal. Appl., 2016

Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations.
SIAM J. Matrix Anal. Appl., 2016

A Necessary and Sufficient Condition for Existence of a Positive Perron Vector.
SIAM J. Matrix Anal. Appl., 2016

Computing Extreme Eigenvalues of Large Scale Hankel Tensors.
J. Sci. Comput., 2016

Tensor Complementarity Problem and Semi-positive Tensors.
J. Optim. Theory Appl., 2016

A Tensor Analogy of Yuan's Theorem of the Alternative and Polynomial Optimization with Sign structure.
J. Optim. Theory Appl., 2016

Positive-Definite Tensors to Nonlinear Complementarity Problems.
J. Optim. Theory Appl., 2016

Eigenvalue analysis of constrained minimization problem for homogeneous polynomial.
J. Glob. Optim., 2016

The extremal spectral radii of k -uniform supertrees.
J. Comb. Optim., 2016

Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors.
J. Comput. Appl. Math., 2016

Higher-degree eigenvalue complementarity problems for tensors.
Comput. Optim. Appl., 2016

On the cone eigenvalue complementarity problem for higher-order tensors.
Comput. Optim. Appl., 2016

A semismooth Newton method for tensor eigenvalue complementarity problem.
Comput. Optim. Appl., 2016

Further results on Cauchy tensors and Hankel tensors.
Appl. Math. Comput., 2016

2015
Fast Hankel tensor-vector product and its application to exponential data fitting.
Numer. Linear Algebra Appl., 2015

Properties of Some Classes of Structured Tensors.
J. Optim. Theory Appl., 2015

A quadratically convergent algorithm for finding the largest eigenvalue of a nonnegative homogeneous polynomial map.
J. Glob. Optim., 2015

The Laplacian of a uniform hypergraph.
J. Comb. Optim., 2015

An Explicit SOS Decomposition of A Fourth Order Four Dimensional Hankel Tensor with A Symmetric Generating Vector.
CoRR, 2015

2014
M-Tensors and Some Applications.
SIAM J. Matrix Anal. Appl., 2014

Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm.
SIAM J. Matrix Anal. Appl., 2014

Geometric Measure of Entanglement and U-Eigenvalues of Tensors.
SIAM J. Matrix Anal. Appl., 2014

Nonmonotone Barzilai-Borwein Gradient Algorithm for ℓ<sub>1</sub>-Regularized Nonsmooth Minimization in Compressive Sensing.
J. Sci. Comput., 2014

Approximation Bounds for Trilinear and Biquadratic Optimization Problems Over Nonconvex Constraints.
J. Optim. Theory Appl., 2014

Geometric Measure of Quantum Entanglement for Multipartite Mixed States.
Int. J. Softw. Informatics, 2014

The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph.
Discret. Appl. Math., 2014

Properties and methods for finding the best rank-one approximation to higher-order tensors.
Comput. Optim. Appl., 2014

An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints.
Comput. Optim. Appl., 2014

Space tensor conic programming.
Comput. Optim. Appl., 2014

Convergence of a second order Markov chain.
Appl. Math. Comput., 2014

2013
Spectral Properties of Positively Homogeneous Operators Induced by Higher Order Tensors.
SIAM J. Matrix Anal. Appl., 2013

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

The dominant eigenvalue of an essentially nonnegative tensor.
Numer. Linear Algebra Appl., 2013

The spectral theory of tensors and its applications.
Numer. Linear Algebra Appl., 2013

The <i>Z</i>-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
Numer. Linear Algebra Appl., 2013

Finding the extreme Z-eigenvalues of tensors via a sequential semidefinite programming method.
Numer. Linear Algebra Appl., 2013

A survey on the spectral theory of nonnegative tensors.
Numer. Linear Algebra Appl., 2013

On determinants and eigenvalue theory of tensors.
J. Symb. Comput., 2013

Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming.
J. Optim. Theory Appl., 2013

Nonnegative Diffusion Orientation Distribution Function.
J. Math. Imaging Vis., 2013

Semi-infinite programming method for optimal power flow with transient stability and variable clearing time of faults.
J. Glob. Optim., 2013

The E-characteristic polynomial of a tensor of dimension 2.
Appl. Math. Lett., 2013

2012
The Best Rank-1 Approximation of a Symmetric Tensor and Related Spherical Optimization Problems.
SIAM J. Matrix Anal. Appl., 2012

Linear convergence of an algorithm for computing the largest eigenvalue of a nonnegative tensor.
Numer. Linear Algebra Appl., 2012

Structured matrices and tensors.
Numer. Linear Algebra Appl., 2012

Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
Numer. Linear Algebra Appl., 2012

The cubic spherical optimization problems.
Math. Comput., 2012

Standard bi-quadratic optimization problems and unconstrained polynomial reformulations.
J. Glob. Optim., 2012

Algebraic connectivity of an even uniform hypergraph.
J. Comb. Optim., 2012

A smoothing SQP method for nonlinear programs with stability constraints arising from power systems.
Comput. Optim. Appl., 2012

2011
New ALS Methods With Extrapolating Search Directions and Optimal Step Size for Complex-Valued Tensor Decompositions.
IEEE Trans. Signal Process., 2011

The Best Rank-One Approximation Ratio of a Tensor Space.
SIAM J. Matrix Anal. Appl., 2011

Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints.
J. Glob. Optim., 2011

Preface.
J. Comput. Appl. Math., 2011

A feasible direction method for the semidefinite program with box constraints.
Appl. Math. Lett., 2011

2010
Impulse noise removal by a nonmonotone adaptive gradient method.
Signal Process., 2010

Higher Order Positive Semidefinite Diffusion Tensor Imaging.
SIAM J. Imaging Sci., 2010

Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations.
Numer. Linear Algebra Appl., 2010

Pseudotransient Continuation for Solving Systems of Nonsmooth Equations with Inequality Constraints.
J. Optim. Theory Appl., 2010

A new smoothing Newton-type algorithm for semi-infinite programming.
J. Glob. Optim., 2010

Global convergence of a filter-trust-region algorithm for solving nonsmooth equations.
Int. J. Comput. Math., 2010

A Nonmonotone Filter Barzilai-Borwein Method for Optimization.
Asia Pac. J. Oper. Res., 2010

A nonmonotone globalization algorithm with preconditioned gradient path for unconstrained optimization.
Appl. Math. Comput., 2010

A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset.
Appl. Math. Comput., 2010

2009
Nonsmooth and Smoothing Methods for Nonlinear Complementarity Problems and Variational Inequalities.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Finding the Largest Eigenvalue of a Nonnegative Tensor.
SIAM J. Matrix Anal. Appl., 2009

Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations.
SIAM J. Optim., 2009

Worst-case CVaR based portfolio optimization models with applications to scenario planning.
Optim. Methods Softw., 2009

A practical method for computing the largest <i>M</i>-eigenvalue of a fourth-order partially symmetric tensor.
Numer. Linear Algebra Appl., 2009

Does diffusion kurtosis imaging lead to better neural tissue characterization? A rodent brain maturation study.
NeuroImage, 2009

Z-eigenvalue methods for a global polynomial optimization problem.
Math. Program., 2009

Shape-Preserving Interpolation and Smoothing for Options Market Implied Volatility.
J. Optimization Theory and Applications, 2009

On Nonmonotone Chambolle Gradient Projection Algorithms for Total Variation Image Restoration.
J. Math. Imaging Vis., 2009

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

2008
Available Transfer Capability Calculation Using a Smoothing Pointwise Maximum Function.
IEEE Trans. Circuits Syst. I Regul. Pap., 2008

An Eigenvalue Method for Testing Positive Definiteness of a Multivariate Form.
IEEE Trans. Autom. Control., 2008

Projected Pseudotransient Continuation.
SIAM J. Numer. Anal., 2008

The SC.
Oper. Res. Lett., 2008

A new class of quasi-Newton updating formulas.
Optim. Methods Softw., 2008

Extreme diffusion values for non-Gaussian diffusions.
Optim. Methods Softw., 2008

Towards better MR characterization of neural tissues using directional diffusion kurtosis analysis.
NeuroImage, 2008

Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems.
Math. Comput., 2008

2007
On the successive supersymmetric rank-1 decomposition of higher-order supersymmetric tensors.
Numer. Linear Algebra Appl., 2007

On Semismooth Newton's Methods for Total Variation Minimization.
J. Math. Imaging Vis., 2007

2006
A Truncated Projected Newton-Type Algorithm for Large-Scale Semi-infinite Programming.
SIAM J. Optim., 2006

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

Convergence rate of Newton's method for <i>L</i><sub>2</sub> spectral estimation.
Math. Program., 2006

Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines.
J. Symb. Comput., 2006

Boundedness and Regularity Properties of Semismooth Reformulations of Variational Inequalities.
J. Glob. Optim., 2006

The shortest path improvement problems under Hamming distance.
J. Comb. Optim., 2006

Some further results on minimum distribution cost flow problems.
J. Comb. Optim., 2006

The Lagrangian Globalization Method for Nonsmooth Constrained Equations.
Comput. Optim. Appl., 2006

New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems.
Appl. Math. Comput., 2006

New quasi-Newton methods for unconstrained optimization problems.
Appl. Math. Comput., 2006

2005
Deriving sufficient conditions for global asymptotic stability of delayed neural networks via nonsmooth analysis-II.
IEEE Trans. Neural Networks, 2005

A novel neural network for variational inequalities with linear and nonlinear constraints.
IEEE Trans. Neural Networks, 2005

Comments on "Explicit criterion for the positive definiteness of a general quartic form".
IEEE Trans. Autom. Control., 2005

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

Differentiability and semismoothness properties of integral functions and their applications.
Math. Program., 2005

Eigenvalues of a real supersymmetric tensor.
J. Symb. Comput., 2005

A Gradient-based Continuous Method for Large-scale Optimization Problems.
J. Glob. Optim., 2005

Special Issue of <i>Journal of Global Optimization</i> on Optimization Techniques and Applications.
J. Glob. Optim., 2005

Smoothing Trust Region Methods for Nonlinear Complementarity Problems with <i>P</i> <sub>0</sub>-Functions.
Ann. Oper. Res., 2005

A manufacturing supply chain optimization model for distilling process.
Appl. Math. Comput., 2005

2004
Deriving sufficient conditions for global asymptotic stability of delayed neural networks via nonsmooth analysis.
IEEE Trans. Neural Networks, 2004

A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems.
SIAM J. Optim., 2004

Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions.
SIAM J. Optim., 2004

Sub-quadratic convergence of a smoothing Newton algorithm for the <i>P</i> <sub><i>0</i></sub>- and monotone LCP.
Math. Program., 2004

Extrema of a Real Polynomial.
J. Glob. Optim., 2004

Neurodynamical Optimization.
J. Glob. Optim., 2004

A Smoothing Newton Method for Semi-Infinite Programming.
J. Glob. Optim., 2004

Smooth Convex Approximation to the Maximum Eigenvalue Function.
J. Glob. Optim., 2004

Regularized Newton Methods for Convex Minimization Problems with Singular Solutions.
Comput. Optim. Appl., 2004

2003
A Feasible Sequential Linear Equation Method for Inequality Constrained Optimization.
SIAM J. Optim., 2003

Solving Karush--Kuhn--Tucker Systems via the Trust Region and the Conjugate Gradient Methods.
SIAM J. Optim., 2003

Finite termination of a dual Newton method for convex best <i>C</i> <sup> <i>1</i> </sup> interpolation and smoothing.
Numerische Mathematik, 2003

Semismooth Newton Methods for Solving Semi-Infinite Programming Problems.
J. Glob. Optim., 2003

Multivariate Polynomial Minimization and Its Application in Signal Processing.
J. Glob. Optim., 2003

A Strongly Semismooth Integral Function and Its Application.
Comput. Optim. Appl., 2003

Guest Editorial.
Comput. Optim. Appl., 2003

2002
Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations.
SIAM J. Numer. Anal., 2002

A Newton Method for Shape-Preserving Spline Interpolation.
SIAM J. Optim., 2002

2001
Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods.
SIAM J. Optim., 2001

Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems.
SIAM J. Optim., 2001

Convergence of Newton's method for convex best interpolation.
Numerische Mathematik, 2001

A Globally and Superlinearly Convergent SQP Algorithm for Nonlinear Constrained Optimization.
J. Glob. Optim., 2001

Stability Analysis of Gradient-Based Neural Networks for Optimization Problems.
J. Glob. Optim., 2001

2000
Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations.
SIAM J. Numer. Anal., 2000

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

On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods.
SIAM J. Optim., 2000

A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization.
SIAM J. Optim., 2000

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

Improving the convergence of non-interior point algorithms for nonlinear complementarity problems.
Math. Comput., 2000

Introduction.
Comput. Optim. Appl., 2000

1999
Properties of the Moreau-Yosida regularization of a piecewise C<sup>2</sup> convex function.
Math. Program., 1999

A smoothing method for mathematical programs with equilibrium constraints.
Math. Program., 1999

On NCP-Functions.
Comput. Optim. Appl., 1999

First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems.
Comput. Optim. Appl., 1999

1998
Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization.
SIAM J. Optim., 1998

A Trust Region Method for Solving Generalized Complementarity Problems.
SIAM J. Optim., 1998

Secant methods for semismooth equations.
Numerische Mathematik, 1998

Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities.
Math. Comput., 1998

1997
Convergence of Newton's Method for Singular Smooth and Nonsmooth Equations Using Adaptive Outer Inverses.
SIAM J. Optim., 1997

On superlinear convergence of quasi-Newton methods for nonsmooth equations.
Oper. Res. Lett., 1997

Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations.
Math. Oper. Res., 1997

1996
A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization.
SIAM J. Optim., 1996

Globalization of Newton's Method for Solving Non-linear Equations.
Numer. Linear Algebra Appl., 1996

A preconditioning proximal Newton method for nondifferentiable convex optimization.
Math. Program., 1996

1995
Trust Region Algorithms for Solving Nonsmooth Equations.
SIAM J. Optim., 1995

Subdifferential Convergence in Stochastic Programs.
SIAM J. Optim., 1995

Iteration Functions in Some Nonsmooth Optimization Algorithms.
Math. Oper. Res., 1995

An SQP algorithm for extended linear-quadratic problems in stochastic programming.
Ann. Oper. Res., 1995

Continuous approximation schemes for stochastic programs.
Ann. Oper. Res., 1995

1994
A trust region algorithm for minimization of locally Lipschitzian functions.
Math. Program., 1994

Superlinearly convergent approximate Newton methods for LC optimization problems.
Math. Program., 1994

A parameterized Newton method and a quasi-Newton method for nonsmooth equations.
Comput. Optim. Appl., 1994

1993
Nonsmooth Equations: Motivation and Algorithms.
SIAM J. Optim., 1993

A nonsmooth version of Newton's method.
Math. Program., 1993

Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations.
Math. Oper. Res., 1993

Semiregularity and Generalized Subdifferentials with Applications to Optimization.
Math. Oper. Res., 1993

Linear-Time Separation Algorithms for the Three-Index Assignment Polytope.
Discret. Appl. Math., 1993

1992
An interior point algorithm of O(Quadrat Root(m) absolute (ln epsilon)) iterations for C-convex programming.
Math. Program., 1992

On facets of the three-index assignment polytope.
Australas. J Comb., 1992

1991
Quasidifferentials and maximal normal operators.
Math. Program., 1991

1988
Directed submodularity, ditroids and directed submodular flows.
Math. Program., 1988

Odd Submodular Functions, Dilworth Functions and Discrete Convex Functions.
Math. Oper. Res., 1988

1987
The <i>A</i>-Forest Iteration Method for the Stochastic Generalized Transportation Problem.
Math. Oper. Res., 1987

1983
Complete Closedness of Maximal Monotone Operators.
Math. Oper. Res., 1983

1981
Interval boxes of solutions of nonlinear systems.
Computing, 1981


  Loading...