A class of nonlinear Lagrangians for nonconvex second order cone programming

  • Authors:

  • Liwei Zhang;Jian Gu;Xiantao Xiao

  • Affiliations:

  • School of Mathematical Sciences, Dalian University of Technology, Dalian, China 116024;School of Science, Dalian Fisheries University, Dalian, China 116023;School of Mathematical Sciences, Dalian University of Technology, Dalian, China 116024

  • Venue:
  • Computational Optimization and Applications
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper focuses on the study of a class of nonlinear Lagrangians for solving nonconvex second order cone programming problems. The nonlinear Lagrangians are generated by Löwner operators associated with convex real-valued functions. A set of conditions on the convex real-valued functions are proposed to guarantee the convergence of nonlinear Lagrangian algorithms. These conditions are satisfied by well-known nonlinear Lagrangians appeared in the literature. The convergence properties for the nonlinear Lagrange method are discussed when subproblems are assumed to be solved exactly and inexactly, respectively. The convergence theorems show that, under the second order sufficient conditions with sigma-term and the strict constraint nondegeneracy condition, the algorithm based on any of nonlinear Lagrangians in the class is locally convergent when the penalty parameter is less than a threshold and the error bound of solution is proportional to the penalty parameter. Compared to the analysis in nonlinear Lagrangian methods for nonlinear programming, we have to deal with the sigma term in the convergence analysis. Finally, we report numerical results by using modified Frisch's function, modified Carroll's function and the Log-Sigmoid function.