Mathematical programming problems with quasi-convex objective functions
From MaRDI portal
Cites work
Cited in
(19)- Quasi-convex programming revisited
- Sufficient optimality conditions in continuous-time nonlinear programming
- Matrix-theoretic criteria for the quasiconvexity of twice continuously differentiable functions
- Nine kinds of quasiconcavity and concavity
- Generalized convexity on affine subspaces with an application to potential functions
- Second-order characterizations of pseudo-convex quadratic functions
- Matrix criteria for pseudo-convex functions in the class \(C^2\)
- Condizioni necessarie e sufficienti per un problema di programmazione non lineare
- Quasiconcavity and nondominated solutions in multiobjective programming
- Characterizations and applications of generalized invexity and monotonicity in Asplund spaces
- Linear interval parametric approach to testing pseudoconvexity
- On a theorem due to Crouzeix and Ferland
- On the Second-Order Sufficiency Conditions
- On second order conditions for quasiconvexity
- Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons
- scientific article; zbMATH DE number 3539006 (Why is no real title available?)
- Second order characterizations of pseudoconvex functions
- Optimality conditions for non-lipschitz generalized convex programming via clarke-rockafellar gradients
- Testing pseudoconvexity via interval computation
This page was built for publication: Mathematical programming problems with quasi-convex objective functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5671795)
