Optimality conditions and the basic constraint qualification for quasiconvex programming
As introduced in an earlier paper by the authors [J. Optim. Theory Appl. 149, No. 3, 554--563 (2011; Zbl 1229.90208)], a generator of an extended real-valued lsc quasiconvex function \(f\) on a locally convex Hausdorff topological vector space \(X\) is a set of pairs \((k_{i},w_{i})\), where \(k_{i}:\mathbb{R\longrightarrow}\overline{\mathbb{R}}\) is non-decreasing and lsc and \(w_{i}\in X^{\ast }\), such that \(f=\sup_{i\in I}k_{i}\circ w_{i}\). According to Corollary 2.34 in the reviewer's article [Optimization 19, No. 5, 603--652 (1988; Zbl 0671.49015)] (a result referred to as Penot and Volle's theorem in the paper under review) every lsc quasiconvex function admits a generator. The authors define a new notion of subdifferential \(\partial _{G}\), with respect to a generator \(G\), for a lsc quasiconvex function \(f\) on a locally convex Hausdorff topological vector space, and prove that, under mild assumptions, a necessary condition for a point \(x_{0}\) to be a local minimizer of \(f\) over a set \(A\) is \(0\in \partial f(x_{0})+N_{A}(x_{0})\), where \(N_{A}(x_{0})\) denotes the normal cone to \(A\) at \(x_{0}\). They also introduce a new constraint qualification for inequality constrained quasiconvex problems, under which a Kuhn-Tucker type theorem involving the subdifferential of the objective function with respect to \(G\) holds. It turns out that the new constraint qualification is the weakest possible for this theorem. The authors present two examples to show the usefulness of their results.
- Optimality conditions and constraint qualifications for quasiconvex programming
- \alpha -Lower Subdifferentiable Functions
- scientific article; zbMATH DE number 1328981
- Strong and total Lagrange dualities for quasiconvex programming
- Local maximum points of explicitly quasiconvex functions
- On a theorem due to Crouzeix and Ferland
- Quasiconvex minimization on a locally finite union of convex sets
- Abstract cone approximations and generalized differentiability in nonsmooth optimization
- Generators and constraint qualifications for quasiconvex inequality systems
- Strict lower subdifferentiability and applications
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- On Quasi-Convex Duality
- On set containment characterization and constraint qualification for quasiconvex programming
- A simple constraint qualification in convex programming
- On sufficient optimality conditions for a quasiconvex programming problem
- Characterizations of the solution set for non-essentially quasiconvex programming
- Duality theorems for quasiconvex programming with a reverse quasiconvex constraint
- Some constraint qualifications for quasiconvex vector-valued systems
- Revisiting the Hahn-Banach theorem and nonlinear infinite programming
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Duality theorems for convex and quasiconvex set functions
- Minimizing the difference of two quasiconvex functions
- Optimality conditions and constraint qualifications for quasiconvex programming
- Strong and total Lagrange dualities for quasiconvex programming
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality theorems for separable convex programming without qualifications
- Nonlinear error bounds for quasiconvex inequality systems
- A sharp Lagrange multiplier theorem for nonlinear programs
- scientific article; zbMATH DE number 3887448 (Why is no real title available?)
- Nonlinear programming via König's maximum theorem
- Quasiconvex programming with locally starshaped constraint region and applications to quasiconvex MPEC
- Optimality Conditions for Quasiconvex Programs
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- scientific article; zbMATH DE number 1130735 (Why is no real title available?)
- Constraint Qualifications and Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Generators and constraint qualifications for quasiconvex inequality systems
- A new constraint qualification and sharp optimality conditions for nonsmooth mathematical programming problems in terms of quasidifferentials
- Linear programming relaxation for quasiconvex programming
- Strong and total Lagrange dualities for quasiconvex programming
- Minimizing the difference of two quasiconvex functions over a vector-valued quasiconvex system
- scientific article; zbMATH DE number 7289939 (Why is no real title available?)
- The optimality conditions for approximate solutions of quasiconvex programming problems
- Sandwich theorem for quasiconvex functions and its applications
- scientific article; zbMATH DE number 5662944 (Why is no real title available?)
- Quasi-convex functions and applications to optimality conditions in nonlinear programming
- Characterizations of the solution set for tangentially convex optimization problems
- On constraint qualifications for an infinite system of quasiconvex inequalities
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
- Optimality conditions for quasiconvex programming with a reverse quasiconvex constraint
- Subdifferential calculus for a quasiconvex function with generator
- Quasiconvex semi-infinite optimization
This page was built for publication: Optimality conditions and the basic constraint qualification for quasiconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622397)
