On the public citation graph
Optimality conditions for piecewise smooth functions
0 signed · 31 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/bf01588325openalex-snapshot
First and second order conditions for a class of nondifferentiable optimization problems
inferredcites →https://doi.org/10.1007/bf01588951openalex-snapshot
On optimality conditions in nondifferentiable programming
inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot
A method of conjugate subgradients for minimizing nondifferentiable functions
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
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-1-4614-4340-7_4openalex-snapshot
Piecewise Differentiable Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-46823-0_13openalex-snapshot
Automatic Directional Differentiation of Nonsmooth Composite Functions
inferred← citeshttps://doi.org/10.1007/bf00940037openalex-snapshot
On the rate of convergence of two minimax algorithms
inferred← citeshttps://doi.org/10.1007/bf00940574openalex-snapshot
An algorithm for composite nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf00962796openalex-snapshot
Optimality conditions for piecewiseC 2 nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf01580725openalex-snapshot
Second-order necessary conditions in semismooth optimization
inferred← citeshttps://doi.org/10.1007/bf01581171openalex-snapshot
Discontinuous piecewise linear optimization
inferred← citeshttps://doi.org/10.1007/bf01588789openalex-snapshot
A successive quadratic programming method for a class of constrained nonsmooth optimization problems
inferred← citeshttps://doi.org/10.1007/bf02591697openalex-snapshot
Local properties of inexact methods for minimizing nonsmooth composite functions
inferred← citeshttps://doi.org/10.1007/bf02592016openalex-snapshot
Second order necessary and sufficient conditions for convex composite NDO
inferred← citeshttps://doi.org/10.1007/bfb0007549openalex-snapshot
Numerical Methods for Minimax Dynamic Optimal Control Problem with Discrete Time
inferred← citeshttps://doi.org/10.1007/bfb0120960openalex-snapshot
A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
inferred← citeshttps://doi.org/10.1007/bfb0121142openalex-snapshot
On the expressibility of piecewise-linear continuous functions as the difference of two piecewise-linear convex functions
inferred← citeshttps://doi.org/10.1007/s10107980029aopenalex-snapshot
Properties of the Moreau-Yosida regularization of a piecewise C2 convex function
inferred← citeshttps://doi.org/10.1016/0362-546x(90)90005-2openalex-snapshot
Piecewise Ck functions in nonsmooth analysis
inferred← citeshttps://doi.org/10.1017/s0334270000005191openalex-snapshot
Concise representation of generalised gradients
inferred← citeshttps://doi.org/10.1023/a:1022503820909openalex-snapshot
Convergence Analysis of a Class of Nonlinear Penalization Methods for Constrained Optimization via First-Order Necessary Optimality Conditions
inferred← citeshttps://doi.org/10.1080/02331934.2022.2103417openalex-snapshot
On continuous selections of polynomial functions
inferred← citeshttps://doi.org/10.1109/cdc.1996.572917openalex-snapshot
A reduced-complexity bundle method for maximizing concave nonsmooth functions
inferred← citeshttps://doi.org/10.1287/moor.13.4.660openalex-snapshot
Second-Order Sufficient Conditions in Nonsmooth Optimization
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.