Optimality conditions and constraint qualifications for quasiconvex programming
From MaRDI portal
Publication:2278888
DOI10.1007/s10957-019-01534-7zbMath1439.90057OpenAlexW2945633553MaRDI QIDQ2278888
Publication date: 11 December 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-019-01534-7
optimality conditionconstraint qualificationquasiconvex programminggenerator of a quasiconvex function
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items
Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential ⋮ Characterization of nonsmooth quasiconvex functions and their Greenberg-Pierskalla's subdifferentials using semi-quasidifferentiability notion ⋮ Strong and total Lagrange dualities for quasiconvex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming
- Necessary and sufficient constraint qualification for surrogate duality
- Optimality conditions and the basic constraint qualification for quasiconvex programming
- On set containment characterization and constraint qualification for quasiconvex programming
- Subdifferential calculus for a quasiconvex function with generator
- Lower subdifferentiable functions and their minimization by cutting planes
- Characterizations of the solution sets of convex programs and variational inequality problems
- On characterizing the solution sets of pseudoinvex extremum problems
- Conjugate duality in convex optimization
- A simple characterization of solutions sets of convex programs
- Generalized concavity
- Characterization of solution sets of quasiconvex programs
- Transformation of quasiconvex functions to eliminate local minima
- 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
- Characterizations of the solution set for a class of nonsmooth optimization problems
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality theorems for separable convex programming without qualifications
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Characterizations of pseudoconvex functions and semistrictly quasiconvex ones
- Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities
- Inf-convolution, sous-additivite, convexite des fonctions numériques
- Inexact subgradient methods for quasi-convex optimization problems
- Characterization of solution sets of convex programs
- An Appropriate Subdifferential for Quasiconvex Functions
- Optimality Conditions for Quasiconvex Programs
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Quasiconvex duality theory by generalized conjugation methods
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
- What is quasiconvex analysis?
- Convex Analysis
- On Quasi-Convex Duality
This page was built for publication: Optimality conditions and constraint qualifications for quasiconvex programming
