OPTIMIZATION CONDITIONS AND DECOMPOSABLE ALGORITHMS FOR CONVERTIBLE NONCONVEX OPTIMIZATION

作者：Jiang, Min; Shen, Rui^*; Meng, Zhiqing; Dang, Chuangyin

来源：Journal of Nonlinear and Variational Analysis, 2023, 7(1): 103-128.

DOI：10.23952/jnva.7.2023.1.07

• Decomposable algorithm
• Optimization conditions
• Unconstrained optimization problems
• Weak uniform convertible nonconvex function

This paper defines a convertible nonconvex CN function for short) and a weak (strong) uniform (decomposable, exact) CN function, proves the optimization conditions for their global solutions, and proposes algorithms for solving the unconstrained optimization problems with decom-posable CN functions. First, to illustrate the fact that some nonconvex functions, nonsmooth or discon-tinuous, are actually weak uniform CN functions, examples are given. The operational properties of CN functions are proved, including addition, subtraction, multiplication, division, and compound opera-tions. Second, optimization conditions of the global optimal solution to the unconstrained optimization with weak uniform CN function are proved. Based on the unconstrained optimization problem with de-composable CN functions, a decomposable algorithm is proposed by its augmented Lagrangian penalty function and its convergence is proved. Numerical results demonstrate that an approximate global op-timal solution to unconstrained optimization with CN function may be obtained by the decomposable algorithm. The decomposable algorithm can effectively reduce the scale in solving the unconstrained optimization problem with decomposable CN function. This paper provides a new idea for solving un-constrained nonconvex optimization problems.

• 单位
  浙江工业大学