scientific article; zbMATH DE number 3824556
From MaRDI portal
Publication:3670037
Cited in
(18)- A general theory of dual optimization problems
- Characterizations of the solution set for non-essentially quasiconvex programming
- Characterizations of evenly convex sets and evenly quasiconvex functions
- Diewert-Crouzeix conjugation for general quasiconvex duality and applications
- Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Duality for quasiconvex minimization over closed convex cones
- Set-valued evenly convex functions: characterizations and C-conjugacy
- Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions
- Optimality conditions and constraint qualifications for quasiconvex programming
- Even convexity, subdifferentiability, and {\(\Gamma\)}-regularization in general topological vector spaces
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- Analyzing linear systems containing strict inequalities via evenly convex hulls
- Duality between direct and indirect utility functions under minimal hypotheses
- On the equality of Clarke and Greenberg-Pierskalla differentials
- Evenly convex sets, and evenly quasiconvex functions, revisited
- Characterizations of the solution set for tangentially convex optimization problems
- Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
- Quasiconjugate duality and optimality conditions for quasiconvex optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3670037)
