On the public citation graph

Morse theory for some lower-C 2 functions in finite dimension

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/978-3-642-45610-7_3openalex-snapshot
Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions
inferredcites →https://doi.org/10.1007/978-3-642-46564-2_5openalex-snapshot
On Regular Semi-Infinite Optimization
inferredcites →https://doi.org/10.1007/bf00937167openalex-snapshot
Convexification procedures and decomposition methods for nonconvex optimization problems
inferredcites →https://doi.org/10.1007/bf01580764openalex-snapshot
Approximation and decomposition properties of some classes of locally D.C. functions
inferredcites →https://doi.org/10.1090/pspum/018.1openalex-snapshot
Nonlinear Functional Analysis
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1137/0514020openalex-snapshot
On Functions Representable as a Supremum of a Family of Smooth Functions
inferredcites →https://doi.org/10.1137/0517068openalex-snapshot
On Functions Representable As a Supremum of a Family of Smooth Functions II
inferredcites →https://doi.org/10.1287/moor.1.2.97openalex-snapshot
Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
inferredcites →https://doi.org/10.1287/moor.10.4.612openalex-snapshot
A Note on Differentiability of Global Optimal Values
inferredcites →https://doi.org/10.1287/moor.8.2.231openalex-snapshot
Strong and Weak Convexity of Sets and Functions
inferredcites →https://doi.org/10.2307/1971148openalex-snapshot
On the Number of Periodic Trajectories for a Hamiltonian Flow on a Convex Energy Surface
inferredcites →https://doi.org/10.2307/2005191openalex-snapshot
Necessary Conditions for an Extremum
inferredcites →https://doi.org/10.24033/msmf.264openalex-snapshot
Méthode de descente sur un fermé non convexe

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-540-37007-9_23openalex-snapshot
Rambling Through Local Versions of Generalized Convex Functions and Generalized Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_13openalex-snapshot
Some Links Between Approximation, Nonsmooth Analysis, Penalization and Regularization
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_6openalex-snapshot
Nonconvex Optimization and Its Structural Frontiers
inferred← citeshttps://doi.org/10.1007/bf01455151openalex-snapshot
Critical point theory for smooth functions on Hilbert manifolds with singularities and its application to some optimal control problems
inferred← citeshttps://doi.org/10.1007/bf02055198openalex-snapshot
On parametric nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02111558openalex-snapshot
Morse theory and Lyusternik-Shnirelman theory in geometric control theory
inferred← citeshttps://doi.org/10.1007/bf02192180openalex-snapshot
Endogenous cycles with small discounting in multisector optimal growth models: Continuous-time case
inferred← citeshttps://doi.org/10.1007/bf02193459openalex-snapshot
Endogenous cycles in discrete symmetric multisector optimal growth models
inferred← citeshttps://doi.org/10.1007/bf02463278openalex-snapshot
On Morse Theory for Piecewise Smooth Functions
inferred← citeshttps://doi.org/10.1007/s10898-012-9964-6openalex-snapshot
Characterization and recognition of d.c. functions
inferred← citeshttps://doi.org/10.1007/s10958-000-0003-7openalex-snapshot
Morse lemmas for smooth functions on manifolds with corners
inferred← citeshttps://doi.org/10.1016/0021-9045(91)90062-fopenalex-snapshot
Towards minimal assumptions for the infimal convolution regularization
inferred← citeshttps://doi.org/10.1016/0362-546x(95)91645-6openalex-snapshot
Continuous selections of linear functions and nonsmooth critical point theory
inferred← citeshttps://doi.org/10.1016/j.geomphys.2023.105020openalex-snapshot
Nonsmooth manifold decompositions
inferred← citeshttps://doi.org/10.1016/j.na.2003.09.017openalex-snapshot
On the qualitative approximation of Lipschitzian functions
inferred← citeshttps://doi.org/10.1016/j.na.2011.07.003openalex-snapshot
Characterization of d.c. functions in terms of quasidifferentials
inferred← citeshttps://doi.org/10.1023/a:1008233531797openalex-snapshot
On the Minimization of Difference Functions
inferred← citeshttps://doi.org/10.1137/07070913xopenalex-snapshot
A Proximal Average for Nonconvex Functions: A Proximal Stability Perspective
inferred← citeshttps://doi.org/10.1155/jom/5115517openalex-snapshot
Operational Properties of SCN Function, Optimization Condition, and Exactness of Penalty Function for SCN Optimization
inferred← citeshttps://doi.org/10.23952/jnva.7.2023.1.07openalex-snapshot
Optimization conditions and decomposable algorithms for convertible nonconvex optimization
inferred← citeshttps://doi.org/10.4064/sm184-1-1openalex-snapshot
Paraconvex functions and paraconvex sets
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.