Seven Kinds of Convexity
From MaRDI portal
Publication:5548395
DOI10.1137/1009007zbMath0164.06501MaRDI QIDQ5548395
No author found.
Publication date: 1967
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1009007
Related Items
Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity, Characterisations of quasiconvex functions, On generalised convex nonsmooth functions, Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions, Composition theorems for generalized concave vector valued functions, Characteruzation of pareto optimal points in problems with mult-eqality constraints, Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions, What is quasiconvex analysis?, Optimal value functions in parametric programming, On Strict Pseudoconvexity, A NOTE ON CONVEXITY*, Exact and approximate solutions to the multisource weber problem, r-convex functions, Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions, C-programming and the minimization of pseudolinear and additive concave functions, Generalization of convex and related functions, Best \(L_ p\) approximation with multiple constraints for \(1\leq p<\infty\), Lower subdifferentiable functions and their minimization by cutting planes, Best piecewise monotone uniform approximation, Uniform approximation by quasi-convex and convex functions, A note on strong pseudoconvexity, Ranking of vertices in the linear fractional programming problem, Sufficient optimality conditions in continuous-time nonlinear programming, On various duality theorems in nonlinear programming, A new look at fractional programming, Quasi-convex optimization, Sufficient optimality conditions and duality for a quasiconvex programming problem, Generalized fractional programming duality: A parametric approach, Optimal Lipschitzian selection operator in quasi-convex optimization, An O(n) algorithm for least squares quasi-convex approximation, Equivalent definitions of the quasiconvexity, \(\epsilon\)-subgradient projection algorithm, \(L_ p\) approximation by quasi-convex and convex functions, An iterative row-action method for interval convex programming, Quasiconvex, pseudoconvex, and strictly pseudoconvex quadratic functions, Nine kinds of quasiconcavity and concavity, Generalizations of convex and related functions, Uniform approximation by a non-convex cone of continuous functions, Logarithmic convexity and geometric programming, Second-order characterizations of pseudo-convex quadratic functions, Characterization of optimality in convex programming without a constraint qualification, Pareto optimality in multiobjective problems, Connectedness of the efficient set of strictly quasiconcave sets, Approximation complexity for piecewise monotone functions and real data, Shape preserving approximations by polynomials and splines, Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions, Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions, Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions, \(L_ p\)-approximation from nonconvex subsets of special classes of functions, Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions, On depth and deep points: A calculus., Three kinds of generalized convexity, Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions, \(P\)-functions, quasi-convex functions, and Hadamard-type inequalities, Three types dual model for minimax fractional programming, O(n) algorithms for discrete n-point approximation by quasi-convex functions, Asymptotic duality over closed convex sets, Indefinite quadratic fractional functional programming, Solution of certain nonlinear programs involving r-convex functions, Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions, On sufficiency and duality for generalised quasicnvex nonsmooth programs, The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†, On some specification of the Dubovicki-Milutin theorem for Pareto optimal problems, On the Second-Order Sufficiency Conditions, Generalized convexity and concavity of the optimal value function in nonlinear programming, Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program, Direct theorems in semi-infinite convex programming, Generalized convexity in mathematical programming, Unnamed Item, On Nondifferentiable Quasiconvex Programming Problem, Unnamed Item, On A characterization of optimality in convex programming, Generalization of some duality theorems in nonlinear programming, Fractional programming without differentiability, Lexicographic quasiconcave multiobjective programming, Multivalued convexity and optimization: A unified approach to inequality and equality constraints, Second order characterizations of pseudoconvex functions, On Karamardian's theorem about lower semicontinuous strictly quasiconvex functions, Quasi-convex functions and Hadamard's inequality
