Jin-Bao Jian

发表

An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments

Xing-De Mo, Jin-Bao Jian, Su-ming Yang, 2011, Appl. Math. Comput..

A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming

Jin-Bao Jian, Qing-Juan Xu, Dao-Lan Han, 2008, Eur. J. Oper. Res..

An improved SQP algorithm for solving minimax problems

Xiang Cai, Jin-Bao Jian, Zhibin Zhu, 2009, Appl. Math. Lett..

Inverse problems and solution methods for a class of nonlinear complementarity problems

Chun-Ming Tang, Jianzhong Zhang, Jin-Bao Jian, 2011, Comput. Optim. Appl..

Superlinearly Convergent Norm-Relaxed SQP Method Based on Active Set Identification and New Line Search for Constrained Minimax Problems

Chun-Ming Tang, Jin-Bao Jian, Qing-Juan Hu, 2014, J. Optim. Theory Appl..

A new finitely convergent algorithm for systems of nonlinear inequalities

Ran Quan, Jin-Bao Jian, Xue-Lu Zhang, 2007, Appl. Math. Lett..

A deterministic method for the unit commitment problem in power systems

Ran Quan, Linfeng Yang, Jin-Bao Jian, 2016, Comput. Oper. Res..

A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems

Jie Li, Jin-Bao Jian, Hai-Yan Zheng, 2014, Appl. Math. Comput..

Multiple Perspective-Cuts Outer Approximation Method for Risk-Averse Operational Planning of Regional Energy Service Providers

Zhao Yang Dong, Yan Xu, Linfeng Yang, 2017, IEEE Transactions on Industrial Informatics.

Simple Sequential Quadratically Constrained Quadratic Programming Feasible Algorithm with Active Identification Sets for Constrained Minimax Problems

Fusheng Wang, Xing-De Mo, Jin-Bao Jian, 2014, J. Optim. Theory Appl..

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, 2006, Appl. Math. Comput..

Finitely Convergent Algorithms of Generalized Gradient Projection for Systems of Nonlinear Inequalities

Jin-Bao Jian, Yu-mei Liang, 2004, Neural Parallel Sci. Comput..

A new ɛ-generalized projection method of strongly sub-feasible directions for inequality constrained optimization

Chuan-Hao Guo, Jin-Bao Jian, Guodong Ma, 2011, J. Syst. Sci. Complex..

A Combined Feasible-Infeasible Point Continuation Method for Strongly Monotone Variational Inequality Problems

Jin-Bao Jian, 1999, J. Glob. Optim..

Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions

Chun-Ming Tang, Jin-Bao Jian, Hai-Yan Zheng, 2010, Eur. J. Oper. Res..

A New Conjugate Gradient Projection Method for Convex Constrained Nonlinear Equations

Jin-Bao Jian, Pengjie Liu, Xianzhen Jiang, 2020, Complex..

A multi-step doubly stabilized bundle method for nonsmooth convex optimization

Shuai Liu, Jin-Bao Jian, Xiaomei Ou, 2020, Appl. Math. Comput..

A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints

Jin-Bao Jian, Jian-Ling Li, Renshuai Huang, 2015, Appl. Math. Comput..

A working set SQCQP algorithm with simple nonmonotone penalty parameters

Guoyin Li, Chun-Ming Tang, Jin-Bao Jian, 2011, J. Comput. Appl. Math..

A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints

Jin-Bao Jian, 2005, Comput. Optim. Appl..

A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization

Chun-Ming Tang, Chuan-Hao Guo, Yan-Qin Bai, 2015, J. Comput. Appl. Math..

A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

Chun-Ming Tang, Jin-Bao Jian, Hai-Yan Zheng, 2006, Appl. Math. Comput..

A model-hybrid approach for unconstrained optimization problems

Fusheng Wang, Jin-Bao Jian, Chuan-Long Wang, 2013, Numerical Algorithms.

A new spectral conjugate gradient method for large-scale unconstrained optimization

Qian Chen, Jin-Bao Jian, Jianghua Yin, 2017, Optim. Methods Softw..

A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity

Jin-Bao Jian, Qing-Juan Xu, Dao-Lan Han, 2014, Appl. Math. Comput..

A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences

Jin-Bao Jian, Qiao-fang Chen, Zong-wen Huang, 2014, J. Comput. Appl. Math..

Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search

Jin-Bao Jian, Xianzhen Jiang, 2019, J. Comput. Appl. Math..

An improved infeasible SSLE method for constrained optimization without strict complementarity

Jin-Bao Jian, Chongchao Huang, Wei-xin Cheng, 2013, Comput. Oper. Res..

An improved SQP algorithm for inequality constrained optimization

Jin-Bao Jian, Kecun Zhang, Zhibin Zhu, 2003, Math. Methods Oper. Res..

A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization

Chun-Ming Tang, Jin-Bao Jian, Jian-Ling Li, 2015, Appl. Math. Comput..

A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity

Jin-Bao Jian, Wei-xin Cheng, Xiao-yan Ke, 2009, Appl. Math. Comput..

Second-order duality for non-differentiable minimax fractional programming

Yu Chen, Jin-Bao Jian, Qingjie Hu, 2012, Int. J. Comput. Math..

A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization

Chun-Ming Tang, Shuai Liu, Jin-Bao Jian, 2012, Numerical Algorithms.

Convergence of Linear Bregman ADMM for Nonconvex and Nonsmooth Problems with Nonseparable Structure

Jin-Bao Jian, Miantao Chao, Zhao Deng, 2020, Complex..

A novel projected two-binary-variable formulation for unit commitmentin power systems

Yan Xu, Zhao Yang Dong, Ke Meng, 2017 .

A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity

Jin-Bao Jian, 2005, Appl. Math. Comput..

Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions

Chun-Ming Tang, Jin-Bao Jian, J. Jian, 2012, Eur. J. Oper. Res..

A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

Chun-Ming Tang, Jin-Bao Jian, Hai-Yan Zheng, 2005, Appl. Math. Comput..

A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints

Jin-Bao Jian, Jian-Ling Li, 2005, J. Glob. Optim..

Explicit and Implicit Continuation Algorithms for Strongly Monotone Variational Inequalities with Box Constraints

Xing-De Mo, Jin-Bao Jian, Jian-Ling Li, 2004, J. Glob. Optim..

A new norm-relaxed SQP algorithm with global convergence

Ran Quan, Jin-Bao Jian, Hai-Yan Zheng, 2010, Appl. Math. Lett..

A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization

Chun-Ming Tang, Jin-Bao Jian, You-Fang Zeng, 2007, Comput. Math. Appl..