Two parallel distribution algorithms for convex constrained minimization problems. - Li-Ping Pang 001; Jie Shen 007; Wei Wang 123 (Appl. Math. Comput., 2007)

An approximate U-Lagrangian and algorithm to UV decomposition. - Feng Shan; Li-Ping Pang 001; Zun-Quan Xia (Appl. Math. Comput., 2007)

A modified predictor-corrector algorithm for solving nonconvex generalized variational inequality. - Li-Ping Pang 001; Jie Shen 007; He-Shan Song (Comput. Math. Appl., 2007)

A method for solving the system of linear equations and linear inequalities. - Li-Ping Pang 001; Emilio Spedicato; Zun-Quan Xia; Wei Wang 123 (Math. Comput. Model., 2007)

First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization. - Li-Ping Pang 001; Ming-Zheng Wang; Zun-Quan Xia (Comput. Math. Appl., 2008)

A bundle-type auxiliary problem method for solving generalized variational-like inequalities. - Jie Shen 007; Li-Ping Pang 001 (Comput. Math. Appl., 2008)

An approximate bundle-type auxiliary problem method for solving generalized variational inequalities. - Jie Shen 007; Li-Ping Pang 001 (Math. Comput. Model., 2008)

Existence of solutions of generalized vector variational-type inequalities with set-valued mappings. - Si-Jia Jiang; Li-Ping Pang 001; Jie Shen 007 (Comput. Math. Appl., 2010)

A superlinear space decomposition algorithm for constrained nonsmooth convex program. - Yuan Lu; Li-Ping Pang 001; Fang-Fang Guo; Zun-Quan Xia (J. Comput. Appl. Math., 2010)

An approximate decomposition algorithm for convex minimization. - Yuan Lu; Li-Ping Pang 001; Xi-Jun Liang; Zun-Quan Xia (J. Comput. Appl. Math., 2010)

A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors. - Yuan Lu; Li-Ping Pang 001; Shen Jie; Xi-Jun Liang (J. Appl. Math., 2012)

A Proximal Analytic Center Cutting Plane Algorithm for Solving Variational Inequality Problems. - Jie Shen 007; Li-Ping Pang 001 (J. Appl. Math., 2012)

Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions. - Shuang Chen 005; Li-Ping Pang 001; Fang-Fang Guo; Zun-Quan Xia (Math. Comput. Model., 2012)

An algorithm for solving optimization problems with fuzzy relational inequality constraints. - Fang-Fang Guo; Li-Ping Pang 001; Dan Meng; Zun-Quan Xia (Inf. Sci., 2013)

The space decomposition theory for a class of eigenvalue optimizations. - Ming Huang; Li-Ping Pang 001; Zun-Quan Xia (Comput. Optim. Appl., 2014)

Constrained Nonconvex Nonsmooth Optimization via Proximal Bundle Method. - Yang Yang 077; Li-Ping Pang 001; Xuefei Ma; Jie Shen 007 (J. Optim. Theory Appl., 2014)

A proximal alternating linearization method for nonconvex optimization problems. - Dan Li; Li-Ping Pang 001; Shuang Chen 005 (Optim. Methods Softw., 2014)

Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization. - Jian Lv; Li-Ping Pang 001; Jin-He Wang (Appl. Math. Comput., 2015)

Risk management in portfolio applications of non-convex stochastic programming. - Li-Ping Pang 001; Shuang Chen 005; Jin-He Wang (Appl. Math. Comput., 2015)

Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems. - Li-Ping Pang 001; Jian Lv; Jin-He Wang (Comput. Optim. Appl., 2016)

SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization. - Shuang Chen 005; Li-Ping Pang 001; Xuefei Ma; Dan Li (Math. Methods Oper. Res., 2016)

An adaptive fixed-point proximity algorithm for solving total variation denoising models. - Jin-He Wang; Fan-Yun Meng; Li-Ping Pang 001; Xing-Hua Hao (Inf. Sci., 2017)

An approximate bundle method for solving nonsmooth equilibrium problems. - Fan-Yun Meng; Li-Ping Pang 001; Jian Lv; Jin-He Wang (J. Glob. Optim., 2017)

A space decomposition scheme for maximum eigenvalue functions and its applications. - Ming Huang; Yue Lu; Li-Ping Pang 001; Zun-Quan Xia (Math. Methods Oper. Res., 2017)

Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC. - Na Xu; Xide Zhu; Li-Ping Pang 001; Jian Lv (Asia Pac. J. Oper. Res., 2018)

A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information. - Jian Lv; Li-Ping Pang 001; Fan-Yun Meng (J. Glob. Optim., 2018)

Correction to: A space decomposition scheme for maximum eigenvalue functions and its applications. - Ming Huang; Yue Lu; Li-Ping Pang 001; Zun-Quan Xia (Math. Methods Oper. Res., 2018)

Nonsmooth Optimization Method for H∞ Output Feedback Control. - Qiong Wu; Jin-He Wang; Hongwei Zhang; Shuang Wang; Li-Ping Pang 001 (Asia Pac. J. Oper. Res., 2019)

An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems. - Jian Lv; Li-Ping Pang 001; Na Xu; Ze-Hao Xiao (Numer. Algorithms, 2019)

A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods. - Li-Ping Pang 001; Qi Wu; Jin-He Wang; Qiong Wu (Comput. Optim. Appl., 2020)

An incremental bundle method for portfolio selection problem under second-order stochastic dominance. - Jian Lv; Ze-Hao Xiao; Li-Ping Pang 001 (Numer. Algorithms, 2020)

Proximal Gradient-Type Algorithms for a Class of Bilevel Programming Problems. - Dan Li; Shuang Chen 005; Li-Ping Pang 001 (Asia Pac. J. Oper. Res., 2022)

A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization. - Xiaoliang Wang; Liping Pang 001; Qi Wu (Asia Pac. J. Oper. Res., 2022)

Adaptive multilabel image segmentation model with prior constraints based on geometric structure characteristics. - Yuzhu Tian; Liping Pang 001; Yanbo Pang; Hongwei Zhang (J. Electronic Imaging, 2022)

A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming. - Li-Ping Pang 001; Qi Wu (Numer. Algorithms, 2022)

A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization. - Xiaoliang Wang; Li-Ping Pang 001; Xiantao Xiao (J. Comput. Appl. Math., 2023)

A stochastic approximation method for convex programming with many semidefinite constraints. - Li-Ping Pang 001; Ming-Kun Zhang; Xiantao Xiao (Optim. Methods Softw., 2023)

A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems. - Xiaoliang Wang; Yuzhu Tian; Liping Pang 001 (J. Appl. Math. Comput., 2023)

A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems. - Li-Ping Pang 001; Fan-Yun Meng; Jian-Song Yang (J. Glob. Optim., 2023)

A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems. - Xiaoliang Wang; Gonglin Yuan; Liping Pang 001 (Numer. Algorithms, 2023)

Semantic Segmentation and Depth Estimation Based on Residual Attention Mechanism. - Naihua Ji; Huiqian Dong; Fan-Yun Meng; Liping Pang 001 (Sensors, 2023)

The Augmented Lagrangian Method for Mathematical Programs with Vertical Complementarity Constraints Based on Inexact Scholtes Regularization. - Na Xu; Fan-Yun Meng; Li-Ping Pang 001 (Asia Pac. J. Oper. Res., 2023)

Variable multi-scale attention fusion network and adaptive correcting gradient optimization for multi-task learning. - Naihua Ji; Yongqiang Sun; Fanyun Meng; Li-Ping Pang 001; Yuzhu Tian (Pattern Recognit., 2025)

Robust satisficing model with Sinkhorn distance. - Shuang Wang; Li-Ping Pang 001; Jian Lv (Optim. Lett., 2025)