öλÔÓéÀֵǼÈë¿ÚÏÂÔØ

µ¼Ê¦ÐÕÃû£º¹ù´«ºÃ
ÐÔ±ð£ºÄÐ
ÈËÆøÖ¸Êý£º404

ËùÊôԺУ£ºÕã½­Àí¹¤´óѧ
ËùÊôԺϵ£º¾­¼Ã¹ÜÀíѧԺ
Ö°³Æ£º½²Ê¦
µ¼Ê¦ÀàÐÍ£º
ÕÐÉúöλÔÓéÀֵǼÈë¿ÚÏÂÔØ£º¹ÜÀí¿ÆѧÓ빤³Ì
Ñо¿ÁìÓò£º ׶¹æ»®Ëã·¨ÀíÂÛÓëÓ¦ÓÃ,·ÇÏßÐԹ滮ÀíÂÛÓëËã·¨,¹©Ó¦Á´¹ÜÀíÓëÓÅ»¯µÈ
Ñо¿ÁìÓò£º ׶¹æ»®Ëã·¨ÀíÂÛÓëÓ¦ÓÃ,·ÇÏßÐԹ滮ÀíÂÛÓëËã·¨,¹©Ó¦Á´¹ÜÀíÓëÓÅ»¯µÈ [ÊÕÆð]




ͨѶ·½Ê½ :
°ì¹«µç»°£º**
ͨѶµØÖ·£ºÕã½­Ê¡º¼ÖÝÊн­¸ÉÇøÏÂɳ¸ß½ÌÔ°Çø2ºÅ´ó½Ö928ºÅÕã½­Àí¹¤´óѧ¾­¼Ã¹ÜÀíѧԺ7ºÅÂ¥518-1ÊÒ


¸öÈ˼òÊö :
±¾ÈËÖ÷Òª´ÓʹÜÀí¿ÆѧÓ빤³ÌÖÐÔ˳ïѧ·½ÃæµÄÑо¿£¬ÔÚ׶¹æ»®Ëã·¨ÀíÂÛÓëÓ¦ÓÃ,·ÇÏßÐԹ滮ÀíÂÛÓëËã·¨,¹©Ó¦Á´¹ÜÀíÓëÓÅ»¯µÈ·½Ãæ×öÁËһϵÁеÄÑо¿¹¤×÷¡£Ö÷³ÖºÍ²Î¼Ó¹ú¼Ò×ÔÈ»¿Æѧ»ù½ð¡¢ÉϺ£ÊÐ×ÔÈ»¿Æѧ»ù½ðµÈÏîÄ¿¶àÏî¡£ÔÚJIMO,PJO,JMAAµÈ¹úÄÚÍâÖøÃûÆÚ¿¯·¢±íѧÊõÂÛÎĶàƪ¡£Ä¿Ç°µ£ÈÎÆÚ¿¯JIMO,JORS,EJOR,JORSC,¡¶Ô˳ïÓëÄ£ºýѧ¡·µÄÉó¸åÈË£¬ÃÀ¹ú¡¶ÊýѧÆÀÂÛ¡·ÆÀÂÛÔ±£¨2014---ÖÁ½ñ).


¿ÆÑй¤×÷ :
¿ÆÑÐÏîÄ¿

7¡¢¹ú¼Ò×ÔÈ»¿Æѧ»ù½ð: ЭÕý¹æ»®ÀíÂÛÓëËã·¨Ñо¿, ±àºÅ: **, ʱ¼ä: 2016.01---2018.12, Ö÷³Ö.

6¡¢¹ú¼Ò×ÔÈ»¿Æѧ»ù½ð:Ï¡ÊèÐźÅÇý¶¯µÄʱ¼äÐòÁÐÐźÅä·ÖÀëÓÅ»¯Ä£Ðͼ°Ëã·¨Ñо¿, ±àºÅ: **, ʱ¼ä: 2016.01---2018.12,²ÎÓë.

5¡¢¹ú¼Ò×ÔÈ»¿Æѧ»ù½ð:Эµ÷²úÆ·Ñз¢Ó빩ӦµÄ¶àÑù»¯Õ½ÂÔ¾ö²ß¼°ÓÅ»¯Ñо¿, ±àºÅ: **, ʱ¼ä: 2016.01---2019.12,²ÎÓë.

4¡¢¹ú¼Ò×ÔÈ»¿Æѧ»ù½ð: ·Ç¶Ô³Æ׶ÓÅ»¯ÀíÂÛÓëÄÚµãËã·¨¼°ÆäÓ¦ÓÃÑо¿, ±àºÅ: **, ʱ¼ä: 2014.01---2017.12,²ÎÓë.

3¡¢¹ú¼Ò×ÔÈ»¿Æѧ»ù½ð: Ò»Àà·ÖƬ¹â»¬·Ö²¼²ÎÊýϵͳµÄ²ÎÊý±æʶ¼°ÆäÓ¦ÓÃ, ±àºÅ: **, ʱ¼ä: 2012.01---2014.12,²ÎÓë.

2¡¢ÉϺ£ÊÐ×ÔÈ»¿Æѧ»ù½ð: ¶àÏîʽ×îÓÅ»¯ÎÊÌâµÄ½üËÆËã·¨Ñо¿, ±àºÅ: 12ZR**, ʱ¼ä: 2012.07---2015.06,²ÎÓë.

1¡¢¹ãÎ÷×ÔÈ»¿Æѧ»ù½ð: Ô¼Êø×îÓÅ»¯ÐÂÐÍÄÚµãËã·¨¼°ÆäÔÚ×îÓų±Á÷ÖеÄÓ¦ÓÃ, ±àºÅ: **, ʱ¼ä: 2008.05---2011.05,²ÎÓë.
·¢±íÂÛÎÄ

13¡¢¹ù´«ºÃ, ³Â·¼, µ¥¶ø·¼. ¶ÌÉúÃüÖÜÆÚÈéÖÆÆ·¹©Ó¦Á´ÍøÂç³É±¾ÓëÊÕÒæÓÅ»¯Ñо¿, Öйú¹ÜÀí¿Æѧ, 25(2):76-86,2017.

12¡¢¹ù´«ºÃ, ÑÏÎÄÀö, µ¥¶ø·¼. A new superlinearly convergent hybrid algorithm for solving nonlinear programming, Journal of Industrial and Management Optimization,13(2):1009-1024,2017(SCI).

11¡¢³Â·¼, µ¥¶ø·¼, ¹ù´«ºÃ. Æ¥ÅäÀíÂÛÏÂÈéÖÆÆ·¹©Ó¦Á´ÍøÂçÉè¼ÆÓë³É±¾ÓÅ»¯Ñо¿, Öйú¹ÜÀí¿Æѧ, 23(S1):610-616,2015.

10¡¢¹ù´«ºÃ, µ¥¶ø·¼. ³íÃÜK-×ÓͼÎÊÌâµÄË«·Ç¸ºËɳÚ, Ô˳ïÓë¹ÜÀí, 24(5): 144-150, 2015.

9¡¢¼ò½ð±¦, ¹ù´«ºÃ, ÌÆ´ºÃ÷, °×ÑÓÇÙ. A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization. Journal of Computational and Applied Mathematics, 273(1): 88-102, 2015(SCI,EI).

8¡¢°×ÑÓÇÙ, ¹ù´«ºÃ. Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems. Journal of Industrial and Management Optimization, 10(2):543-556,2014(SCI).

7¡¢¹ù´«ºÃ, °×ÑÓÇÙ, ¼ò½ð±¦. An Improved Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems. Journal of Mathematical Analysis and Applications, 409(2): 777-789, 2014(SCI).

6¡¢°×ÑÓÇÙ, ¹ù´«ºÃ, ËïÀûÃ÷. A New Algorithm for Solving Nonconvex Quadratic Programming over an Ice Cream Cone, Pacific Journal of Optimization, 8(4), 651-665, 2012(SCI).

5¡¢¼ò½ð±¦,³ÂÔ½»ª, ¹ù´«ºÃ.A Strongly Convergent Method of Quasi-Strongly Sub-Feasible Directions for Constrained Optimization, Pacific Journal of Optimization, 7(2), 339-351, 2011(SCI).

4¡¢¼ò½ð±¦,Âí¹ú¶°, ¹ù´«ºÃ. A New¦Å-Generalized Projection Method of Strongly Sub-Feasible Directions for Inequality Constrained Optimization, Journal of Systems Science and Complexity, 24(3), 604-618, 2011(SCI,EI).

3¡¢¼ò½ð±¦, ¹ù´«ºÃ, ÑîÁÖ·å. A New Generalized Projection Method of Strongly Sub-Feasible Directions for General Constrained Optimization, Pacific Journal of Optimization, 5(3), 507-523, 2009(SCI).

2¡¢¼ò½ð±¦, ¹ù´«ºÃ, ³ÂÔ½»ª. ·ÇÏßÐÔÔ¼ÊøÓÅ»¯Ò»¸öÇ¿ÊÕÁ²µÄ¹ãÒåͶӰǿ´Î¿ÉÐз½Ïò·¨, ¸ßУӦÓÃÊýѧѧ±¨A¼­, 24(2), 194-200, 2009.

1¡¢Àî½Ü, ¼ò½ð±¦, ¹ù´«ºÃ, Âí¹ú¶°. A Strongly Convergent Algorithm of Strongly Sub-Feasible Directions for Minimax Problems with Inequality Constraints, ÖйúÔ˳ïѧ»áµÚ¾Å½ìѧÊõ½»Á÷»áÂÛÎļ¯, ÖйúÔ˳ïѧ»áµÚ¾Å½ìѧÊõ½»Á÷»á, ÄϾ©, Ò³Âë: 137-142, 2008.
´ó»á±¨¸æ

6¡¢µÚ¶þ½ìÉϺ£´óѧ²©Ê¿ºóÂÛ̳, ÉϺ£´óѧ, ÉϺ£, 2015.12.15---2015.12.16, ·ÖÂÛ̳Ö÷³ÖÈË,±¨¸æÌâÄ¿: ¶ÌÉúÃüÖÜÆÚÈéÖÆÆ·¹©Ó¦Á´ÍøÂçÉè¼ÆÓëÓÅ»¯Ñо¿

5¡¢µÚÊ®Æß½ìÖйú¹ÜÀí¿ÆѧѧÊõÄê»á, ÄÚÃɹŹ¤Òµ´óѧ,ºôºÍºÆÌØ, ÄÚÃɹÅ, 2015.07.31----2015.08.02,±¨¸æÌâÄ¿: ¶ÌÉúÃüÖÜÆÚÈéÖÆÆ·¹©Ó¦Á´ÍøÂçÉè¼ÆÓëÓÅ»¯Ñо¿

4¡¢µÚÒ»½ìÉϺ£´óѧ²©Ê¿ºóѧÊõÂÛ̳, ÉϺ£´óѧ, ÉϺ£, 2014.12.22---2014.12.23,±¨¸æÌâÄ¿: ̼˰Çé¿öϹ˿ÍÐèÇó²»È·¶¨µÄ¹©Ó¦Á´ÓÅ»¯Ñо¿

3¡¢µÚÊ®½ìÈ«¹úÊýѧ¹æ»®Ñ§Êõ»áÒé•ÌÊýѧ¹æ»®·Ö»á´ú±í´ó»á, ºÓÄϿƼ¼´óѧ, ÂåÑô, ºÓÄÏ, 2014.05.09¡ª2014.05.12, ±¨¸æÌâÄ¿: An Improved SQP Algorithm for Solving Constrained Optimization Problems

2¡¢Ô˳ïѧÓë¼ÆËãÊýѧǰÑØÎÊÌâÑÐÌÖ»áôßÉϺ£ÊÐÑо¿ÉúѧÊõÂÛ̳, ÉϺ£²Æ¾­´óѧ, ÉϺ£, 2013.10.19---2013.10.20, ±¨¸æÌâÄ¿: An Improved Sequential Quadratic Programming Algorithm for Solving General Nonlinear Programming Problems

1¡¢Ô˳ïѧÇàÄêѧÕßÓ벩ʿÉúѧÊõÂÛ̳ôßÓÅÐãÓ¦Óð¸Àý±¨¸æ»á, »ª¶«Àí¹¤´óѧ, ÉϺ£, 2013.06.15, ±¨¸æÌâÄ¿: Doubly Nonnegative Relaxation Method for Solving Multiple Objective Quadratic Programming Problems.
»ñ½±Çé¿ö

4¡¢2014.12.22 µÚÒ»½ìÉϺ£´óѧ²©Ê¿ºóѧÊõÂÛ̳ÓÅÐãÂÛÎÄÒ»µÈ½±

3¡¢2013.10.20 ÉϺ£ÊÐÑо¿ÉúѧÊõÂÛ̳ÓÅÐãÂÛÎÄÒ»µÈ½±

2¡¢2013.06.15 ÉϺ£ÊÐÔ˳ïѧÇàÄêѧÕßÓ벩ʿÉúÂÛ̳ÓÅÐãÂÛÎÄÈýµÈ½±

1¡¢2009Äê¹ãÎ÷ÆÕͨ¸ßµÈѧУÕÐÉúöλÔÓéÀֵǼÈë¿ÚÏÂÔØÆÀ¾í¹¤×÷ÏȽø¸öÈË
²©Ê¿ºó(ÉϺ£´óѧ¹ÜÀíѧԺ)ÆÚ¼äЭÖúÅàÑøµÄ˶ʿÑо¿Éú

2¡¢³Â·¼, 2017Äê6Ô±ÏÒµ, ÏÖ¹¤×÷ÓÚ¹úÒ©¼¯ÍÅÒ½Ò©ÎïÁ÷ÓÐÏÞ¹«Ë¾, ÐÅÏ¢Ó빩ӦÁ´·þÎñ²¿, Èμ¼ÊõÔ±.1¡¢Íõä¸, 2016Äê6Ô±ÏÒµ, ÏÖ¹¤×÷ÓÚ»ªÈó»õÔË(ÉϺ£)ÓÐÏÞ¹«Ë¾, Êг¡¿ª·¢²¿, Èμ¼ÊõÔ±.