On the public citation graph

Nonlocal minimization algorithms of nondifferentiable functions

0 signed · 23 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/bf01068282openalex-snapshot

Convergence conditions of a minimization method of almost-differentiable functions

inferredcites →https://doi.org/10.1007/bf01068677openalex-snapshot

The quasigradient method for the solving of the nonlinear programming problems

inferredcites →https://doi.org/10.1007/bf01071397openalex-snapshot

A method for the minimization of almost-differentiable functions

inferredcites →https://doi.org/10.1007/bf01584320openalex-snapshot

Optimization of lipschitz continuous functions

inferredcites →https://doi.org/10.1007/bf01585533openalex-snapshot

Note on a method of conjugate subgradients for minimizing nondifferentiable functions

inferredcites →https://doi.org/10.1007/bf01585534openalex-snapshot

Note on an extension of “Davidon” methods to nondifferentiable functions

inferredcites →https://doi.org/10.1007/bfb0120703openalex-snapshot

A method of conjugate subgradients for minimizing nondifferentiable functions

inferredcites →https://doi.org/10.1137/0311049openalex-snapshot

A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals

inferredcites →https://doi.org/10.1287/moor.2.2.191openalex-snapshot

An Algorithm for Constrained Optimization with Semismooth Functions

inferredcites →https://doi.org/10.2307/2005981openalex-snapshot

Introduction to Minimax

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf01070609openalex-snapshot

Method of generalized gradient descent

inferred← citeshttps://doi.org/10.1007/bf01078907openalex-snapshot

Necessary and sufficient conditions for convergence of iteration algorithms of nonlinear programming

inferred← citeshttps://doi.org/10.1007/bf01099354openalex-snapshot

Generalized-differentiable functions

inferred← citeshttps://doi.org/10.1007/bf02742069openalex-snapshot

Stochastic generalized gradient method for nonconvex nonsmooth stochastic optimization

inferred← citeshttps://doi.org/10.1007/s10107-025-02245-wopenalex-snapshot

Inexact subgradient methods for semialgebraic functions

inferred← citeshttps://doi.org/10.1007/s10559-020-00240-xopenalex-snapshot

Generalized Gradients in Dynamic Optimization, Optimal Control, and Machine Learning Problems*

inferred← citeshttps://doi.org/10.1007/s10559-021-00397-zopenalex-snapshot

Stochastic Generalized Gradient Methods for Training Nonconvex Nonsmooth Neural Networks

inferred← citeshttps://doi.org/10.1007/s10957-024-02551-xopenalex-snapshot

Weak Convexity and Approximate Subdifferentials

inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00395-5openalex-snapshot

On nonsmooth and discontinuous problems of stochastic systems optimization

inferred← citeshttps://doi.org/10.1023/b:casa.0000012091.84864.65openalex-snapshot

Solution of Nonconvex Nonsmooth Stochastic Optimization Problems

inferred← citeshttps://doi.org/10.1109/tnet.2007.896227openalex-snapshot

Distributed Optimal Self-Organization in Ad Hoc Wireless Sensor Networks

inferred← citeshttps://doi.org/10.1137/19m1298147openalex-snapshot

Pathological Subgradient Dynamics

inferred← citeshttps://doi.org/10.1137/22m1479178openalex-snapshot

Subgradient sampling for nonsmooth nonconvex minimization

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.