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

Wen-ling Zhao; Dao-jin Song

doi:10.3934/jimo.2007.3.775

Article Contents

2007, Volume 3, Issue 4: 775-781. Doi: 10.3934/jimo.2007.3.775

This issue Previous Article Licensing schemes in Stackelberg model under asymmetric information of product costs Next Article

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

Wen-ling Zhao^1, and
Dao-jin Song^2,

1.
Department of Applied Mathematics, Dalian University of Technology, Dalian Liaoning, 116024
2.
School of Mathematics and Information Science, Shandong University of Technology, Zibo Shandong, 255049

Received: August 31, 2006

Revised: May 31, 2007

Published: September 2007

Abstract Related Papers Cited by

Abstract

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.

Keywords:

Mathematics Subject Classification: 90C30, 49M37.

Citation:

Article Metrics

HTML views() PDF downloads(53) Cited by(0)

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

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

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

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content