Optimality conditions and the basic constraint qualification for quasiconvex programming-Reference-Cited by-同舟云学术

Optimality conditions and the basic constraint qualification for quasiconvex programming

Published:2011-02 Issue:4 Volume:74 Page:1279-1285
ISSN:0362-546X
Container-title:Nonlinear Analysis: Theory, Methods & Applications
language:en
Short-container-title:Nonlinear Analysis: Theory, Methods & Applications

Author:

Suzuki Satoshi,Kuroiwa Daishi

Publisher

Elsevier BV

Subject

Applied Mathematics,Analysis

Reference4 articles.

1. Constraint qualifications for convex inequality systems with applications in constrained optimization;Li;SIAM J. Optim.,2008

2. On quasi-convex duality;Penot;Math. Oper. Res.,1990

3. S. Suzuki, D. Kuroiwa, On set containment characterization and constraint qualification for quasiconvex programming, J. Optim. Theory Appl. (in press).

4. ε-optimality and ε-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints;Son;J. Optim. Theory Appl.,2009

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On constraint qualifications for an infinite system of quasiconvex inequalities;Journal of Nonlinear and Variational Analysis;2024

2. Characterizations of the solution set for tangentially convex optimization problems;Optimization Letters;2022-08-03

3. Strong and total Lagrange dualities for quasiconvex programming;Journal of Nonlinear and Variational Analysis;2022

4. Karush–Kuhn–Tucker type optimality condition for quasiconvex programming in terms of Greenberg–Pierskalla subdifferential;Journal of Global Optimization;2020-07-22

5. Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization;Journal of Global Optimization;2020-02-29