On the Convergence of a New Hybrid Projection Algorithm. - Qian Liu 016; Changyu Wang; Xinmin Yang (J. Syst. Sci. Complex., 2006)

Properties of saddle points for generalized augmented Lagrangian. - Qian Liu 016; Wan Mei Tang; Xinmin Yang (Math. Methods Oper. Res., 2009)

An Augmented Lagrangian Algorithm for Solving Semiinfinite Programming. - Qian Liu 016; Changyu Wang (J. Appl. Math., 2012)

Smoothing SQP algorithm for semismooth equations with box constraints. - Changyu Wang; Qian Liu 016; Cheng Ma (Comput. Optim. Appl., 2013)

On the convergence of a smoothed penalty algorithm for semi-infinite programming. - Qian Liu 016; Changyu Wang; Xinmin Yang (Math. Methods Oper. Res., 2013)

Global saddle points of nonlinear augmented Lagrangian functions. - Changyu Wang; Qian Liu 016; Biao Qu (J. Glob. Optim., 2017)

A Bi-criteria Analysis for Fuzzy C-means Problem. - Yang Zhou 018; Jianxin Liu; Min Li 028; Qian Liu 016 (AAIM, 2020)

Nonsubmodular Maximization with Knapsack Constraint via Multilinear Extension. - Jiachen Ju; Min Li 028; Jianxin Liu; Qian Liu 016; Yang Zhou 018 (PAAP, 2020)

A Novel Initialization Algorithm for Fuzzy C-means Problem. - Qian Liu 016; Jianxin Liu; Min Li 028; Yang Zhou 018 (TAMC, 2020)

A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems. - Qian Liu 016; Yuqing Xu; Yang Zhou 018 (J. Glob. Optim., 2020)

Convergence properties of a class of exact penalty methods for semi-infinite optimization problems. - Jiachen Ju; Qian Liu 016 (Math. Methods Oper. Res., 2020)

Bi-criteria Adaptive Algorithms for Minimizing Supermodular Functions with Cardinality Constraint. - Xiaojuan Zhang; Qian Liu 016; Min Li 028; Yang Zhou 018 (AAIM, 2021)

Two-Stage Stochastic Max-Weight Independent Set Problems. - Min Li 028; Qian Liu 016; Yang Zhou 018 (COCOA, 2021)

An Improved CF Tree Clustering Based on Tissue-Like P System. - Qian Liu 016; Xiyu Liu 001 (ICIC (2), 2021)

Approximation algorithms for fuzzy C-means problem based on seeding method. - Qian Liu 016; Jianxin Liu; Min Li 028; Yang Zhou 018 (Theor. Comput. Sci., 2021)

Guarantees for Maximization of k-Submodular Functions with a Knapsack and a Matroid Constraint. - Kemin Yu; Min Li 028; Yang Zhou 018; Qian Liu 016 (AAIM, 2022)

Non-monotone k-Submodular Function Maximization with Individual Size Constraints. - Hao Xiao; Qian Liu 016; Yang Zhou 018; Min Li 028 (CSoNet, 2022)

Fast algorithms for supermodular and non-supermodular minimization via bi-criteria strategy. - Xiaojuan Zhang; Qian Liu 016; Min Li 028; Yang Zhou 018 (J. Comb. Optim., 2022)

An improved deep echo state network inspired by tissue-like P system forecasting for non-stationary time series. - Xiaojian Yang; Qian Liu 016; Xiyu Liu 001; Jie Xue 001 (J. Membr. Comput., 2022)

Generative image inpainting using edge prediction and appearance flow. - Qian Liu 016; Hua Ji; Gang Liu (Multim. Tools Appl., 2022)

The submodularity of two-stage stochastic maximum-weight independent set problems. - Min Li 028; Hao Xiao; Qian Liu 016; Yang Zhou 018 (Theor. Comput. Sci., 2022)

DR-Submodular Function Maximization with Adaptive Stepsize. - Yanfei Li; Min Li 028; Qian Liu 016; Yang Zhou 018 (COCOON (1), 2023)

Random Approximation Algorithms for Monotone k-Submodular Function Maximization with Size Constraints. - YuYing Li; Min Li 028; Yang Zhou 018; Qian Liu 016 (IJTCS-FAW, 2023)

Approximation Algorithms for Matroid and Knapsack Means Problems. - Ao Zhao; Qian Liu 016; Yang Zhou 018; Min Li 028 (Asia Pac. J. Oper. Res., 2023)

On maximizing monotone or non-monotone k-submodular functions with the intersection of knapsack and matroid constraints. - Kemin Yu; Min Li 028; Yang Zhou 018; Qian Liu 016 (J. Comb. Optim., 2023)

or-Submodular Maximization Under a Matroid Constraint and a Knapsack Constraint. - Haifeng Huang; Qian Liu 016; Yang Zhou 018; Min Li 028 (AAIM (1), 2024)

Maximizing a $ k $-submodular function with $ p $-system constraints. - Hanlu Ye; Min Li 028; Yang Zhou 018; Qian Liu 016 (Math. Found. Comput., 2025)

Fast algorithms combining threshold-decreasing and greedy methods for maximizing constraint k-submodular functions. - Shuxian Niu; Qian Liu 016; Yang Zhou 018; Min Li 028 (Discret. Math. Algorithms Appl., 2025)

Randomized approximation algorithms for monotone k-submodular function maximization with constraints. - Yuying Li; Min Li 028; Yang Zhou 018; Shuxian Niu; Qian Liu 016 (J. Comb. Optim., 2025)