Indexed by:Journal Papers

Date of Publication:2015-09-01

Journal:JOURNAL OF GLOBAL OPTIMIZATION

Included Journals:SCIE、EI、Scopus

Volume:63

Issue:1

Page Number:61-76

ISSN No.:0925-5001

Key Words:Homotopy method; Global convergence; Penalty function; Nonlinear semidefinite programming

Abstract:This paper proposes a homotopy method based on a penalty function for solving nonlinear semidefinite programming problems. The penalty function is the composite function of an exponential penalty function, the eigenvalue function and a nonlinear operator mapping. Representations of its first and second order derivatives are given. Using the penalty function, a new homotopy is constructed. Global convergence of a smooth curve determined by the homotopy is proven under mild conditions. In the process of numerically tracing the curve, the method requires just the solution of a linear system of dimension , whereas a homotopy method proposed by Yang and Yu (Comput Optim Appl 56(1):81-96, 2013) requires a system of dimension to be solved, where is the number of variables while is the order of constraint matrix. So, it is expected that the proposed method can improve the efficiency of the method proposed by Yang and Yu. Preliminary numerical experiments are presented and show that the considered algorithm is efficient for some nonlinear semidefinite programming problems.