default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChunming Tang 0002
Person information
- affiliation: Guangxi University, Nanning, China
Other persons with the same name
- Chunming Tang (aka: Chun-Ming Tang) — disambiguation page
- Chunming Tang 0001
![[0000-0001-9599-851X]](https://dblp.org/img/orcid-mark.12x12.png "0000-0001-9599-851X")
— China West Normal University, Nanchong, China - Chunming Tang 0003 (aka: Chun-Ming Tang 0003) — Guangzhou University, Guangzhou, China
- Chunming Tang 0004 (aka: Chun-Ming Tang 0004) — University of Florida, Gainesville, FL, USA
- Chunming Tang 0005 — Peking University, Beijing, China
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Jianghua Yin, Chunming Tang, Jinbao Jian, Qiongxuan Huang:
A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization. J. Glob. Optim. 89(4): 899-926 (2024)- 2023
- [j20]Chunming Tang, Xianglin Rong, Jinbao Jian, Shajie Xing:
A hybrid Riemannian conjugate gradient method for nonconvex optimization problems. J. Appl. Math. Comput. 69(1): 823-852 (2023) - [j19]Chunming Tang, Wancheng Tan, Shajie Xing, Haiyan Zheng:
A class of spectral conjugate gradient methods for Riemannian optimization. Numer. Algorithms 94(1): 131-147 (2023) - 2022
- [j18]Jinbao Jian, Jianghua Yin, Chunming Tang, Dao-Lan Han:
A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications. Comput. Appl. Math. 41(7) (2022) - [j17]Chunming Tang, Yanni Li, Jinbao Jian, Haiyan Zheng:
A new restricted memory level bundle method for constrained convex nonsmooth optimization. Optim. Lett. 16(8): 2405-2434 (2022) - 2020
- [j16]Chunming Tang, Yanni Li, Xiaoxia Dong, Bo He:
A Generalized Alternating Linearization Bundle Method for Structured Convex Optimization with Inexact First-Order Oracles. Algorithms 13(4): 91 (2020) - [j15]Chunming Tang, Shuai Liu, Jinbao Jian, Xiaomei Ou:
A multi-step doubly stabilized bundle method for nonsmooth convex optimization. Appl. Math. Comput. 376: 125154 (2020)
2010 – 2019
- 2015
- [j14]Jin-Bao Jian, Hua-Qin Pan, Chun-Ming Tang, Jian-Ling Li:
A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization. Appl. Math. Comput. 266: 560-578 (2015) - [j13]Jin-Bao Jian, Chuan-Hao Guo, Chun-Ming Tang, Yan-Qin Bai:
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization. J. Comput. Appl. Math. 273: 88-102 (2015) - 2014
- [j12]Jin-Bao Jian, Qing-Juan Hu, Chun-Ming Tang:
Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems. J. Optim. Theory Appl. 163(3): 859-883 (2014) - [j11]Chun-Ming Tang, Shuai Liu, Jin-Bao Jian, Jian-Ling Li:
A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. Numer. Algorithms 65(1): 1-22 (2014) - 2012
- [j10]Chun-Ming Tang, Jin-bao Jian:
Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions. Eur. J. Oper. Res. 218(1): 28-37 (2012) - 2011
- [j9]Jianzhong Zhang, Jin-bao Jian, Chun-Ming Tang:
Inverse problems and solution methods for a class of nonlinear complementarity problems. Comput. Optim. Appl. 49(2): 271-297 (2011) - [j8]Chun-Ming Tang, Jin-Bao Jian, Guoyin Li:
A working set SQCQP algorithm with simple nonmonotone penalty parameters. J. Comput. Appl. Math. 236(6): 1382-1398 (2011) - 2010
- [j7]Hai-Yan Zheng, Jin-Bao Jian, Chun-Ming Tang, Ran Quan:
A new norm-relaxed SQP algorithm with global convergence. Appl. Math. Lett. 23(6): 670-675 (2010) - [j6]Jin-Bao Jian, Chun-Ming Tang, Hai-Yan Zheng:
Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions. Eur. J. Oper. Res. 200(3): 645-657 (2010) - [j5]Guoyin Li, Chun-Ming Tang, Zengxin Wei:
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems. J. Comput. Appl. Math. 233(11): 2795-2806 (2010)
2000 – 2009
- 2007
- [j4]Chun-Ming Tang, Zengxin Wei, Guoyin Li:
A new version of the Liu-Storey conjugate gradient method. Appl. Math. Comput. 189(1): 302-313 (2007) - [j3]Jin-Bao Jian, You-Fang Zeng, Chun-Ming Tang:
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization. Comput. Math. Appl. 54(4): 507-524 (2007) - 2006
- [j2]Jin-Bao Jian, Hai-Yan Zheng, Chun-Ming Tang, Qingjie Hu:
A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. Appl. Math. Comput. 182(2): 955-976 (2006) - 2005
- [j1]Jinbao Jian, Haiyan Zheng, Qingjie Hu, Chun-Ming Tang:
A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. Appl. Math. Comput. 168(1): 1-28 (2005)
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-12-02 21:28 CET 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:
