On the public citation graph
A cone separation theorem
0 signed · 34 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-46216-0openalex-snapshot
Convexity and Optimization in Finite Dimensions I
inferredcites →https://doi.org/10.1007/bf00932614openalex-snapshot
Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
inferredcites →https://doi.org/10.1007/bf00934453openalex-snapshot
The structure of admissible points with respect to cone dominance
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.1996.0251openalex-snapshot
Duality for Vector Optimization of Set-Valued Functions
inferred← citeshttps://doi.org/10.1007/978-1-4471-3084-0openalex-snapshot
Energy-Efficient Train Control
inferred← citeshttps://doi.org/10.1007/978-1-4612-2666-6_6openalex-snapshot
Generalized Tradeoff Directions in Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1007/bf00934353openalex-snapshot
Proper efficiency with respect to cones
inferred← citeshttps://doi.org/10.1007/bf01415907openalex-snapshot
Approximation of the efficient point set by perturbation of the ordering cone
inferred← citeshttps://doi.org/10.1007/bf01585738openalex-snapshot
Value functions, domination cones and proper efficiency in multicriteria optimization
inferred← citeshttps://doi.org/10.1007/s10013-020-00416-0openalex-snapshot
Approximate Proper Solutions in Vector Equilibrium Problems
inferred← citeshttps://doi.org/10.1007/s101070100282openalex-snapshot
On generalized trade-off directions in nonconvex multiobjective optimization
inferred← citeshttps://doi.org/10.1007/s10898-025-01474-9openalex-snapshot
Applying augmented weak subdifferentials and normal cones for nonconvex mathematical programming problems
inferred← citeshttps://doi.org/10.1007/s10957-014-0644-1openalex-snapshot
On the Density of Henig Efficient Points in Locally Convex Topological Vector Spaces
inferred← citeshttps://doi.org/10.1007/s10957-018-01468-6openalex-snapshot
An Extension of the Kaliszewski Cone to Non-polyhedral Pointed Cones in Infinite-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/s10957-025-02836-9openalex-snapshot
Symmetric and Non-symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
inferred← citeshttps://doi.org/10.1007/s11590-021-01722-3openalex-snapshot
Stability analysis of conically perturbed linearly constrained least-squares problems by optimizing the regularized trajectories
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90312-0openalex-snapshot
Lexicographical separation in Rn
inferred← citeshttps://doi.org/10.1016/0967-0661(94)91851-1openalex-snapshot
224 Energy-efficient train control
inferred← citeshttps://doi.org/10.1016/j.orl.2019.09.011openalex-snapshot
Separation theorems for nonconvex sets and application in optimization
inferred← citeshttps://doi.org/10.1080/02331934.2020.1812602openalex-snapshot
Proper efficiency, scalarization and transformation in multi-objective optimization: unified approaches
inferred← citeshttps://doi.org/10.1080/02331938908843501openalex-snapshot
Approximating families of cones and proper efficiency in vector optimization
inferred← citeshttps://doi.org/10.1137/0323041openalex-snapshot
A Characterization of Properly Minimal Elements of a Set
inferred← citeshttps://doi.org/10.1137/070694089openalex-snapshot
A Nonlinear Cone Separation Theorem and Scalarization in Nonconvex Vector Optimization
inferred← citeshttps://doi.org/10.1137/19m1246286openalex-snapshot
Limit Behavior of Approximate Proper Solutions in Vector Optimization
inferred← citeshttps://doi.org/10.1137/22m1542003openalex-snapshot
Nonlinear Cone Separation Theorems in Real Topological Linear Spaces
inferred← citeshttps://doi.org/10.23952/asvao.6.2024.2.08openalex-snapshot
Optimality conditions for nonconvex mathematical programming problems using weak subdifferentials and augmented normal cones
inferred← citeshttps://doi.org/10.23952/jano.1.2019.2.03openalex-snapshot
A Henig conical regularization approach for circumventing the Slater conundrum in linearly $\ell_{+}^{p}$-constrained least squares problems
inferred← citeshttps://doi.org/10.23952/jnva.6.2022.6.03openalex-snapshot
Approximate efficiency in set-valued optimization with variable order
inferred← citeshttps://doi.org/10.23952/jnva.8.2024.4.08openalex-snapshot
Nonlinear strict cone separation theorems in real normed spaces
inferred← citeshttps://doi.org/10.33993/jnaat371-873openalex-snapshot
Some cone separation results and applications
inferred← citeshttps://doi.org/10.68381/jca21001openalex-snapshot
Conic Separation of Finite Sets. I: The homogeneous case
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.