Ran Quan

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

Generalized monotone line search SQP algorithm for constrained minimax problems

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

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

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

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 priority list and neighborhood search method for unit commitment

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

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

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