The augmented Lagrangian method for a type of inverse quadratic programming problems over second-order cones

• Yi Zhang ^[1] ; Liwei Zhang ^[1] ; Yue Wu ^[2]
  1. [1] Dalian University of Technology

     Dalian University of Technology

     China

     
  2. [2] University of Southampton

     University of Southampton

     GB.ENG.M4.24UJ, Reino Unido

     
• Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 22, Nº. 1, 2014, págs. 45-79
• Idioma: inglés
• Enlaces
  • Texto completo (pdf)
• Resumen

  • The focus of this paper is on studying an inverse second-order cone quadratic programming problem, in which the parameters in the objective function need to be adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with cone constraints, and its dual, which has fewer variables than the original one, is a semismoothly differentiable (SC 1) convex programming problem with both a linear inequality constraint and a linear second-order cone constraint. We demonstrate the global convergence of the augmented Lagrangian method with an exact solution to the subproblem and prove that the convergence rate of primal iterates, generated by the augmented Lagrangian method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/r√ , where r is the penalty parameter in the augmented Lagrangian. Furthermore, a semismooth Newton method with Armijo line search is constructed to solve the subproblems in the augmented Lagrangian approach. Finally, numerical results are reported to show the effectiveness of the augmented Lagrangian method with both an exact solution and an inexact solution to the subproblem for solving the inverse second-order cone quadratic programming problem.