The following pages link to Seven Kinds of Convexity (Q5548395):
Displaying 50 items.
- A Minty variational principle for set optimization (Q465450) (← links)
- C-programming and the minimization of pseudolinear and additive concave functions (Q579142) (← links)
- Generalization of convex and related functions (Q757246) (← links)
- Best \(L_ p\) approximation with multiple constraints for \(1\leq p<\infty\) (Q757769) (← links)
- Lower subdifferentiable functions and their minimization by cutting planes (Q795741) (← links)
- Best piecewise monotone uniform approximation (Q808361) (← links)
- A geometrical insight on pseudoconvexity and pseudomonotonicity (Q849330) (← links)
- Uniform approximation by quasi-convex and convex functions (Q913166) (← links)
- A note on strong pseudoconvexity (Q960694) (← links)
- Characterizations of \(r\)-convex functions (Q970573) (← links)
- Generalized convexity in multiple view geometry (Q993590) (← links)
- Ranking of vertices in the linear fractional programming problem (Q1053617) (← links)
- Sufficient optimality conditions in continuous-time nonlinear programming (Q1067197) (← links)
- On various duality theorems in nonlinear programming (Q1078078) (← links)
- A new look at fractional programming (Q1078093) (← links)
- Quasi-convex optimization (Q1078102) (← links)
- Sufficient optimality conditions and duality for a quasiconvex programming problem (Q1093539) (← links)
- Generalized fractional programming duality: A parametric approach (Q1095810) (← links)
- Optimal Lipschitzian selection operator in quasi-convex optimization (Q1096545) (← links)
- An O(n) algorithm for least squares quasi-convex approximation (Q1097626) (← links)
- Equivalent definitions of the quasiconvexity (Q1104241) (← links)
- \(\epsilon\)-subgradient projection algorithm (Q1111095) (← links)
- \(L_ p\) approximation by quasi-convex and convex functions (Q1120770) (← links)
- An iterative row-action method for interval convex programming (Q1138236) (← links)
- Quasiconvex, pseudoconvex, and strictly pseudoconvex quadratic functions (Q1146115) (← links)
- Nine kinds of quasiconcavity and concavity (Q1163104) (← links)
- Generalizations of convex and related functions (Q1172549) (← links)
- Uniform approximation by a non-convex cone of continuous functions (Q1183170) (← links)
- Logarithmic convexity and geometric programming (Q1215458) (← links)
- Second-order characterizations of pseudo-convex quadratic functions (Q1225697) (← links)
- Characterization of optimality in convex programming without a constraint qualification (Q1226443) (← links)
- Pareto optimality in multiobjective problems (Q1233815) (← links)
- Connectedness of the efficient set of strictly quasiconcave sets (Q1264975) (← links)
- Approximation complexity for piecewise monotone functions and real data (Q1323607) (← links)
- Shape preserving approximations by polynomials and splines (Q1368458) (← links)
- Optimality conditions for multiobjective programming with generalized \(({\mathfrak J},\rho,\theta)\)-convex set functions (Q1378572) (← links)
- Efficiency conditions and duality models for multiobjective fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho,\theta)\)-\(V\)-convex functions (Q1609081) (← links)
- Reduced Jacobian method (Q1626533) (← links)
- Unifying local-global type properties in vector optimization (Q1756763) (← links)
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions (Q1816683) (← links)
- \(L_ p\)-approximation from nonconvex subsets of special classes of functions (Q1825392) (← links)
- Parameter-free sufficient optimality conditions and duality models for minmax fractional subset programming problems with generalized \((\mathcal F,\rho,\theta)\) -convex functions (Q1827235) (← links)
- On depth and deep points: A calculus. (Q1873615) (← links)
- Three kinds of generalized convexity (Q1905045) (← links)
- Duality for nondifferentiable static multiobjective variational problems involving generalized \((F,\rho)\)-convex functions (Q1921258) (← links)
- \(P\)-functions, quasi-convex functions, and Hadamard-type inequalities (Q1963966) (← links)
- Three types dual model for minimax fractional programming (Q1972503) (← links)
- Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch (Q1993602) (← links)
- The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
- (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions (Q2082560) (← links)
