On the public citation graph

On functions whose stationary points are global minima

0 signed · 35 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/bf00932662openalex-snapshot
A note on functions whose local minima are global
inferredcites →https://doi.org/10.1007/bf01262931openalex-snapshot
On functions whose local minima are global
inferredcites →https://doi.org/10.1007/bf01584534openalex-snapshot
Geometry of optimality conditions and constraint qualifications
inferredcites →https://doi.org/10.1016/0898-1221(77)90071-2openalex-snapshot
Nonlinear Programming Analysis and Methods
inferredcites →https://doi.org/10.1088/0031-9112/18/9/022openalex-snapshot
Calculus of Variations and Optimal Control Theory
inferredcites →https://doi.org/10.1137/0303020openalex-snapshot
Pseudo-Convex Functions
inferredcites →https://doi.org/10.1137/0308003openalex-snapshot
The Validity of a Family of Optimization Methods
inferredcites →https://doi.org/10.1137/0311041openalex-snapshot
Lower Semicontinuity of Multivalued Linearization Mappings
inferredcites →https://doi.org/10.1137/1015073openalex-snapshot
Point-to-Set Maps in Mathematical Programming
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2005033openalex-snapshot
Calculus of Variations and Optimal Control Theory
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jmaa.1997.5281openalex-snapshot
Generalized Pseudoconvex Functions and Multiobjective Programming
inferred← citeshttps://doi.org/10.1007/978-1-4613-3285-5_10openalex-snapshot
Approximations to the Clarke Generalized Jacobians and Nonsmooth Least-Squares Minimization
inferred← citeshttps://doi.org/10.1007/978-1-4684-7600-2_9openalex-snapshot
Additional Generalizations of Concavity
inferred← citeshttps://doi.org/10.1007/bf00939543openalex-snapshot
Note on generalized convex functions
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/bfb0120986openalex-snapshot
Necessary conditions for ε-optimality
inferred← citeshttps://doi.org/10.1007/s10479-020-03579-8openalex-snapshot
On a global efficiency criterion in multiobjective variational control problems with path-independent curvilinear integral cost functionals
inferred← citeshttps://doi.org/10.1007/s10957-021-01815-0openalex-snapshot
On a Class of Constrained Interval-Valued Optimization Problems Governed by Mechanical Work Cost Functionals
inferred← citeshttps://doi.org/10.1016/0022-247x(89)90339-9openalex-snapshot
On generalized pseudoconvex functions
inferred← citeshttps://doi.org/10.1016/0196-8858(84)90015-0openalex-snapshot
Equivalence of saddle-points and optima for non-concave programmes
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50002-8openalex-snapshot
Convex Sets. Convex and Generalized Convex Functions
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.01.024openalex-snapshot
γ-preinvexity and γ-invexity in mathematical programming
inferred← citeshttps://doi.org/10.1016/j.na.2019.111640openalex-snapshot
A necessary and sufficient condition on the equivalence between local and global optimal solutions in variational control problems
inferred← citeshttps://doi.org/10.1017/s0334270000005142openalex-snapshot
What is invexity?
inferred← citeshttps://doi.org/10.1017/s1446788700022126openalex-snapshot
Invex functions and duality
inferred← citeshttps://doi.org/10.1023/a:1021744309992openalex-snapshot
Subvexormal Functions and Subvex Functions
inferred← citeshttps://doi.org/10.1023/a:1023905907248openalex-snapshot
Characterization of Solution Sets of Quasiconvex Programs
inferred← citeshttps://doi.org/10.1080/02522667.1996.10699267openalex-snapshot
Various types of nonsmooth invex functions
inferred← citeshttps://doi.org/10.1080/03610929008830440openalex-snapshot
Invexity: an updated survey and new results for nonsmooth functions
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701055openalex-snapshot
Generalizedb-invex vector valued functions
inferred← citeshttps://doi.org/10.1080/10556788.2023.2189712openalex-snapshot
On a minimal criterion of efficiency in vector variational control problems
inferred← citeshttps://doi.org/10.3390/math7090829openalex-snapshot
On Locally and Globally Optimal Solutions in Scalar Variational Control Problems
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.