Zhang, Yi, Zhang, Liwei and Wu, Yue
The augmented Lagrangian method for a type of inverse problems over second-order cones
Full text not available from this repository.
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 (SC1) 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.
|Digital Object Identifier (DOI):
||inverse optimization, second-order cone quadratic programming, augmented lagrangian method, rate of convergence, damped semismooth newton method
||Centre of Excellence for International Banking, Finance & Accounting
||26 Mar 2012 15:32
||17 Apr 2017 17:22
|Further Information:||Google Scholar|
Actions (login required)