Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJin-Bao Jian
Person information
- affiliation: Guangxi University for Nationalities, College of Science, Nanning, China
- affiliation: Yulin Normal University, College of Mathematics and Information Science, Yulin, China
- affiliation: Guangxi University, College of Mathematics and Informatics Science, Nanning, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j60]Jianghua Yin, Jinbao Jian
, Guodong Ma:
A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations. Comput. Optim. Appl. 87(1): 289-322 (2024)- [j59]Guodong Ma, Liqi Liu, Jinbao Jian, Xihong Yan:
A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications. J. Appl. Math. Comput. 70(1): 103-147 (2024) - [j58]Jinbao Jian, Zhiwen Ren, Jianghua Yin, Dao-Lan Han, Xiaodi Wu:
An effective inertial-relaxed CGPM for nonlinear monotone equations. J. Appl. Math. Comput. 70(1): 689-710 (2024) - 2023
- [j57]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) - [j56]Jianghua Yin, Jinbao Jian, Xianzhen Jiang, Xiaodi Wu:
A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration. J. Comput. Appl. Math. 419: 114674 (2023) - [j55]Jinbao Jian, Guodong Ma, Pengjie Liu, Jiawei Xu:
Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems. J. Comput. Appl. Math. 426: 115086 (2023) - [j54]Guodong Ma, Jiachen Jin, Jinbao Jian, Jianghua Yin, Dao-Lan Han:
A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing. Numer. Algorithms 92(3): 1621-1653 (2023) - [j53]Xianzhen Jiang, Huihui Yang, Jinbao Jian, Xiaodi Wu:
Two families of hybrid conjugate gradient methods with restart procedures and their applications. Optim. Methods Softw. 38(5): 947-974 (2023) - 2022
- [j52]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) - [j51]Jinbao Jian, Wenrui Chen, Xianzhen Jiang, Pengjie Liu:
A three-term conjugate gradient method with accelerated subspace quadratic optimization. J. Appl. Math. Comput. 68(4): 2407-2433 (2022) - [j50]Jinbao Jian, Pengjie Liu, Xianzhen Jiang, Chen Zhang:
Two classes of spectral conjugate gradient methods for unconstrained optimizations. J. Appl. Math. Comput. 68(6): 4435-4456 (2022) - [j49]Xianzhen Jiang, Wei Liao, Jianghua Yin, Jinbao Jian:
A new family of hybrid three-term conjugate gradient methods with applications in image restoration. Numer. Algorithms 91(1): 161-191 (2022) - [j48]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) - 2021
- [j47]Xianzhen Jiang, Jinbao Jian, Dan Song, Pengjie Liu:
An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction. Comput. Appl. Math. 40(5) (2021) - [j46]Jinbao Jian, Pengjie Liu, Jianghua Yin, Chen Zhang, Miantao Chao:
A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application. J. Comput. Appl. Math. 390: 113368 (2021) - [j45]Jianghua Yin, Jin-bao Jian, Xianzhen Jiang:
A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration. J. Comput. Appl. Math. 391: 113423 (2021) - [j44]Jianghua Yin, Jinbao Jian, Xianzhen Jiang, Meixing Liu, Lingzhi Wang:
A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications. Numer. Algorithms 88(1): 389-418 (2021) - 2020
- [j43]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) - [j42]Miantao Chao, Zhao Deng, Jinbao Jian:
Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure. Complex. 2020: 6237942:1-6237942:14 (2020) - [j41]Pengjie Liu, Jinbao Jian, Xianzhen Jiang:
A New Conjugate Gradient Projection Method for Convex Constrained Nonlinear Equations. Complex. 2020: 8323865:1-8323865:14 (2020) - [j40]Jinbao Jian, Chen Zhang, Jianghua Yin, Linfeng Yang, Guodong Ma:
Monotone Splitting Sequential Quadratic Optimization Algorithm with Applications in Electric Power Systems. J. Optim. Theory Appl. 186(1): 226-247 (2020)
2010 – 2019
- 2019
- [j39]Xianzhen Jiang, Jinbao Jian:
Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search. J. Comput. Appl. Math. 348: 525-534 (2019) - 2017
- [j38]Jinbao Jian, Qian Chen, Xianzhen Jiang, You-Fang Zeng, Jianghua Yin:
A new spectral conjugate gradient method for large-scale unconstrained optimization. Optim. Methods Softw. 32(3): 503-515 (2017) - [j37]Linfeng Yang, Jinbao Jian, Yan Xu, Zhaoyang Dong, Guodong Ma:
Multiple Perspective-Cuts Outer Approximation Method for Risk-Averse Operational Planning of Regional Energy Service Providers. IEEE Trans. Ind. Informatics 13(5): 2606-2619 (2017) - 2016
- [j36]Haiyan Zheng, Jinbao Jian, Linfeng Yang, Ran Quan:
A deterministic method for the unit commitment problem in power systems. Comput. Oper. Res. 66: 241-247 (2016) - 2015
- [j35]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) - [j34]Jian-Ling Li, Renshuai Huang, Jinbao Jian:
A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints. Appl. Math. Comput. 269: 885-903 (2015) - [j33]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
- [j32]Jin-bao Jian, Jie Li, Hai-Yan Zheng, Jian-Ling Li:
A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems. Appl. Math. Comput. 226: 673-690 (2014) - [j31]Jinbao Jian, Dao-Lan Han, Qing-Juan Xu:
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity. Appl. Math. Comput. 236: 93-108 (2014) - [j30]Jin-bao Jian, Qiao-fang Chen, Zong-wen Huang:
A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences. J. Comput. Appl. Math. 263: 115-128 (2014) - [j29]Jin-Bao Jian, Xing-De Mo, Li-juan Qiu, Su-ming Yang, Fusheng Wang:
Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems. J. Optim. Theory Appl. 160(1): 158-188 (2014) - [j28]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) - [j27]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) - [j26]Fusheng Wang, Jin-Bao Jian, Chuan-Long Wang:
A model-hybrid approach for unconstrained optimization problems. Numer. Algorithms 66(4): 741-759 (2014) - 2013
- [j25]Wei-xin Cheng, Chong-Chao Huang, Jin-Bao Jian:
An improved infeasible SSLE method for constrained optimization without strict complementarity. Comput. Oper. Res. 40(5): 1506-1515 (2013) - 2012
- [j24]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) - [j23]Qingjie Hu, Yu Chen, Jinbao Jian:
Second-order duality for non-differentiable minimax fractional programming. Int. J. Comput. Math. 89(1): 11-16 (2012) - 2011
- [j22]Xing-De Mo, Jin-bao Jian, Su-ming Yang:
An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments. Appl. Math. Comput. 217(17): 7226-7237 (2011) - [j21]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) - [j20]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) - [j19]Jinbao Jian, Guodong Ma, Chuan-Hao Guo:
A new ɛ-generalized projection method of strongly sub-feasible directions for inequality constrained optimization. J. Syst. Sci. Complex. 24(3): 604-618 (2011) - 2010
- [j18]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) - [j17]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)
2000 – 2009
- 2009
- [j16]Jin-Bao Jian, Xiao-yan Ke, Wei-xin Cheng:
A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity. Appl. Math. Comput. 214(2): 632-644 (2009) - [j15]Zhibin Zhu, Xiang Cai, Jinbao Jian:
An improved SQP algorithm for solving minimax problems. Appl. Math. Lett. 22(4): 464-469 (2009) - [j14]Jin-Bao Jian, Ran Quan, Wei-xin Cheng:
A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization. Comput. Math. Appl. 58(8): 1520-1533 (2009) - 2008
- [j13]Jin-Bao Jian, Qing-Juan Xu, Dao-Lan Han:
A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming. Eur. J. Oper. Res. 186(1): 41-62 (2008) - [c1]Linfeng Yang, Jinbao Jian, Taoshen Li, Zhenrong Zhang:
Parallel algorithm of MCQoS routing based on improved PSRS and binary search. ICAIT 2008: 47:1-47:6 - 2007
- [j12]Jin-Bao Jian, Xue-Lu Zhang, Ran Quan:
A new finitely convergent algorithm for systems of nonlinear inequalities. Appl. Math. Lett. 20(4): 405-411 (2007) - [j11]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
- [j10]Jin-Bao Jian, Qing-Juan Xu, Dao-Lan Han:
A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints. Appl. Math. Comput. 182(1): 854-870 (2006) - [j9]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
- [j8]Jin-Bao Jian:
A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity. Appl. Math. Comput. 162(3): 1065-1081 (2005) - [j7]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) - [j6]Jin-bao Jian:
A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints. Comput. Optim. Appl. 31(3): 335-361 (2005) - [j5]Jian-Ling Li, Jin-Bao Jian:
A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints. J. Glob. Optim. 33(4): 477-510 (2005) - 2004
- [j4]Jin-Bao Jian, Xing-De Mo, Jian-Ling Li:
Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints. J. Glob. Optim. 29(1): 59-83 (2004) - [j3]Jin-bao Jian, Yu-mei Liang:
Finitely Convergent Algorithms of Generalized Gradient Projection for Systems of Nonlinear Inequalities. Neural Parallel Sci. Comput. 12(2): 207-218 (2004) - 2003
- [j2]Zhibin Zhu, Kecun Zhang, Jinbao Jian:
An improved SQP algorithm for inequality constrained optimization. Math. Methods Oper. Res. 58(2): 271-282 (2003)
1990 – 1999
- 1999
- [j1]Jinbao Jian:
A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems. J. Glob. Optim. 15(2): 197-211 (1999)
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-04-25 05:53 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:
