Optimization Online


Global Error bounds for systems of convex polynomials over polyhedral constraints

Huynh Van Ngai(ngaivn***at***yahoo.com)

Abstract: This paper is devoted to study the Lipschitzian/Holderian type global error bound for systems of many finitely convex polynomial inequalities over a polyhedral constraint. Firstly, for systems of this type, we show that under a suitable asymtotic qualification condition, the Lipschitzian type global error bound property is equivalent to the Abadie qualification condition, in particular, the Lipschitzian type global error bound is satisfied under the Slater condition. Secondly, without regularity conditions, the H$\ddot{\mbox{o}}$lderian global error bound with an implicit exponent is invertigated.

Keywords: Subdifferential, error bound, polynomial

Category 1: Nonlinear Optimization


Download: [PDF]

Entry Submitted: 11/11/2011
Entry Accepted: 11/11/2011
Entry Last Modified: 11/11/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society