Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Some constraint qualifications for quasiconvex vector-valued systems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we consider minimization problems with a quasiconvex vector-valued inequality constraint. We propose two constraint qualifications, the closed cone constraint qualification for vector-valued quasiconvex programming (the VQ-CCCQ) and the basic constraint qualification for vector-valued quasiconvex programming (the VQ-BCQ). Based on previous results by Benoist et al. (Proc Am Math Soc 13:1109–1113, 2002), and Suzuki and Kuroiwa (J Optim Theory Appl 149:554–563, 2011), and (Nonlinear Anal 74:1279–1285, 2011), we show that the VQ-CCCQ (resp. the VQ-BCQ) is the weakest constraint qualification for Lagrangian-type strong (resp. min–max) duality. As consequences of the main results, we study semi-definite quasiconvex programming problems in our scheme, and we observe the weakest constraint qualifications for Lagrangian-type strong and min–max dualities. Finally, we summarize the characterizations of the weakest constraint qualifications for convex and quasiconvex programming.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Jeyakumar, V., Dinh, N., Lee, G.M.: A new closed cone constraint qualification for convex optimization. Research Report AMR 04/8, Department of Applied Mathematics, University of New South Wales (2004)

  2. Jeyakumar V.: Constraint qualifications characterizing lagrangian duality in convex optimization. J. Optim. Theory Appl. 136, 31–41 (2008)

    Article  Google Scholar 

  3. Li C., Ng K.F., Pong T.K.: Constraint qualifications for convex inequality systems with applications in constrained optimization. SIAM J. Optim. 19, 163–187 (2008)

    Article  Google Scholar 

  4. Suzuki S., Kuroiwa D.: On set containment characterization and constraint qualification for quasiconvex programming. J. Optim. Theory Appl. 149, 554–563 (2011)

    Article  Google Scholar 

  5. Suzuki S., Kuroiwa D.: Optimality conditions and the basic constraint qualification for quasiconvex programming. Nonlinear Anal. 74, 1279–1285 (2011)

    Article  Google Scholar 

  6. Penot J.P., Volle M.: On quasi-convex duality. Math. Oper. Res. 15, 597–625 (1990)

    Article  Google Scholar 

  7. Benoist J., Borwein J.M., Popovici N.: A characterization of quasiconvex vector-valued functions. Proc. Am. Math. Soc. 13, 1109–1113 (2002)

    Google Scholar 

  8. Boţ R.I., Wanka G.: An alternative formulation for a new closed conlification. Nonlinear Anal. 64, 1367–1381 (2006)

    Article  Google Scholar 

  9. Goberna M.A., Jeyakumar V., López M.A.: Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities. Nonlinear Anal. 68, 1184–1194 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Satoshi Suzuki.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Suzuki, S., Kuroiwa, D. Some constraint qualifications for quasiconvex vector-valued systems. J Glob Optim 55, 539–548 (2013). https://doi.org/10.1007/s10898-011-9807-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-011-9807-x

Keywords

Mathematics Subject Classification (2000)

Navigation