On the public citation graph
On the minimization of nondifferentiable functions
0 signed · 22 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/bf01071708openalex-snapshot
The penalty method in convex 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/978-1-4614-4211-0_2openalex-snapshot
Optimization Methods and Their Efficient Use
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_2openalex-snapshot
Advances in Low-Memory Subgradient Optimization
inferred← citeshttps://doi.org/10.1007/bf01069478openalex-snapshot
Minimax approach to forecasting individual economic indicators
inferred← citeshttps://doi.org/10.1007/bf01069664openalex-snapshot
Convergence of algorithms for finding saddle points
inferred← citeshttps://doi.org/10.1007/bf01070027openalex-snapshot
On the solution of two-stage stochastic problems with nonconvex functions
inferred← citeshttps://doi.org/10.1007/bf01070686openalex-snapshot
Convergence rate of a generalized gradient method
inferred← citeshttps://doi.org/10.1007/bf01071091openalex-snapshot
On the method of generalized stochastic gradients and quasi-F�jer sequences
inferred← citeshttps://doi.org/10.1007/bf01071594openalex-snapshot
Complex systems and the solution of extremal problems
inferred← citeshttps://doi.org/10.1007/bf01082482openalex-snapshot
Investigation of optimization methods and their applications
inferred← citeshttps://doi.org/10.1007/bf01091662openalex-snapshot
Minimization methods with constraints
inferred← citeshttps://doi.org/10.1007/bf01588952openalex-snapshot
Nonlinear programming methods in the presence of noise
inferred← citeshttps://doi.org/10.1007/bf01681332openalex-snapshot
Necessary and sufficient conditions for a penalty method to be exact
inferred← citeshttps://doi.org/10.1007/s10559-012-9388-9openalex-snapshot
Arithmetic modeling of random processes and r-algorithms
inferred← citeshttps://doi.org/10.1016/0041-5553(72)90113-9openalex-snapshot
Maximin search by the method of discrepancies
inferred← citeshttps://doi.org/10.1080/02331939508844053openalex-snapshot
Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993
inferred← citeshttps://doi.org/10.12732/ijpam.v102i3.13openalex-snapshot
A SUBGRADIENT METHODS FOR NON-SMOOTH VECTOR OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.23952/jano.4.2022.2.11openalex-snapshot
Superiorization with a projected subgradient method
inferred← citeshttps://doi.org/10.3390/su13020857openalex-snapshot
Robust Management of Systemic Risks and Food-Water-Energy-Environmental Security: Two-Stage Strategic-Adaptive GLOBIOM Model
inferred← citeshttps://doi.org/10.4171/jems/1285openalex-snapshot
Long term dynamics of the subgradient method for Lipschitz path differentiable functions
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.