This paper defines a convertible nonconvex function(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 the decomposable CN function. First, to illustrate the fact that some nonconvex functions, nonsmooth or discontinuous, are actually weak uniform CN functions, examples are given. The operational properties of the CN functions are proved, including addition, subtraction, multiplication, division and compound operations. Second, optimization conditions of the global optimal solution to unconstrained optimization with a weak uniform CN function are proved. Based on the unconstrained optimization problem with the decomposable CN function, a decomposable algorithm is proposed by its augmented Lagrangian penalty function and its convergence is proved. Numerical results show that an approximate global optimal solution to unconstrained optimization with a CN function may be obtained by the decomposable algorithms. The decomposable algorithm can effectively reduce the scale in solving the unconstrained optimization problem with the decomposable CN function. This paper provides a new idea for solving unconstrained nonconvex optimization problems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.