A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems

被引:5
|
作者
Xu, Qing-Juan [1 ,2 ]
Jian, Jin-Bao [3 ,4 ]
机构
[1] Shanghai Univ, Dept Math Sci, Shanghai 200444, Peoples R China
[2] Guangxi Teachers Educ Univ, Coll Math Sci, Nanning 530001, Guangxi, Peoples R China
[3] Yulin Normal Univ, Coll Math & Informat Sci, Yulin 537000, Guangxi, Peoples R China
[4] Guangxi Univ, Coll Math & Informat Sci, Nanning 530004, Guangxi, Peoples R China
基金
中国国家自然科学基金;
关键词
Semi-infinite optimization; QCQP; Norm-relaxed method; Global convergence; QUADRATIC-PROGRAMMING METHOD; FEASIBLE DIRECTIONS; ALGORITHM;
D O I
10.1007/s11071-013-0768-0
中图分类号
TH [机械、仪表工业];
学科分类号
0802 ;
摘要
In this paper, we present a sequential simple quadratically constrained quadratic programming (QCQP) norm-relaxed method for finely discretized semi-infinite optimization problems. At each iteration, the iteration point is feasible, and an improved search direction is solved by only one simple QCQP subproblem, in which only a few of constraints are chosen. Under some weak conditions, the proposed algorithm possesses weak global convergence. Finally, numerical results show that the proposed method is effective.
引用
收藏
页码:85 / 92
页数:8
相关论文
共 50 条
  • [1] A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
    Qing-Juan Xu
    Jin-Bao Jian
    Nonlinear Dynamics, 2013, 73 : 85 - 92
  • [2] A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
    Jian, Jin-Bao
    Xu, Qing-Juan
    Han, Dao-Lan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 186 (01) : 41 - 62
  • [3] A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
    Liu, Mei-xing
    Jian, Jin-bao
    Tang, Chun-ming
    OPTIMIZATION, 2022, 71 (06) : 1525 - 1555
  • [4] Subsmooth semi-infinite and infinite optimization problems
    Zheng, Xi Yin
    Ng, Kung Fu
    MATHEMATICAL PROGRAMMING, 2012, 134 (02) : 365 - 393
  • [5] Subsmooth semi-infinite and infinite optimization problems
    Xi Yin Zheng
    Kung Fu Ng
    Mathematical Programming, 2012, 134 : 365 - 393
  • [6] A generalization of the norm-relaxed method of feasible directions
    Chen, XB
    Kostreva, MM
    APPLIED MATHEMATICS AND COMPUTATION, 1999, 102 (2-3) : 257 - 272
  • [7] Semi-infinite optimization problems and their approximations
    Ratiu, Augusta
    Duca, Dorel I.
    STUDIA UNIVERSITATIS BABES-BOLYAI MATHEMATICA, 2013, 58 (03): : 401 - 411
  • [8] Nonsmooth Semi-infinite Multiobjective Optimization Problems
    Thai Doan Chuong
    Kim, Do Sang
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2014, 160 (03) : 748 - 762
  • [9] Nonsmooth Semi-infinite Multiobjective Optimization Problems
    Thai Doan Chuong
    Do Sang Kim
    Journal of Optimization Theory and Applications, 2014, 160 : 748 - 762
  • [10] A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
    Jian, Jin-bao
    Ke, Xiao-yan
    Zheng, Hai-yan
    Tang, Chun-ming
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2009, 223 (02) : 1013 - 1027