On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming

Access this Article

Search this Article

Abstract

Dual characterizations of the containment of a convex set with qua-siconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint qualification is the weakest constraint qualification for the duality.

Journal

  • Journal of Optimization Theory and Applications

    Journal of Optimization Theory and Applications 149(3), 554-563, 2011-06

    Springer US

Codes

  • NII Article ID (NAID)
    120005647349
  • NII NACSIS-CAT ID (NCID)
    AA00253056
  • Text Lang
    ENG
  • Article Type
    journal article
  • ISSN
    0022-3239
  • Data Source
    IR 
Page Top