On the public citation graph

Note on generalized convex functions

0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00933162openalex-snapshot
On functions whose stationary points are global minima
inferredcites →https://doi.org/10.1007/bf00934358openalex-snapshot
A note on functions whose local minima are global
inferredcites →https://doi.org/10.1016/0022-247x(81)90123-2openalex-snapshot
On sufficiency of the Kuhn-Tucker conditions
inferredcites →https://doi.org/10.1016/0022-247x(89)90339-9openalex-snapshot
On generalized pseudoconvex functions
inferredcites →https://doi.org/10.1017/s0334270000005142openalex-snapshot
What is invexity?
inferredcites →https://doi.org/10.1017/s1446788700014865openalex-snapshot
A 4-chromatic graph with a special plane drawing
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1137/1.9781611971255openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.2307/2005896openalex-snapshot
Nonlinear Programming

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-387-23393-8_4openalex-snapshot
Generalized Convexity and Optimality Conditions in Scalar and Vector Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_1openalex-snapshot
Are Generalized Derivatives Sseful for Generalized Convex Functions?
inferred← citeshttps://doi.org/10.1007/978-3-031-30324-1_10openalex-snapshot
Introduction to Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-37007-9_14openalex-snapshot
Higher-order Pseudoconvex Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-46823-0_21openalex-snapshot
Generalized Convexity in the Light of Nonsmooth Analysis
inferred← citeshttps://doi.org/10.1007/bf02192135openalex-snapshot
Strict lower semicontinuity of the level sets and invexity of a locally Lipschitz function
inferred← citeshttps://doi.org/10.1007/s10898-009-9407-1openalex-snapshot
On a theorem due to Crouzeix and Ferland
inferred← citeshttps://doi.org/10.1007/s10898-010-9610-0openalex-snapshot
Second-order Kuhn-Tucker invex constrained problems
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50002-8openalex-snapshot
Convex Sets. Convex and Generalized Convex Functions
inferred← citeshttps://doi.org/10.1017/s0004972700011679openalex-snapshot
Invex optimisation problems
inferred← citeshttps://doi.org/10.1017/s0004972700012491openalex-snapshot
On locally Lipschitz vector-valued invex functions
inferred← citeshttps://doi.org/10.1023/a:1021744309992openalex-snapshot
Subvexormal Functions and Subvex Functions
inferred← citeshttps://doi.org/10.1051/proc:072016openalex-snapshot
Glimpses upon quasiconvex analysis
inferred← citeshttps://doi.org/10.1080/00036811.2012.724401openalex-snapshot
Higher order invex functions and higher order pseudoinvex ones
inferred← citeshttps://doi.org/10.1080/02331930008844469openalex-snapshot
What is quasiconvex analysis?
inferred← citeshttps://doi.org/10.1080/02331934.2010.522711openalex-snapshot
Second-order invex functions in nonlinear programming
inferred← citeshttps://doi.org/10.1080/02331939708844289openalex-snapshot
A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
inferred← citeshttps://doi.org/10.1080/02522667.1996.10699267openalex-snapshot
Various types of nonsmooth invex functions
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701055openalex-snapshot
Generalizedb-invex vector valued functions
inferred← citeshttps://doi.org/10.1109/cso.2009.243openalex-snapshot
Sufficient Conditions of e -Optimality Solutions Involving e - Invex Fractional Semi-infinite Programming
inferred← citeshttps://doi.org/10.1109/isme.2010.25openalex-snapshot
Fe-convex Function and Fractional Semi-infinite Programming
inferred← citeshttps://doi.org/10.7153/jmi-2019-13-84openalex-snapshot
Sharp bounds for Sándor-Yang means in terms of one-parameter family of bivariate means
inferred← citeshttps://doi.org/10.7153/jmi-2020-14-01openalex-snapshot
Inequalities for generalized trigonometric and hyperbolic functions with one parameter
inferred← citeshttps://doi.org/10.7153/jmi-2020-14-59openalex-snapshot
A necessary and sufficient condition for the convexity of the generalized elliptic integral of the first kind with respect to Hölder mean
inferred← citeshttps://doi.org/10.7153/mia-2020-23-67openalex-snapshot
Asymptotic expansion and bounds for complete elliptic integrals
inferred← citeshttps://doi.org/10.7153/mia-2020-23-68openalex-snapshot
Sharp rational bounds for the gamma function
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.