Chunming Tang
Orcid: 0000-0003-1649-2217Affiliations:
- Guangxi University, Nanning, China
According to our database1,
Chunming Tang
authored at least 20 papers
between 2005 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Numer. Algorithms, September, 2023
J. Appl. Math. Comput., February, 2023
2022
A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications.
Comput. Appl. Math., October, 2022
A new restricted memory level bundle method for constrained convex nonsmooth optimization.
Optim. Lett., 2022
2020
Appl. Math. Comput., 2020
A Generalized Alternating Linearization Bundle Method for Structured Convex Optimization with Inexact First-Order Oracles.
Algorithms, 2020
2015
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization.
J. Comput. Appl. Math., 2015
A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization.
Appl. Math. Comput., 2015
2014
Numer. Algorithms, 2014
Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems.
J. Optim. Theory Appl., 2014
2012
Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions.
Eur. J. Oper. Res., 2012
2011
J. Comput. Appl. Math., 2011
Inverse problems and solution methods for a class of nonlinear complementarity problems.
Comput. Optim. Appl., 2011
2010
Error bound results for generalized D-gap functions of nonsmooth variational inequality problems.
J. Comput. Appl. Math., 2010
Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions.
Eur. J. Oper. Res., 2010
2007
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization.
Comput. Math. Appl., 2007
2006
A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization.
Appl. Math. Comput., 2006
2005
A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization.
Appl. Math. Comput., 2005