J. Jian

发表

Solution for short-term hydrothermal scheduling with a logarithmic size MILP formulation

J. Jian, Shanshan Pan, Linfeng Yang, 2018 .

Tighter relaxation method for unit commitment based on second-order cone programming and valid inequalities

J. Jian, R. Quan, Yundong Mu, 2014 .

A hybrid MILP and IPM approach for dynamic economic dispatch with valve-point effects

J. Jian, Shanshan Pan, Linfeng Yang, 2017, 1703.03685.

A sequential quadratically constrained quadratic programming method for unconstrained minimax problems

Jin-Bao Jian, J. Jian, M. Chao, 2010 .

New active set identification for general constrained optimization and minimax problems

Yi Liu, Jinbao Jian, Zhibin Zhu, 2015 .

A Novel Projected Two Binary Variables Formulation for Unit Commitment Problem

J. Jian, Linfeng Yang, K. Meng, 2016, 1606.05710.

Tight Relaxation Method for Unit Commitment Problem Using Reformulation and Lift-and-Project

J. Jian, Linfeng Yang, Z. Dong, 2015, IEEE Transactions on Power Systems.

Global Optimization of Non-Convex Hydro-Thermal Coordination Based on Semidefinite Programming

Jiekang Wu, Yunan Zhu, Linfeng Yang, 2013, IEEE Transactions on Power Systems.

A two-stage method with mixed integer quadratic programming for unit commitment with ramp constraints

Ran Quan, Linfeng Yang, Jinbao Jian, 2008, 2008 IEEE International Conference on Industrial Engineering and Engineering Management.

Outer Approximation and Outer-Inner Approximation Approaches for Unit Commitment Problem

J. Jian, Linfeng Yang, Dao-Lan Han, 2014, IEEE Transactions on Power Systems.

A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems

Qing-Juan Xu, Jin-Bao Jian, J. Jian, 2013 .

A New QP-free Algorithm Without a Penalty Function or a Filter for Nonlinear Semidefinite Programming

J. Jian, Jianling Li, Zhenping Yang, 2020 .

A globally convergent QP-free algorithm for nonlinear semidefinite programming

J. Jian, Jianling Li, Zhenping Yang, 2017, Journal of inequalities and applications.

A nonmonotonic hybrid algorithm for min-max problem

J. Jian, Fusheng Wang, 2014 .

A quadratically approximate framework for constrained optimization, global and local convergence

J. Jian, 2008 .

An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity

Chun-Ming Tang, Jin-Bao Jian, J. Jian, 2005 .

A new feasible descent primal–dual interior point algorithm for nonlinear inequality constrained optimization

J. Jian, H. Pan, 2010 .

Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints

J. Jian, R. Quan, Xue-Lu Zhang, 2007 .

Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization

J. Jian, Xianzhen Jiang, 2014 .

An ADMM-based SQP method for separably smooth nonconvex optimization

J. Jian, M. Liu, 2020 .

An improved priority list and neighborhood search method for unit commitment

Ran Quan, Linfeng Yang, Jin-Bao Jian, 2015 .

A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function

J. Jian, Chunming Tang, 2008 .

A Feasible Point Method with Bundle Modification for Nonsmooth Convex Constrained Optimization

J. Jian, Chunming Tang, Lu Shi, 2018 .

Some properties of semi-E-preinvex maps in Banach spaces

J. Jian, Zhiming Luo, 2011 .

A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization

J. Jian, W. Cheng, 2009 .

A New Smoothing Method Based on Nonsmooth FB Function for Second-Order Cone Programming

J. Jian, Chunming Tang, You-Fang Zeng, 2012 .

Two new predictor-corrector algorithms for second-order cone programming

Yanqin Bai, J. Jian, Chunming Tang, 2011 .

A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization

Chun-Ming Tang, Hai-Yan Zheng, Jin-Bao Jian, 2008 .

An SQP algorithm for mathematical programs with nonlinear complementarity constraints

Jin-Bao Jian, J. Jian, Zhibin Zhu, 2009 .

A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem

J. Jian, Fusheng Wang, 2014 .

A primal-dual interior point QP-free algorithm with working set for general constrained optimization I

J. Jian, H. Pan, Han-qin Zeng, 2012 .

On the accurate identification of active set for constrained minimax problems

J. Jian, Dao-Lan Han, Jie Li, 2011 .

A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization

J. Jian, Yi Liu, 2011 .

A proximal-projection partial bundle method for convex constrained minimax problems

Guoyin Li, Chunming Tang, Jin-Bao Jian, 2019, Journal of Industrial & Management Optimization.

A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization

J. Jian, Chunming Tang, Dao-Lan Han, 2020, Optimization.

A QP-Free Algorithm for Finite Minimax Problems

J. Jian, Dao-Lan Han, Qinfeng Zhang, 2014 .

A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization

J. Jian, Dao-Lan Han, Q. Xu, 2010 .

An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems

J. Jian, Chunming Tang, Jinman Lv, 2018 .

An improved partial bundle method for linearly constrained minimax problems

J. Jian, Chunming Tang, Huangyue Chen, 2016 .

Convergence of Bregman Peaceman–Rachford Splitting Method for Nonconvex Nonseparable Optimization

J. Jian, Xianzhen Jiang, Pengjie Liu, 2022, Journal of the Operations Research Society of China.

An ε-generalized gradient projection method for nonlinear minimax problems

J. Jian, G. Ma, 2014 .

Finitely convergent ε-generalized projection algorithm for nonlinear systems ✩

J. Jian, W. Cheng, Xiaohong Ke, 2007 .

New Sequential Quadratically-Constrained Quadratic Programming Method of Feasible Directions and Its Convergence Rate

J. Jian, 2006 .

A Novel Distributed Dynamic Economic Dispatch Based on Dual ADMM and IPM

J. Jian, Linfeng Yang, 2020 .

A Globally Convergent QP-Free Algorithm for Inequality Constrained Minimax Optimization

J. Jian, G. Ma, 2020 .

A hybrid Riemannian conjugate gradient method for nonconvex optimization problems

J. Jian, Chunming Tang, Xianglin Rong, 2022, Journal of Applied Mathematics and Computing.

A Superlinearly Convergent Splitting Feasible Sequential Quadratic Optimization Method for Two-Block Large-Scale Smooth Optimization

J. Jian, Chen Zhang, Pengjie Liu, 2022, Acta Mathematica Scientia.

A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization

J. Jian, G. Ma, 2014 .

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

J. Jian, Lisha Qiu, Xing-De Mo, 2013, Journal of Optimization Theory and Applications.

A New QP-free Algorithm Without a Penalty Function or a Filter for Nonlinear Semidefinite Programming

J. Jian, Jianling Li, Zhenping Yang, 2020, Acta Mathematicae Applicatae Sinica, English Series.

A model-hybrid approach for unconstrained optimization problems

Chuan-Long Wang, J. Jian, Fusheng Wang, 2014, Numerical Algorithms.

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

J. Jian, Chunming Tang, Qing-Juan Hu, 2013, Journal of Optimization Theory and Applications.

A sufficient descent Dai–Yuan type nonlinear conjugate gradient method for unconstrained optimization problems

J. Jian, Xianzhen Jiang, 2012, Nonlinear Dynamics.

A Feasible Point Method with Bundle Modification for Nonsmooth Convex Constrained Optimization

J. Jian, Chunming Tang, Lu Shi, 2018, Acta Mathematicae Applicatae Sinica, English Series.

A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization

Ran Quan, Wei-xin Cheng, Jin-bao Jian, 2009, Comput. Math. Appl..

An efficient feasible SQP algorithm for inequality constrained optimization

Zhibin Zhu, Jin-Bao Jian, J. Jian, 2009 .

A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization

Chun-Ming Tang, Hai-Yan Zheng, Jin-Bao Jian, 2009 .

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..

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 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..

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..

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 Bregman-style Partially Symmetric Alternating Direction Method of Multipliers for Nonconvex Multi-block Optimization

J. Jian, Peng Liu, G. Ma, 2023, Acta Mathematicae Applicatae Sinica, English Series.

A new restricted memory level bundle method for constrained convex nonsmooth optimization

J. Jian, Chunming Tang, Hai-Yan Zheng, 2022, Optimization Letters.

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

Shuai Liu, Jin-Bao Jian, Xiaomei Ou, 2020, 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 descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds

J. Jian, Chunming Tang, M. Chao, 2023, 2304.11990.

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

J. Jian, Chunming Tang, Jianling Li, 2012, Numerical Algorithms.

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..

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..

An improved infeasible SSLE method for constrained optimization without strict complementarity

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

Generalized monotone line search SQP algorithm for constrained minimax problems

Ran Quan, Xue-Lu Zhang, Jin-Bao Jian, 2009 .

A New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems

Ran Quan, Jin-Bao Jian, J. Jian, 2007 .

Generalised monotone line search algorithm for degenerate nonlinear minimax problems

Ran Quan, Xue-Lu Zhang, Jin-Bao Jian, 2006, Bulletin of the Australian Mathematical Society.

An improved SQP algorithm for inequality constrained optimization

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

A Novel Distributed Dynamic Economic Dispatch Based on Dual ADMM and IPM

Wei Li, Linfeng Yang, Jinbao Jian, 2020, IEEJ Transactions on Electrical and Electronic Engineering.

An improved Polak–Ribière–Polyak conjugate gradient method with an efficient restart direction

J. Jian, Xianzhen Jiang, Pengjie Liu, 2021, Computational and Applied Mathematics.

A full mixed-integer linear programming formulation for economic dispatch with valve-point effects, transmission loss and prohibited operating zones

Linfeng Yang, Jinbao Jian, Shanshan Pan, 2020 .

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 Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems

Yan-Qin Bai, Chuan-Hao Guo, Jin-Bao Jian, 2012, 1206.3359.

A New Conjugate Gradient Projection Method for Convex Constrained Nonlinear Equations

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

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

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

A hierarchical alternating direction method of multipliers for fully distributed unit commitment

Chen Zhang, Linfeng Yang, Jinbao Jian, 2019, International Journal of Electrical Power & Energy Systems.

Solution to dynamic economic dispatch with prohibited operating zones via MILP.

Linfeng Yang, Jinbao Jian, Shanshan Pan, 2017, Mathematical biosciences and engineering : MBE.

A Mixed Integer Linear Programming Method for Dynamic Economic Dispatch with Valve Point Effect

Linfeng Yang, Jinbao Jian, Shanshan Pan, 2017, 1702.04937.

Projected mixed integer programming formulations for unit commitment problem

Linfeng Yang, Jinbao Jian, Yuanyuan Wang, 2015 .

A globally convergent QP-free algorithm for nonlinear semidefinite programming

J. Jian, Jianling Li, Zhenping Yang, 2017, Journal of inequalities and applications.

A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization

J. Jian, Chunming Tang, Meixing Liu, 2020, Optimization.

A working set SQCQP algorithm with simple nonmonotone penalty parameters

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

A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions

Chun-Ming Tang, Hai-Yan Zheng, Jin-Bao Jian, 2007 .

An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems

J. Jian, Chunming Tang, Jinman Lv, 2018 .

Solution for short-term hydrothermal scheduling with a logarithmic size mixed-integer linear programming formulation

Linfeng Yang, Jinbao Jian, Shanshan Pan, 2019, Energy.

An inertial proximal alternating direction method of multipliers for nonconvex optimization

M. T. Chao, Y. Zhang, J. B. Jian, 2020, Int. J. Comput. Math..

Convergence analysis of an improved Bregman-type Peaceman-Rachford splitting algorithm for nonconvex nonseparable linearly constrained optimization problems

J. Jian, G. Ma, Pengjie Liu, 2023, Journal of Computational and Applied Mathematics.

Monotone Splitting Sequential Quadratic Optimization Algorithm with Applications in Electric Power Systems

Chen Zhang, Linfeng Yang, Guodong Ma, 2020, J. Optim. Theory Appl..

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

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

A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application

Miantao Chao, Jianghua Yin, Pengjie Liu, 2021, J. Comput. Appl. Math..

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, 2013, Journal of Optimization Theory and Applications.

An improved SQP algorithm for solving minimax problems

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

A parallel method for solving the DC security constrained optimal power flow with demand uncertainties

Chen Zhang, Linfeng Yang, Jinbao Jian, 2018, International Journal of Electrical Power & Energy Systems.

Primal-dual interior point QP-free algorithm for nonlinear constrained optimization

J. Jian, Zhibin Zhu, Han-qin Zeng, 2017, Journal of Inequalities and Applications.

A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications

Jinbao Jian, Meixing Liu, Jianghua Yin, 2021, Numer. Algorithms.

Two classes of spectral conjugate gradient methods for unconstrained optimizations

J. Jian, Chen Zhang, Xianzhen Jiang, 2022, Journal of Applied Mathematics and Computing.

Regularised primal–dual interior‐point method for dynamic optimal power flow with block‐angular structures

Jin Jian, Chen Zhang, L. Yang, 2020 .

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

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

A hybrid conjugate gradient method with descent property for unconstrained optimization

Jinbao Jian, Xianzhen Jiang, J. Jian, 2015 .

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

A regularized alternating direction method of multipliers for a class of nonconvex problems

Ye Zhang, J. Jian, M. Chao, 2019, Journal of Inequalities and Applications.

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 simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization

J. Jian, Chunming Tang, Suhua Yang, 2013 .

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

J. Jian, Chunming Tang, Hai-Yan Zheng, 2010, Eur. J. Oper. Res..

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 Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

Xing-De Mo, Jian-Ling Li, Jin-Bao Jian, 2006 .

A feasible descent SQP algorithm for general constrained optimization without strict complementarity

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

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

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

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

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