Seven Kinds of Convexity
From MaRDI portal
Publication:5548395
DOI10.1137/1009007zbMath0164.06501OpenAlexW2064551963MaRDI 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
An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials, On depth and deep points: A calculus., On various duality theorems in nonlinear programming, A new look at fractional programming, Quasi-convex optimization, Sufficient optimality criteria and duality for nondifferentiable fractional variational problems with generalized (F, ρ)-convexity, Generalized convexity in mathematical programming, Reduced Jacobian method, Unnamed Item, A NOTE ON CONVEXITY*, Continuity of Optimal Solution Functions and their Conditions on Objective Functions, On Nondifferentiable Quasiconvex Programming Problem, Sufficient optimality conditions and duality for a quasiconvex programming problem, Conditions for solutions, their globality, and their duality relations in vector optimization with relaxed quasiconvexity, 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, A geometrical insight on pseudoconvexity and pseudomonotonicity, Equivalent definitions of the quasiconvexity, Characterisations of quasiconvex functions, Three kinds of generalized convexity, \(\epsilon\)-subgradient projection algorithm, On generalised convex nonsmooth functions, Shape preserving approximations by polynomials and splines, \(L_ p\) approximation by quasi-convex and convex functions, Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions, Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions, On some specification of the Dubovicki-Milutin theorem for Pareto optimal problems, The use of pseudo-convexity and quasi-convexity in sufficient conditions for global constrained extrema†, An iterative row-action method for interval convex programming, Seven Kinds of Computable and Constructive Infelicities in Economics, Quasiconvex, pseudoconvex, and strictly pseudoconvex quadratic functions, Exact and approximate solutions to the multisource weber problem, $$\mathcal {NP}$$-Hardness of Equilibria in Case of Risk-Averse Players, r-convex functions, Unnamed Item, Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions, Generalized convexity and concavity of the optimal value function in nonlinear programming, Uniform approximation by quasi-convex and convex functions, Nine kinds of quasiconcavity and concavity, Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions, \(P\)-functions, quasi-convex functions, and Hadamard-type inequalities, A Minty variational principle for set optimization, Generalizations of convex and related functions, Three types dual model for minimax fractional programming, Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions, Uniform approximation by a non-convex cone of continuous functions, From Arrow–Debreu condition to star shape preferences, Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch, Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program, The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values, A note on strong pseudoconvexity, Unifying local-global type properties in vector optimization, Conditional value-at-risk: structure and complexity of equilibria, On A characterization of optimality in convex programming, Characterizations of \(r\)-convex functions, Composition theorems for generalized concave vector valued functions, Generalization of some duality theorems in nonlinear programming, Logarithmic convexity and geometric programming, Fractional programming without differentiability, Lexicographic quasiconcave multiobjective programming, O(n) algorithms for discrete n-point approximation by quasi-convex functions, Second-order characterizations of pseudo-convex quadratic functions, Characterization of optimality in convex programming without a constraint qualification, Optimal value functions in parametric programming, Wolfe-type duality for mathematical programs with equilibrium constraints, On sufficiency and duality for generalised quasicnvex nonsmooth programs, Pareto optimality in multiobjective problems, C-programming and the minimization of pseudolinear and additive concave functions, Multivalued convexity and optimization: A unified approach to inequality and equality constraints, Generalized convexity in multiple view geometry, Second order characterizations of pseudoconvex functions, What is quasiconvex analysis?, ON INEQUALITIES RELATED TO SOME QUASI-CONVEX FUNCTIONS, On Strict Pseudoconvexity, Quasi-convex functions of higher order, On the structure of the weakly efficient set for quasiconvex vector minimization, Connectedness of the efficient set of strictly quasiconcave sets, On Karamardian's theorem about lower semicontinuous strictly quasiconvex functions, Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions, Asymptotic duality over closed convex sets, Generalization of convex and related functions, Best \(L_ p\) approximation with multiple constraints for \(1\leq p<\infty\), Indefinite quadratic fractional functional programming, \(L_ p\)-approximation from nonconvex subsets of special classes of functions, Solution of certain nonlinear programs involving r-convex functions, Matrix-theoretic criteria for the quasi-convexity and pseudo-convexity of quadratic functions, Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions, Characteruzation of pareto optimal points in problems with mult-eqality constraints, Quasi-convex functions and Hadamard's inequality, Direct theorems in semi-infinite convex programming, (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions, On the Second-Order Sufficiency Conditions, Ranking of vertices in the linear fractional programming problem, Lower subdifferentiable functions and their minimization by cutting planes, Local maximum points of explicitly quasiconvex functions, Sufficient optimality conditions in continuous-time nonlinear programming, Best piecewise monotone uniform approximation, Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions, Approximation complexity for piecewise monotone functions and real data
