A STRONGLY SUB-FEASIBLE NORM-RELAXED SQP ALGORITHM FOR FINELY DISCRETIZED SEMI-INFINITE  OPTIMIZATION PROBLEMS

Xu qingjuan, Jian Jinbao

Journal of Systems Science and Mathematical Sciences ›› 2013, Vol. 33 ›› Issue (4) : 419-429.

PDF(408 KB)
PDF(408 KB)
Journal of Systems Science and Mathematical Sciences ›› 2013, Vol. 33 ›› Issue (4) : 419-429. DOI: 10.12341/jssms12072

A STRONGLY SUB-FEASIBLE NORM-RELAXED SQP ALGORITHM FOR FINELY DISCRETIZED SEMI-INFINITE  OPTIMIZATION PROBLEMS

  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}. Journal of Systems Science and Mathematical Sciences, 2013, 33(4): 419-429 https://doi.org/10.12341/jssms12072

References

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(408 KB)

Accesses

Citation

Detail

Sections
Recommended

/