Characterization of solution sets of quasiconvex programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1328977 (Why is no real title available?)
- scientific article; zbMATH DE number 1054735 (Why is no real title available?)
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of convex programs
- Elements of quasiconvex subdifferential calculus
- Invexity and generalized convexity
- Lower subdifferentiability and integration
- Lower subdifferentiable functions and their minimization by cutting planes
- Nonsmooth invex functions and sufficient optimality conditions
- On functions whose stationary points are global minima
- Semi-invex functions and their subdifferentials
- Various types of nonsmooth invex functions
- What is invexity?
- What is quasiconvex analysis?
Cited in
(38)- Characterizing robust solution sets of convex programs under data uncertainty
- What is quasiconvex analysis?
- Characterizations of optimal solution sets of convex infinite programs
- scientific article; zbMATH DE number 7468708 (Why is no real title available?)
- Dual approaches to characterize robust optimal solution sets for a class of uncertain optimization problems
- Generalized convex functions and generalized differentials
- Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
- scientific article; zbMATH DE number 7450966 (Why is no real title available?)
- Portfolio optimization with quasiconvex risk measures
- A note on characterization of solution sets to pseudolinear programming problems
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Lagrangian approach to quasiconvex programing
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Multipliers and general Lagrangians
- Pareto optimal allocations and optimal risk sharing for quasiconvex risk measures
- Characterizations of the solution set for tangentially convex optimization problems
- Characterization of the weakly efficient solutions in nonsmooth quasiconvex multiobjective optimization
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Projective dualities for quasiconvex problems
- Karush-Kuhn-Tucker optimality conditions for non-smooth geodesic quasi-convex optimization on Riemannian manifolds
- On characterizations of solution sets of interval-valued quasiconvex programming problems
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Lagrange multiplier characterizations of solution sets of constrained pseudolinear optimization problems
- Characterizations of solution sets of differentiable quasiconvex programming problems
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
- Characterizations of robust solution set of convex programs with uncertain data
- Algorithms for quasiconvex minimization
- Generalized affine functions and generalized differentials
- Semistrictly and neatly quasiconvex programming using lower global subdifferentials
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Characterizations of the solution set for non-essentially quasiconvex programming
- Optimality conditions and characterizations of the solution sets in generalized convex problems and variational inequalities
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Optimality conditions and constraint qualifications for quasiconvex programming
- An extragradient projection method for strongly quasiconvex equilibrium problems with applications
- Characterizations of the solution set for a class of nonsmooth optimization problems
- A new approach to characterize the solution set of a pseudoconvex programming problem
This page was built for publication: Characterization of solution sets of quasiconvex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1411529)
