School of Management Studies, Shanghai University of Engineering Science, Shanghai, China.
Business School, University of Shanghai for Science and Technology, Shanghai, China.
Technol Health Care. 2021;29(2):393-405. doi: 10.3233/THC-202656.
Many medical image processing problems can be translated into solving the optimization models. In reality, there are lots of nonconvex optimization problems in medical image processing.
In this paper, we focus on a special class of robust nonconvex optimization, namely, robust optimization where given the parameters, the objective function can be expressed as the difference of convex functions.
We present the necessary condition for optimality under general assumptions. To solve this problem, a sequential robust convex optimization algorithm is proposed.
We show that the new algorithm is globally convergent to a stationary point of the original problem under the general assumption about the uncertain set. The application of medical image enhancement is conducted and the numerical result shows its efficiency.
许多医学图像处理问题可以转化为求解优化模型。在现实中,医学图像处理中存在大量的非凸优化问题。
本文关注一类特殊的鲁棒非凸优化问题,即给定参数时目标函数可以表示为凸函数差的鲁棒优化问题。
在一般假设下,给出了最优性的必要条件。为了解决这个问题,提出了一种序贯鲁棒凸优化算法。
在不确定集的一般假设下,证明了新算法在原问题的一个稳定点上全局收敛。对医学图像增强进行了应用,数值结果表明了其有效性。