科研进展
增广拉格朗日方法可以近似求解最小约束违背凸优化问题(戴彧虹)
发布时间:2022-07-11 |来源:

   There are many important practical optimization problems whose feasible regions are not known to be nonempty or not, and optimizers of the objective function with the least constraint violation prefer to be found. A natural way for dealing with these problems is to extend the nonlinear optimization problem as the one optimizing the objective function over the set of points with the least constraint violation. This leads to the study of the shifted problem. This paper focuses on the constrained convex optimization problem. The sufficient condition for the closedness of the set of feasible shifts is presented and the continuity properties of the optimal value function and the solution mapping for the shifted problem are studied. Properties of the conjugate dual of the shifted problem are discussed through the relations between the dual function and the optimal value function. The solvability of the dual of the optimization problem with the least constraint violation is investigated. It is shown that, if the least violated shift is in the domain of the subdifferential of the optimal value function, then this dual problem has an unbounded solution set. Under this condition, the optimality conditions for the problem with the least constraint violation are established in term of the augmented Lagrangian. It is shown that the augmented Lagrangian method has the properties that the sequence of shifts converges to the least violated shift and the sequence of multipliers is unbounded. Moreover, it is proved that the augmented Lagrangian method is able to find an approximate solution to the problem with the least constraint violation and it has linear rate of convergence under an error bound condition. The augmented Lagrangian method is applied to an illustrative convex second-order cone constrained optimization problem with least constraint violation and numerical results verify our theoretical results.

    

  Publication: 

  Mathematical Programming, Series B, 17 June 2022. 

    

  Author: 

  Yu-Hong Dai 

  LSEC, ICMSEC, AMSS, Chinese Academy of Sciences, Beijing, 100190, China 

  School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing, 100049, China 

  Email: dyh@lsec.cc.ac.cn  

    

  Liwei Zhang 

  School of Mathematical Sciences, Dalian University of Technology, Dalian, 116024, China 


附件下载:

    联系我们
    参考
    相关文章