Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Chongqing University of Technology(Natural Science)》 2017-08
Add to Favorite Get Latest Update

Summary of the Method of Convex Optimization Problem on the Objective Function with the Linear Constraints Block Divided

ZENG Qin;School of Mathematics,Chongqing Normal University;  
The convexity minimum problem with a linear constraints and a block separable objective function is always studied. As you can see from this article,the objective function which is composed of two or three insufficiently smooth convex functions is firstly studied to promote the objective function composed of n insufficiently smooth convex functions. The solution to the model is based on the classic alternating direction method. Therefore,it stretches out a lot of kinds of methods to solve the model.The article summarizes the common methods,and then it puts forward a new method: a new ADMM method based on separation process,and it simultaneously indicates the method's feasibility.
【Fund】: 国家自然科学基金资助项目(11501070);; 重庆市自然科学基金资助项目(cstc2015jcyj A00011)
【CateGory Index】: O224
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved