default search action
Li-Ping Pang 0001
Person information
- affiliation: Dalian University of Technology, Department of Applied Mathematics, China
Other persons with the same name
- Liping Pang — disambiguation page
- Liping Pang 0002 — Beijing University of Aeronautics and Astronautics, School of Aviation Science and Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j41]Na Xu, Fan-Yun Meng, Li-Ping Pang:
The Augmented Lagrangian Method for Mathematical Programs with Vertical Complementarity Constraints Based on Inexact Scholtes Regularization. Asia Pac. J. Oper. Res. 40(6): 2250042:1-2250042:31 (2023) - [j40]Xiaoliang Wang
, Yuzhu Tian, Liping Pang:
A class of three-term derivative-free methods for large-scale nonlinear monotone system of equations and applications to image restoration problems. J. Appl. Math. Comput. 69(1): 1269-1296 (2023) - [j39]Xiaoliang Wang
A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization. J. Comput. Appl. Math. 422: 114949 (2023) - [j38]Li-Ping Pang, Fan-Yun Meng
A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems. J. Glob. Optim. 85(4): 891-915 (2023) - [j37]Xiaoliang Wang
A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems. Numer. Algorithms 93(3): 949-970 (2023) - [j36]Li-Ping Pang, Ming-Kun Zhang
A stochastic approximation method for convex programming with many semidefinite constraints. Optim. Methods Softw. 38(1): 34-58 (2023) - [j35]Naihua Ji, Huiqian Dong, Fan-Yun Meng, Liping Pang:
Semantic Segmentation and Depth Estimation Based on Residual Attention Mechanism. Sensors 23(17): 7466 (2023) - 2022
- [j34]Xiaoliang Wang
A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization. Asia Pac. J. Oper. Res. 39(2): 2150015:1-2150015:43 (2022) - [j33]Dan Li, Shuang Chen, Li-Ping Pang:
Proximal Gradient-Type Algorithms for a Class of Bilevel Programming Problems. Asia Pac. J. Oper. Res. 39(5): 2150039:1-2150039:17 (2022) - [j32]Li-Ping Pang, Qi Wu:
A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming. Numer. Algorithms 90(1): 387-422 (2022) - 2020
- [j31]Li-Ping Pang, Qi Wu, Jin-He Wang, Qiong Wu:
A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods. Comput. Optim. Appl. 76(1): 125-153 (2020) - [j30]Jian Lv, Ze-Hao Xiao, Li-Ping Pang:
An incremental bundle method for portfolio selection problem under second-order stochastic dominance. Numer. Algorithms 85(2): 653-681 (2020)
2010 – 2019
- 2019
- [j29]Qiong Wu, Jin-He Wang, Hong-Wei Zhang, Shuang Wang, Li-Ping Pang:
Nonsmooth Optimization Method for H∞ Output Feedback Control. Asia Pac. J. Oper. Res. 36(3): 1950015:1-1950015:23 (2019) - [j28]Jian Lv, Li-Ping Pang, Na Xu, Ze-Hao Xiao:
An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems. Numer. Algorithms 80(2): 397-427 (2019) - 2018
- [j27]Na Xu, Xide Zhu
Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC. Asia Pac. J. Oper. Res. 35(1): 1850008:1-1850008:20 (2018) - [j26]Jian Lv, Li-Ping Pang, Fan-Yun Meng:
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information. J. Glob. Optim. 70(3): 517-549 (2018) - [j25]Ming Huang, Yue Lu, Li-Ping Pang, Zun-Quan Xia:
Correction to: A space decomposition scheme for maximum eigenvalue functions and its applications. Math. Methods Oper. Res. 87(2): 309 (2018) - 2017
- [j24]Jin-He Wang, Fan-Yun Meng, Li-Ping Pang, Xing-Hua Hao:
An adaptive fixed-point proximity algorithm for solving total variation denoising models. Inf. Sci. 402: 69-81 (2017) - [j23]Fan-Yun Meng, Li-Ping Pang, Jian Lv, Jin-He Wang:
An approximate bundle method for solving nonsmooth equilibrium problems. J. Glob. Optim. 68(3): 537-562 (2017) - [j22]Ming Huang, Yue Lu
A space decomposition scheme for maximum eigenvalue functions and its applications. Math. Methods Oper. Res. 85(3): 453-490 (2017) - 2016
- [j21]Li-Ping Pang, Jian Lv, Jin-He Wang:
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems. Comput. Optim. Appl. 64(2): 433-465 (2016) - [j20]Shuang Chen, Li-Ping Pang, Xuefei Ma, Dan Li:
SAA method based on modified Newton method for stochastic variational inequality with second-order cone constraints and application in portfolio optimization. Math. Methods Oper. Res. 84(1): 129-154 (2016) - 2015
- [j19]Li-Ping Pang, Shuang Chen, Jin-He Wang:
Risk management in portfolio applications of non-convex stochastic programming. Appl. Math. Comput. 258: 565-575 (2015) - [j18]Jian Lv, Li-Ping Pang, Jin-He Wang:
Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization. Appl. Math. Comput. 265: 635-651 (2015) - 2014
- [j17]Ming Huang, Li-Ping Pang, Zun-Quan Xia:
The space decomposition theory for a class of eigenvalue optimizations. Comput. Optim. Appl. 58(2): 423-454 (2014) - [j16]Yang Yang
Constrained Nonconvex Nonsmooth Optimization via Proximal Bundle Method. J. Optim. Theory Appl. 163(3): 900-925 (2014) - [j15]Dan Li, Li-Ping Pang, Shuang Chen:
A proximal alternating linearization method for nonconvex optimization problems. Optim. Methods Softw. 29(4): 771-785 (2014) - 2013
- [j14]Fang-Fang Guo, Li-Ping Pang, Dan Meng, Zun-Quan Xia:
An algorithm for solving optimization problems with fuzzy relational inequality constraints. Inf. Sci. 252: 20-31 (2013) - 2012
- [j13]Yuan Lu, Li-Ping Pang, Shen Jie, Xi-Jun Liang:
A Decomposition Algorithm for Convex Nondifferentiable Minimization with Errors. J. Appl. Math. 2012: 215160:1-215160:15 (2012) - [j12]Jie Shen, Li-Ping Pang:
A Proximal Analytic Center Cutting Plane Algorithm for Solving Variational Inequality Problems. J. Appl. Math. 2012: 503242:1-503242:10 (2012) - [j11]Shuang Chen, Li-Ping Pang, Fang-Fang Guo, Zun-Quan Xia:
Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions. Math. Comput. Model. 55(3-4): 779-784 (2012) - 2010
- [j10]Si-Jia Jiang, Li-Ping Pang, Jie Shen:
Existence of solutions of generalized vector variational-type inequalities with set-valued mappings. Comput. Math. Appl. 59(4): 1453-1461 (2010) - [j9]Yuan Lu, Li-Ping Pang, Fang-Fang Guo, Zun-Quan Xia:
A superlinear space decomposition algorithm for constrained nonsmooth convex program. J. Comput. Appl. Math. 234(1): 224-232 (2010) - [j8]Yuan Lu, Li-Ping Pang, Xi-Jun Liang, Zun-Quan Xia:
An approximate decomposition algorithm for convex minimization. J. Comput. Appl. Math. 234(3): 658-666 (2010)
2000 – 2009
- 2008
- [j7]Jie Shen, Li-Ping Pang:
A bundle-type auxiliary problem method for solving generalized variational-like inequalities. Comput. Math. Appl. 55(12): 2993-2998 (2008) - [j6]Li-Ping Pang, Ming-Zheng Wang, Zun-Quan Xia:
First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization. Comput. Math. Appl. 56(5): 1457-1464 (2008) - [j5]Jie Shen, Li-Ping Pang:
An approximate bundle-type auxiliary problem method for solving generalized variational inequalities. Math. Comput. Model. 48(5-6): 769-775 (2008) - 2007
- [j4]Feng Shan, Li-Ping Pang, Zun-Quan Xia:
An approximate U-Lagrangian and algorithm to UV decomposition. Appl. Math. Comput. 184(2): 924-930 (2007) - [j3]Li-Ping Pang, Jie Shen, Wei Wang:
Two parallel distribution algorithms for convex constrained minimization problems. Appl. Math. Comput. 186(2): 1762-1771 (2007) - [j2]Li-Ping Pang, Jie Shen, He-Shan Song:
A modified predictor-corrector algorithm for solving nonconvex generalized variational inequality. Comput. Math. Appl. 54(3): 319-325 (2007) - [j1]Li-Ping Pang, Emilio Spedicato, Zun-Quan Xia, Wei Wang:
A method for solving the system of linear equations and linear inequalities. Math. Comput. Model. 46(5-6): 823-836 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 20:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: