Qi Liqun

Liqun Qi

Information about the author Liqun Qi will soon be added to the site.
Found 29 papers in total
Tensor Complementarity Problem and Semi-positive Tensors
Tensor Complementarity Problem and Semi-positive Tensors
2016
In this paper, we prove that a real tensor is strictly semi‐positive if and...
Algebraic connectivity of an even uniform hypergraph
Algebraic connectivity of an even uniform hypergraph
2012
We generalize Laplacian matrices for graphs to Laplacian tensors for even uniform...
Standard bi‐quadratic optimization problems and unconstrained polynomial reformulations
Standard bi‐quadratic optimization problems and unconstrained polynomial reformulations
2012
A so‐called Standard Bi‐Quadratic Optimization Problem (StBQP) consists...
A smoothing SQP method for nonlinear programs with stability constraints arising from power systems
A smoothing SQP method for nonlinear programs with stability constraints arising from power systems
2012
This paper investigates a new class of optimization problems arising from power...
A Smoothing Newton Method for Semi‐Infinite Programming
A Smoothing Newton Method for Semi‐Infinite Programming
2004
This paper is concerned with numerical methods for solving a semi‐infinite...
Smooth Convex Approximation to the Maximum Eigenvalue Function
Smooth Convex Approximation to the Maximum Eigenvalue Function
2004
In this paper, we consider smooth convex approximations to the maximum eigenvalue...
Semidefinite relaxation bounds for bi‐quadratic optimization problems with quadratic constraints
Semidefinite relaxation bounds for bi‐quadratic optimization problems with quadratic constraints
2011
This paper studies the relationship between the so‐called bi‐quadratic...
The SC 1 property of an expected residual function arising from stochastic complementarity problems
The SC 1 property of an expected residual function arising from stochastic complementarity problems
2008
The stochastic nonlinear complementarity problem has been recently reformulated as an...
On the convergence of an inexact Newton-type method
On the convergence of an inexact Newton-type method
2006
In this paper we give local convergence results of an inexact Newton-type method for...
The shortest path improvement problems under Hamming distance
The shortest path improvement problems under Hamming distance
2006
In this paper, we consider the shortest path improvement problems under Hamming...
A manufacturing supply chain optimization model for distilling process
A manufacturing supply chain optimization model for distilling process
2005
In this paper, the model of an integrated manufacturing supply chain where multiple...
Some further results on minimum distribution cost flow problems
Some further results on minimum distribution cost flow problems
2006
Manufacturing network flow (MNF) is a generalized network model that can model more...
Smoothing trust region methods for nonlinear complementarity problems with P0-functions
Smoothing trust region methods for nonlinear complementarity problems with P0-functions
2005
By using the Fischer–Burmeister function to reformulate the nonlinear...
First-order algorithms for generalized semi-infinite min–max problems
First-order algorithms for generalized semi-infinite min–max problems
1999
We present a first-order algorithm for solving semi-infinite generalized min–max...
On nonlinear complementarity problem functions
On nonlinear complementarity problem functions
1999
In this paper we reformulate several NCP-functions for the nonlinear complementarity...
On superlinear convergence of quasi-Newton methods for nonsmooth equations
On superlinear convergence of quasi-Newton methods for nonsmooth equations
1997
We show that strong differentiability at solutions is not necessary for superlinear...
A preconditioning proximal Newton method for nondifferentiable convex optimization
A preconditioning proximal Newton method for nondifferentiable convex optimization
1997
We propose a proximal Newton method for solving nondifferentiable convex optimization....
Superlinearly convergent approximate Newton methods for LC1 optimization problems
Superlinearly convergent approximate Newton methods for LC1 optimization problems
1994
In the literature, the proof of superlinear convergence of approximate Newton or SQP...
A trust region algorithm for minimization of locally Lipschitzian functions
A trust region algorithm for minimization of locally Lipschitzian functions
1994
The classical trust region algorithm for smooth nonlinear programs is extended to the...
Continuous approximation schemes for stochastic programs
Continuous approximation schemes for stochastic programs
1995
One of the main methods for solving stochastic programs is approximation by...
An SQP algorithm for extended linear-quadratic problems in stochastic programming
An SQP algorithm for extended linear-quadratic problems in stochastic programming
1995
Extended Linear-Quadratic Programming (ELQP) problems were introduced by Rockafellar...
Linear-time separation algorithms for the three-index assignment polytope
Linear-time separation algorithms for the three-index assignment polytope
1993
Balas and Saltzman identified several classes of facet inducing inequalities for the...
A nonsmooth version of Newton’s method
A nonsmooth version of Newton’s method
1993
Newton’s method for solving a nonlinear equation of several variables is...
Semiregularity and generalized subdifferentials with applications to optimization
Semiregularity and generalized subdifferentials with applications to optimization
1993
The Michel-Penot subdifferential of a locally Lipschitzian function is the principal...
Papers per page: