Jin-Bao Jian
Orcid: 0000-0001-8048-7397Affiliations:
- Guangxi University for Nationalities, College of Science, Nanning, China
- Yulin Normal University, College of Mathematics and Information Science, Yulin, China
- Guangxi University, College of Mathematics and Informatics Science, Nanning, China
According to our database1,
Jin-Bao Jian
authored at least 61 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications.
J. Appl. Math. Comput., February, 2024
J. Appl. Math. Comput., February, 2024
A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations.
Comput. Optim. Appl., January, 2024
2023
Two families of hybrid conjugate gradient methods with restart procedures and their applications.
Optim. Methods Softw., September, 2023
Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems.
J. Comput. Appl. Math., July, 2023
A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing.
Numer. Algorithms, March, 2023
J. Appl. Math. Comput., February, 2023
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., 2023
2022
J. Appl. Math. Comput., December, 2022
A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications.
Comput. Appl. Math., October, 2022
A three-term conjugate gradient method with accelerated subspace quadratic optimization.
J. Appl. Math. Comput., August, 2022
A new restricted memory level bundle method for constrained convex nonsmooth optimization.
Optim. Lett., 2022
A new family of hybrid three-term conjugate gradient methods with applications in image restoration.
Numer. Algorithms, 2022
2021
A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications.
Numer. Algorithms, 2021
A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration.
J. Comput. Appl. Math., 2021
A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application.
J. Comput. Appl. Math., 2021
An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction.
Comput. Appl. Math., 2021
2020
Monotone Splitting Sequential Quadratic Optimization Algorithm with Applications in Electric Power Systems.
J. Optim. Theory Appl., 2020
A New Conjugate Gradient Projection Method for Convex Constrained Nonlinear Equations.
Complex., 2020
Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure.
Complex., 2020
Appl. Math. Comput., 2020
2019
Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search.
J. Comput. Appl. Math., 2019
2017
Multiple Perspective-Cuts Outer Approximation Method for Risk-Averse Operational Planning of Regional Energy Service Providers.
IEEE Trans. Ind. Informatics, 2017
Optim. Methods Softw., 2017
2016
Comput. Oper. Res., 2016
2015
A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization.
J. Comput. Appl. Math., 2015
A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints.
Appl. Math. Comput., 2015
A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization.
Appl. Math. Comput., 2015
2014
Numer. Algorithms, 2014
Numer. Algorithms, 2014
Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems.
J. Optim. Theory Appl., 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
A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences.
J. Comput. Appl. Math., 2014
A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems.
Appl. Math. Comput., 2014
A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity.
Appl. Math. Comput., 2014
2013
An improved infeasible SSLE method for constrained optimization without strict complementarity.
Comput. Oper. Res., 2013
2012
Int. J. Comput. Math., 2012
Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions.
Eur. J. Oper. Res., 2012
2011
A new <i>ɛ</i>-generalized projection method of strongly sub-feasible directions for inequality constrained optimization.
J. Syst. Sci. Complex., 2011
J. Comput. Appl. Math., 2011
Inverse problems and solution methods for a class of nonlinear complementarity problems.
Comput. Optim. Appl., 2011
An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments.
Appl. Math. Comput., 2011
2010
Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions.
Eur. J. Oper. Res., 2010
2009
A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization.
Comput. Math. Appl., 2009
A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity.
Appl. Math. Comput., 2009
2008
A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming.
Eur. J. Oper. Res., 2008
Proceedings of the 2008 International Conference on Advanced Infocomm Technology, 2008
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
Appl. Math. Lett., 2007
2006
A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization.
Appl. Math. Comput., 2006
A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints.
Appl. Math. Comput., 2006
2005
A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints.
J. Glob. Optim., 2005
A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints.
Comput. Optim. Appl., 2005
A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization.
Appl. Math. Comput., 2005
A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity.
Appl. Math. Comput., 2005
2004
Finitely Convergent Algorithms of Generalized Gradient Projection for Systems of Nonlinear Inequalities.
Neural Parallel Sci. Comput., 2004
Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints.
J. Glob. Optim., 2004
2003
Math. Methods Oper. Res., 2003
1999
A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems.
J. Glob. Optim., 1999