Finally, prove that any global optimal solution of the converted concave minimization problem or reverse convex programming problem obtained by the existing algorithms is an approximate global optimal solution of the original problem.
详情正文
登录后查看完整内容
使用 DeepEvidence / 梅斯账号登录，新用户可在登录页面注册。
登录 / 注册登录成功后将返回当前页面，继续浏览。