A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems. - Jinbao Jian (J. Glob. Optim., 1999)

An improved SQP algorithm for inequality constrained optimization. - Zhibin Zhu; Kecun Zhang; Jinbao Jian (Math. Methods Oper. Res., 2003)

Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints. - Jin-Bao Jian; Xing-De Mo; Jian-Ling Li (J. Glob. Optim., 2004)

Finitely Convergent Algorithms of Generalized Gradient Projection for Systems of Nonlinear Inequalities. - Jin-bao Jian; Yu-mei Liang (Neural Parallel Sci. Comput., 2004)

A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity. - Jin-Bao Jian (Appl. Math. Comput., 2005)

A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. - Jinbao Jian; Haiyan Zheng; Qingjie Hu; Chun-Ming Tang 002 (Appl. Math. Comput., 2005)

A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints. - Jin-bao Jian (Comput. Optim. Appl., 2005)

A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints. - Jian-Ling Li; Jin-Bao Jian (J. Glob. Optim., 2005)

A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints. - Jin-Bao Jian; Qing-Juan Xu; Dao-Lan Han (Appl. Math. Comput., 2006)

A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization. - Jin-Bao Jian; Hai-Yan Zheng; Chun-Ming Tang 002; Qingjie Hu (Appl. Math. Comput., 2006)

A new finitely convergent algorithm for systems of nonlinear inequalities. - Jin-Bao Jian; Xue-Lu Zhang; Ran Quan (Appl. Math. Lett., 2007)

A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization. - Jin-Bao Jian; You-Fang Zeng; Chun-Ming Tang 002 (Comput. Math. Appl., 2007)

Parallel algorithm of MCQoS routing based on improved PSRS and binary search. - Linfeng Yang; Jinbao Jian; Taoshen Li; Zhenrong Zhang (ICAIT, 2008)

A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming. - Jin-Bao Jian; Qing-Juan Xu; Dao-Lan Han (Eur. J. Oper. Res., 2008)

A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity. - Jin-Bao Jian; Xiao-yan Ke; Wei-xin Cheng (Appl. Math. Comput., 2009)

An improved SQP algorithm for solving minimax problems. - Zhibin Zhu; Xiang Cai; Jinbao Jian (Appl. Math. Lett., 2009)

A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization. - Jin-Bao Jian; Ran Quan; Wei-xin Cheng (Comput. Math. Appl., 2009)

A new norm-relaxed SQP algorithm with global convergence. - Hai-Yan Zheng; Jin-Bao Jian; Chun-Ming Tang 002; Ran Quan (Appl. Math. Lett., 2010)

Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions. - Jin-Bao Jian; Chun-Ming Tang 002; Hai-Yan Zheng (Eur. J. Oper. Res., 2010)

An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments. - Xing-De Mo; Jin-bao Jian; Su-ming Yang (Appl. Math. Comput., 2011)

Inverse problems and solution methods for a class of nonlinear complementarity problems. - Jianzhong Zhang; Jin-bao Jian; Chun-Ming Tang 002 (Comput. Optim. Appl., 2011)

A working set SQCQP algorithm with simple nonmonotone penalty parameters. - Chun-Ming Tang 002; Jin-Bao Jian; Guoyin Li 001 (J. Comput. Appl. Math., 2011)

A new ɛ-generalized projection method of strongly sub-feasible directions for inequality constrained optimization. - Jinbao Jian; Guodong Ma; Chuan-Hao Guo (J. Syst. Sci. Complex., 2011)

Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions. - Chun-Ming Tang 002; Jin-bao Jian (Eur. J. Oper. Res., 2012)

Second-order duality for non-differentiable minimax fractional programming. - Qingjie Hu; Yu Chen; Jinbao Jian (Int. J. Comput. Math., 2012)

An improved infeasible SSLE method for constrained optimization without strict complementarity. - Wei-xin Cheng; Chong-Chao Huang; Jin-Bao Jian (Comput. Oper. Res., 2013)

A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity. - Jinbao Jian; Dao-Lan Han; Qing-Juan Xu (Appl. Math. Comput., 2014)

A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems. - Jin-bao Jian; Jie Li; Hai-Yan Zheng; Jian-Ling Li (Appl. Math. Comput., 2014)

A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences. - Jin-bao Jian; Qiao-fang Chen; Zong-wen Huang (J. Comput. Appl. Math., 2014)

Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems. - Jin-Bao Jian; Qing-Juan Hu; Chun-Ming Tang 002 (J. Optim. Theory Appl., 2014)

Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems. - Jin-Bao Jian; Xing-De Mo; Li-juan Qiu; Su-ming Yang; Fusheng Wang 003 (J. Optim. Theory Appl., 2014)

A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization. - Chun-Ming Tang 002; Shuai Liu 004; Jin-Bao Jian; Jian-Ling Li (Numer. Algorithms, 2014)

A model-hybrid approach for unconstrained optimization problems. - Fusheng Wang 003; Jin-Bao Jian; Chuan-Long Wang (Numer. Algorithms, 2014)

A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization. - Jin-Bao Jian; Hua-Qin Pan; Chun-Ming Tang 002; Jian-Ling Li (Appl. Math. Comput., 2015)

A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints. - Jian-Ling Li; Renshuai Huang; Jinbao Jian (Appl. Math. Comput., 2015)

A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization. - Jin-Bao Jian; Chuan-Hao Guo; Chun-Ming Tang 002; Yan-Qin Bai (J. Comput. Appl. Math., 2015)

A deterministic method for the unit commitment problem in power systems. - Haiyan Zheng; Jinbao Jian; Linfeng Yang; Ran Quan (Comput. Oper. Res., 2016)

A new spectral conjugate gradient method for large-scale unconstrained optimization. - Jinbao Jian; Qian Chen; Xianzhen Jiang; You-Fang Zeng; Jianghua Yin (Optim. Methods Softw., 2017)

Multiple Perspective-Cuts Outer Approximation Method for Risk-Averse Operational Planning of Regional Energy Service Providers. - Linfeng Yang; Jinbao Jian; Yan Xu 005; Zhaoyang Dong; Guodong Ma (IEEE Trans. Ind. Informatics, 2017)

Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search. - Xianzhen Jiang; Jinbao Jian (J. Comput. Appl. Math., 2019)

A multi-step doubly stabilized bundle method for nonsmooth convex optimization. - Chunming Tang 002; Shuai Liu 004; Jinbao Jian; Xiaomei Ou (Appl. Math. Comput., 2020)

Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure. - Miantao Chao; Zhao Deng; Jinbao Jian (Complex., 2020)

A New Conjugate Gradient Projection Method for Convex Constrained Nonlinear Equations. - Pengjie Liu; Jinbao Jian; Xianzhen Jiang (Complex., 2020)

Monotone Splitting Sequential Quadratic Optimization Algorithm with Applications in Electric Power Systems. - Jinbao Jian; Chen Zhang; Jianghua Yin; Linfeng Yang; Guodong Ma (J. Optim. Theory Appl., 2020)

An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction. - Xianzhen Jiang; Jinbao Jian; Dan Song; Pengjie Liu (Comput. Appl. Math., 2021)

A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application. - Jinbao Jian; Pengjie Liu; Jianghua Yin; Chen Zhang; Miantao Chao (J. Comput. Appl. Math., 2021)

A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration. - Jianghua Yin; Jin-bao Jian; Xianzhen Jiang (J. Comput. Appl. Math., 2021)

A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications. - Jianghua Yin; Jinbao Jian; Xianzhen Jiang; Meixing Liu; Lingzhi Wang (Numer. Algorithms, 2021)

A new family of hybrid three-term conjugate gradient methods with applications in image restoration. - Xianzhen Jiang; Wei Liao; Jianghua Yin; Jinbao Jian (Numer. Algorithms, 2022)

A new restricted memory level bundle method for constrained convex nonsmooth optimization. - Chunming Tang 002; Yanni Li; Jinbao Jian; Haiyan Zheng (Optim. Lett., 2022)

A three-term conjugate gradient method with accelerated subspace quadratic optimization. - Jinbao Jian; Wenrui Chen; Xianzhen Jiang; Pengjie Liu (J. Appl. Math. Comput., 2022)

A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications. - Jinbao Jian; Jianghua Yin; Chunming Tang 002; Dao-Lan Han (Comput. Appl. Math., 2022)

Two classes of spectral conjugate gradient methods for unconstrained optimizations. - Jinbao Jian; Pengjie Liu; Xianzhen Jiang; Chen Zhang (J. Appl. Math. Comput., 2022)

A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration. - Jianghua Yin; Jinbao Jian; Xianzhen Jiang; Xiaodi Wu 002 (J. Comput. Appl. Math., 2023)

A hybrid Riemannian conjugate gradient method for nonconvex optimization problems. - Chunming Tang 002; Xianglin Rong; Jinbao Jian; Shajie Xing (J. Appl. Math. Comput., 2023)

A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing. - Guodong Ma; Jiachen Jin; Jinbao Jian; Jianghua Yin; Dao-Lan Han (Numer. Algorithms, 2023)

Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems. - Jinbao Jian; Guodong Ma; Pengjie Liu; Jiawei Xu (J. Comput. Appl. Math., 2023)

Two families of hybrid conjugate gradient methods with restart procedures and their applications. - Xianzhen Jiang; Huihui Yang; Jinbao Jian; Xiaodi Wu 002 (Optim. Methods Softw., 2023)

Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems. - Jinbao Jian; Qiongxuan Huang; Jianghua Yin; Wei Zhang 225 (J. Comput. Appl. Math., 2024)

A family of spectral conjugate gradient methods with strong convergence and its applications in image restoration and machine learning. - Xianzhen Jiang; Ligang Pan; Meixing Liu; Jinbao Jian (J. Frankl. Inst., 2024)

A modified inexact Levenberg-Marquardt method with the descent property for solving nonlinear equations. - Jianghua Yin; Jinbao Jian; Guodong Ma (Comput. Optim. Appl., 2024)

An effective inertial-relaxed CGPM for nonlinear monotone equations. - Jinbao Jian; Zhiwen Ren; Jianghua Yin; Dao-Lan Han; Xiaodi Wu 002 (J. Appl. Math. Comput., 2024)

A new hybrid CGPM-based algorithm for constrained nonlinear monotone equations with applications. - Guodong Ma; Liqi Liu; Jinbao Jian; Xihong Yan (J. Appl. Math. Comput., 2024)

A partial Bregman ADMM with a general relaxation factor for structured nonconvex and nonsmooth optimization. - Jianghua Yin; Chunming Tang 002; Jinbao Jian; Qiongxuan Huang (J. Glob. Optim., 2024)

An inertial spectral conjugate gradient projection method for constrained nonlinear pseudo-monotone equations. - Wenli Liu; Jinbao Jian; Jianghua Yin (Numer. Algorithms, 2024)

Household Appliance Non-Intrusive Load Monitoring Using Alternating Direction Method of Multipliers Based on Relaxation Distance and Neighborhood Search. - Wei Li; Linfeng Yang; Jinbao Jian (IEEE Trans. Consumer Electron., 2024)

Fully distributed convex hull pricing based on alternating direction method of multipliers. - Linfeng Yang; Qinghong Qin; Shifei Chen; Jinbao Jian (Comput. Oper. Res., 2025)

An efficient regularized PR splitting type algorithm for two-block nonconvex linear constrained programs in ℓ1/2 regularized compressed sensing problems. - Miantao Chao; Yongzi Lu; Jinbao Jian; Xiao Xu (J. Comput. Appl. Math., 2025)

An IDFPM-based algorithm without Lipschitz continuity to constrained nonlinear equations for sparse signal and blurred image restoration problems. - Jinbao Jian; Jiachen Jin; Guodong Ma (J. Comput. Appl. Math., 2025)

A two-step relaxed-inertial derivative-free projection based algorithm for solving standard nonlinear pseudo-monotone equations and logistic regression problems. - Wenli Liu; Jinbao Jian; Jianghua Yin (J. Comput. Appl. Math., 2025)

A Partially Feasible Jacobi-Type Distributed SQO Method for Two-Block General Linearly Constrained Smooth Optimization. - Jinbao Jian; Wenrui Chen; Chunming Tang; Jianghua Yin (J. Sci. Comput., 2025)

A Family of Inertial Three-Term CGPMs for Large-Scale Nonlinear Pseudo-Monotone Equations With Convex Constraints. - Jinbao Jian; Qiongxuan Huang; Jianghua Yin; Guodong Ma (Numer. Linear Algebra Appl., 2025)

An implementable descent method for nonsmooth multiobjective optimization on Riemannian manifolds. - Chunming Tang 002; Hao He; Jinbao Jian; Miantao Chao (Optim. Methods Softw., 2025)