A Conic Algorithm for the Group Minimization Problem
收藏NBER1976-12-01 更新2025-01-04 收录
下载链接：
https://www.nber.org/papers/w0159
下载链接
链接失效反馈官方服务：
资源简介：
A new algorithm for the group minimization problem (GP) is proposed. The algorithm can be broadly described as follows. A suitable relaxation of(GP) is defined, in which any feasible point satisfies the group equation but may have negative components. The feasible points of the relaxation are then
提供机构：
美国国家经济研究局
创建时间：
1976-12-01
