随机二阶锥二次规划逆问题的SAA方法

展开
  • 1. 福州大学数学与统计学院, 运筹学与控制论高校重点实验室, 福建福州 350116
    2. 福建工程学院计算机科学与数学学院, 福建福州 350118
    3. 大连理工大学数学科学学院, 辽宁大连 116024
初丽  E-mail: sophiatruly@126.com

收稿日期: 2020-06-23

  网络出版日期: 2022-05-27

基金资助

国家自然科学基金青年项目(11701091)

An SAA approach for a class of second-order cone stochastic inverse quadratic programming problem

Expand
  • 1. Key Laboratory of Operations Research and Control of Universities in Fujian, School of Mathematics and Statistics, Fuzhou University, Fuzhou 350116, Fujian, China
    2. College of Computer Science and Mathematics, Fujian University of Technology, Fuzhou 350118, Fujian, China
    3. School of Mathematical Sciences, Dalian University of Technology, Dalian 116024, Liaoning, China

Received date: 2020-06-23

  Online published: 2022-05-27

摘要

本文讨论一类随机的二阶锥二次规划逆问题, 该模型是一个含有二阶锥互补约束的随机二次规划模型, 对解释部分实际问题有着一定的优势。为了求解该模型, 本文引入了随机抽样技术和互补约束光滑化近似技术, 得到问题的近似子问题。本文证明, 只要子问题的解是存在且收敛的, 则该极限以概率一是原问题的C-稳定点; 若严格互补条件和二阶必要性条件成立, 则该极限以概率1是原问题的M-稳定点。一个简单的数值实验验证了该算法具有一定的可行性。

本文引用格式

王博, 初丽, 张立卫, 张宏伟 . 随机二阶锥二次规划逆问题的SAA方法[J]. 运筹学学报, 2022 , 26(2) : 31 -44 . DOI: 10.15960/j.cnki.issn.1007-6093.2022.02.003

Abstract

In this paper, we consider a class of stochastic inverse quadratic second-order cone programming problem. This stochastic model contains complementarity constraints, and is more proper to model some class of real world problems. By employing the techniques of stochastic sampling and smoothing, we construct auxiliary approximate sub-problems to solve the original model. In addition, we proved that if the solutions of the approximate sub-problems converge, then with probability one the limit is the C-stationary point of the original problem. If strict complementarity condition and the second order necessary condition hold, then with probability one the limit is an M-stationary point. A simple numerical test verified the applicability of our approach.

参考文献

1 Ahuja R K , Orlin J B . Combinatorial algorithms for inverse network flow problems[J]. Networks, 2002, 40 (4): 181- 187.
2 Heuberger C . Inverse combinatorial optimization: A survey on problems, methods, and results[J]. Journal of Combinatorial Optimization, 2004, 8 (3): 329- 361.
3 Jalilzadeh A, Hamedani E Y. Inverse quadratic transportation problem[J/OL]. (2014-09-21)[2020-05-20]. https://arxiv.org/abs/1409.6030v1.
4 Wang S , Liu Y , Jiang Y . A majorized penalty approach to inverse linear second order cone programming problems[J]. Journal of Industrial and Management Optimization, 2013, 10 (3): 965- 976.
5 Zhang Y , Zhang L , Wu J , et al. A perturbation approach for an inverse quadratic programming problem over second-order cones[J]. Mathematics of Computation, 2014, 84 (291): 209- 236.
6 Zhang J , Zhang L . An augmented lagrangian method for a class of inverse quadratic programming problems[J]. Applied Mathematics and Optimization, 2009, 61 (1): 57.
7 Zhang J , Zhang L , Xiao X . A perturbation approach for an inverse quadratic programming problem[J]. Mathematical Methods of Operations Research, 2010, 72 (3): 379- 404.
8 Xu H , Ye J J . Approximating stationary points of stochastic mathematical programs with equilibrium constraints via sample averaging[J]. Set-Valued and Variational Analysis, 2011, 19 (2): 283- 309.
9 Shapiro A, Dentcheva D, Ruszczyński A. Lectures on Stochastic Programming[M]. Society for Industrial and Applied Mathematics, 2009.
10 Rockafellar R T , Wets R J B . Variational Analysis[M]. Berlin: Springer-Verlag, 1998.
11 Zhang Y , Zhang L , Wu J . Convergence properties of a smoothing approach for mathematical programs with second-order cone complementarity constraints[J]. Set-Valued and Variational Analysis, 2011, 19 (4): 609.
文章导航

/