Liping Zhang

Orcid: 0000-0002-3839-9470

Affiliations:
  • Tsinghua University, Department of Mathematical Sciences, Beijing, China


According to our database1, Liping Zhang authored at least 49 papers between 2003 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Augmented Lagrangian Multiplier Network for State-wise Safety in Reinforcement Learning.
CoRR, May, 2026

Improved power methods for computing eigenvalues of dual quaternion Hermitian matrices.
Comput. Appl. Math., May, 2026

On the Optimization Landscape of Observer-based Dynamic Linear Quadratic Control.
CoRR, April, 2026

New restricted isometry properties of constrained and unconstrained L<sub>*-F</sub> minimization for low-rank approximation.
Comput. Optim. Appl., April, 2026

KGS-GCN: Enhancing Sparse Skeleton Sensing via Kinematics-Driven Gaussian Splatting and Probabilistic Topology for Action Recognition.
CoRR, March, 2026

Characterizations of the Aubin property of the solution mapping for nonlinear semidefinite programming.
Math. Program., January, 2026

High-dimensional low-rank three-way tensor autoregressive time series predictor.
Expert Syst. Appl., 2026

2025
Exchange Policy Optimization Algorithm for Semi-Infinite Safe Reinforcement Learning.
CoRR, November, 2025

Dual Complex Adjoint Matrix and Applications to Hand-Eye Calibration and Multi-Agent Formation Control.
J. Sci. Comput., July, 2025

Three-step Jacobi method for computing eigenvalues of dual quaternion Hermitian matrices.
Comput. Appl. Math., February, 2025

Efficient Online Prediction for High-Dimensional Time Series via Joint Tensor Tucker Decomposition.
J. Mach. Learn. Res., 2025

Predictive Lagrangian Optimization for Constrained Reinforcement Learning.
Proceedings of the 64th IEEE Conference on Decision and Control, 2025

2024
A Novel Nonconvex Relaxation Approach to Low-Rank Matrix Completion of Inexact Observed Data.
SIAM J. Optim., 2024

A Localized Progressive Hedging Algorithm for Solving Nonmonotone Stochastic Variational Inequalities.
Math. Oper. Res., 2024

Low-rank quaternion tensor completion for color video inpainting via a novel factorization strategy.
Math. Comput., 2024

Network traffic recovery from link-load measurements using tensor triple decomposition strategy for third-order traffic tensors.
J. Comput. Appl. Math., 2024

2023
A parallel low rank matrix optimization method for recovering internet traffic network data via link flow measurement.
J. Comput. Appl. Math., December, 2023

On Multistage Pseudomonotone Stochastic Variational Inequalities.
J. Optim. Theory Appl., October, 2023

Hankel tensor-based model and $$L_1$$-Tucker decomposition-based frequency recovery method for harmonic retrieval problem.
Comput. Appl. Math., February, 2023

LBFF: Load-Balancing First Fit Algorithm for Tenant Placement Problem.
Proceedings of the IEEE International Conference on Communications, 2023

2022
An accurate and practical algorithm for internet traffic recovery problem.
Neurocomputing, 2022

Estimating Clock Skew With One-Way Timestamps.
IEEE Commun. Lett., 2022

Singular value decomposition of third order quaternion tensors.
Appl. Math. Lett., 2022

On Exchange Methods for Nonlinear Semi-Infinite Programs.
Asia Pac. J. Oper. Res., 2022

Modulation for Massive Unsourced Random Access Based on Tensor Block Term Decomposition.
Proceedings of the IEEE Globecom 2022 Workshops, 2022

2021
A Newton-type algorithm for the tensor eigenvalue complementarity problem and some applications.
Math. Comput., 2021

An alternating direction method of multipliers for tensor complementarity problems.
Comput. Appl. Math., 2021

Stochastic $$R_0$$ matrix linear complementarity problems: the Fischer-Burmeister function-based expected residual minimization.
Comput. Appl. Math., 2021

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

Computing all Laplacian H-eigenvalues for a uniform loose path of length three.
Comput. Appl. Math., 2020

Finding all H-Eigenvalues of Signless Laplacian Tensor for a Uniform Loose Path of Length Three.
Asia Pac. J. Oper. Res., 2020

2019
A mixed integer programming approach to the tensor complementarity problem.
J. Glob. Optim., 2019

A new programmable iterative algorithm for identifying strong H-tensors.
Comput. Appl. Math., 2019

2016
Computation Algorithm for Convex Semi-infinite Program with Second-Order Cones: Special Analyses for Affine and Quadratic Case.
J. Sci. Comput., 2016

2015
Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint.
Asia Pac. J. Oper. Res., 2015

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

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

A Newton-Type Algorithm for Solving Problems of Search Theory.
Adv. Oper. Res., 2013

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

A new approach to supply chain network equilibrium models.
Comput. Ind. Eng., 2012

2011
A new approach to the weighted peak-constrained least-square error FIR digital filter optimal design problem.
Comput. Optim. Appl., 2011

2010
A New Exchange Method for Convex Semi-Infinite Programming.
SIAM J. Optim., 2010

2009
An algorithm based on the generalized D-gap function for equilibrium problems.
J. Comput. Appl. Math., 2009

Improved smoothing Newton methods for P<sub>0</sub> nonlinear complementarity problems.
Appl. Math. Comput., 2009

2008
Solvability of semidefinite complementarity problems.
Appl. Math. Comput., 2008

2007
A new trust region algorithm for nonsmooth convex minimization.
Appl. Math. Comput., 2007

2005
Outlier probability of generalized chirpogram-based estimators for multicomponent polynomial-phase signals.
IEEE Trans. Signal Process., 2005

2004
Novel parametric optimum processing method for airborne radar.
Sci. China Ser. F Inf. Sci., 2004

2003
Improved Approximation Algorithms for MAX \frac<i>n</i>\text2-DIRECTED-BISECTION and MAX \frac<i>n</i>\text2-DENSE-SUBGRAPH.
J. Glob. Optim., 2003


  Loading...