摘要
This paper discusses the two-block large-scale nonconvex optimization problem with general linear constraints.Based on the ideas of splitting and sequential quadratic optimization(SQO),a new feasible descent method for the discussed problem is proposed.First,we consider the problem of quadratic optimal(QO)approximation associated with the current feasible iteration point,and we split the QO into two small-scale QOs which can be solved in parallel.Second,a feasible descent direction for the problem is obtained and a new SQO-type method is proposed,namely,splitting feasible SQO(SF-SQO)method.Moreover,under suitable conditions,we analyse the global convergence,strong convergence and rate of superlinear convergence of the SF-SQO method.Finally,preliminary numerical experiments regarding the economic dispatch of a power system are carried out,and these show that the SF-SQO method is promising.
作者
简金宝
张晨
刘鹏杰
Jinbao JIAN;Chen ZHANG;Pengjie LIU(College of Mathematics and Physics,Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis,Center for Applied Mathematics and Artificial Intelligence,Guangxi Minzu University,Nanning,530006,China;School of Mechanical Engineering,University of Shanghai for Science and Technology,Shanghai,200093,China;School of Mathematics,China University of Mining and Technology,Xuzhou,221116,China)
基金
supported by the National Natural Science Foundation of China(12171106)
the Natural Science Foundation of Guangxi Province(2020GXNSFDA238017 and 2018GXNSFFA281007)
the Shanghai Sailing Program(21YF1430300)。
