A global error bound via the SQP method for constrained optimization problem

被引:0
|
作者
Zhao, Wen-Ling [1 ]
Song, Dao-Jin
机构
[1] Dalian Univ Technol, Dept Appl Math, Dalian 116024, Liaoning, Peoples R China
[2] Shandong Univ, Sch Math & Informat Sci, Shandong 255049, Peoples R China
关键词
SQP problem; value function; global error bound; convergence;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
For the constrained optimization problem, under the condition that the objective function is strongly convex, we obtain a global error bound for the distance between any feasible solution and the optimal solution by using the merit function in the sequential quadratic programming (SQP) method.
引用
收藏
页码:775 / 781
页数:7
相关论文
共 50 条
  • [41] SMOOTHING SQP METHODS FOR SOLVING DEGENERATE NONSMOOTH CONSTRAINED OPTIMIZATION PROBLEMS WITH APPLICATIONS TO BILEVEL PROGRAMS
    Xu, Mengwei
    Ye, Jane J.
    Zhang, Liwei
    SIAM JOURNAL ON OPTIMIZATION, 2015, 25 (03) : 1388 - 1410
  • [42] A global error bound for quadratic perturbation of linear programs
    Pinar, MÇ
    APPLIED MATHEMATICS LETTERS, 2002, 15 (03) : 367 - 370
  • [43] An ADMM-based SQP method for separably smooth nonconvex optimization
    Liu, Meixing
    Jian, Jinbao
    JOURNAL OF INEQUALITIES AND APPLICATIONS, 2020, 2020 (01)
  • [44] An ADMM-based SQP method for separably smooth nonconvex optimization
    Meixing Liu
    Jinbao Jian
    Journal of Inequalities and Applications, 2020
  • [45] Two Error Bounds for Constrained Optimization Problems and Their Applications
    Chang-Yu Wang
    Jian-Zhong Zhang
    Wen-Ling Zhao
    Applied Mathematics and Optimization, 2008, 57 : 307 - 328
  • [46] Two error bounds for constrained optimization problems and their applications
    Wang, Chang-Yu
    Zhang, Jian-Zhong
    Zhao, Wen-Ling
    APPLIED MATHEMATICS AND OPTIMIZATION, 2008, 57 (03) : 307 - 328
  • [47] A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
    Sun, Hongchun
    Wang, Yiju
    Li, Shengjie
    Sun, Min
    JOURNAL OF FIXED POINT THEORY AND APPLICATIONS, 2018, 20 (02)
  • [48] ERROR BOUND PROPERTIES FOR STRUCTURED CONVEX OPTIMIZATION PROBLEMS
    Gao, Tianming
    Zhang, Lufang
    Meng, Li
    JOURNAL OF NONLINEAR AND CONVEX ANALYSIS, 2024, 25 (02) : 463 - 474
  • [49] A SMOOTHING DIRECT SEARCH METHOD FOR MONTE CARLO-BASED BOUND CONSTRAINED COMPOSITE NONSMOOTH OPTIMIZATION
    Chen, Xiaojun
    Kelley, C. T.
    Xu, Fengmin
    Zhang, Zaikun
    SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2018, 40 (04) : A2174 - A2199
  • [50] A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions
    Hongchun Sun
    Yiju Wang
    Shengjie Li
    Min Sun
    Journal of Fixed Point Theory and Applications, 2018, 20