Author(s)

Qian Liu

Corresponding Author

Qian Liu

Abstract

The development of modern information technology has prompted graphic image-like signal problems to place higher demands on the information processing efficiency of various types of equipment. Such practical application problems can be further transformed into optimization problems for solving convex functions. Therefore, it is especially important to design a more efficient algorithm. Based on this, this paper makes an in-depth study on the neighboring point algorithm for solving convex function optimization problems, hoping to provide reference and reference for solving convex function optimization problems.

Keywords

Convex function; optimization; neighbor algorithm; convergence