On the public citation graph
A method for the minimization of almost-differentiable functions
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.
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/bf01068281openalex-snapshot
A class of almost-differentiable functions and a minimization method for functions of this class
inferredcites →https://doi.org/10.1007/bf01068520openalex-snapshot
Convergence conditions for nonlinear programming algorithms
inferredcites →https://doi.org/10.1201/9781003064848openalex-snapshot
Necessary Conditions for an Extremum
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781394372539.ch6openalex-snapshot
Contemporary Stochastic Quasi‐gradient Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-04630-9_5openalex-snapshot
Randomization in Robustness, Estimation, and Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-34910-3_12openalex-snapshot
Bundle Methods for Inexact Data
inferred← citeshttps://doi.org/10.1007/978-3-642-45767-8_7openalex-snapshot
On Constrained Discontinuous Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-68874-4_19openalex-snapshot
Generalized Gradient Methods of Nondifferentiable Optimization Employing Space Dilatation Operations
inferred← citeshttps://doi.org/10.1007/bf01069305openalex-snapshot
Methods of minimizing functions that satisfy a Lipschitz condition, averaging the directions of descent
inferred← citeshttps://doi.org/10.1007/bf01069307openalex-snapshot
Nonlocal minimization algorithms of nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01069353openalex-snapshot
Analog of the method of feasible directions in minimization of nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/bf01069396openalex-snapshot
Conditions of convergence of combined algorithms of nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf01069850openalex-snapshot
Properties of functions satisfying a local Lipschitz condition
inferred← citeshttps://doi.org/10.1007/bf01073313openalex-snapshot
Algorithm for the minimization of discontinuous functions
inferred← citeshttps://doi.org/10.1007/bf01207125openalex-snapshot
An analog of the method of linearization in problems of minimizing nondifferentiable functions
inferred← citeshttps://doi.org/10.1007/s10107-020-01536-8openalex-snapshot
Steklov convexification and a trajectory method for global optimization of multivariate quartic polynomials
inferred← citeshttps://doi.org/10.1007/s10107-022-01866-9openalex-snapshot
Zeroth-order optimization with orthogonal random directions
inferred← citeshttps://doi.org/10.1007/s10589-013-9547-6openalex-snapshot
A derivative-free approximate gradient sampling algorithm for finite minimax problems
inferred← citeshttps://doi.org/10.1007/s10589-015-9762-4openalex-snapshot
A proximal bundle method for nonsmooth nonconvex functions with inexact information
inferred← citeshttps://doi.org/10.1007/s11228-016-0394-3openalex-snapshot
Computing Proximal Points of Convex Functions with Inexact Subgradients
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.110020openalex-snapshot
Robustness and averaging properties of a large-amplitude, high-frequency extremum seeking control scheme
inferred← citeshttps://doi.org/10.1016/j.sysconle.2023.105481openalex-snapshot
Nonsmooth optimization by Lie bracket approximations into random directions
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00541-0openalex-snapshot
Solving variational inequality problems via smoothing-nonsmooth reformulations
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.1016/s0927-0507(89)01008-xopenalex-snapshot
Chapter VII Nondifferentiable optimization
inferred← citeshttps://doi.org/10.1080/02331934.2025.2586210openalex-snapshot
Local convergence analysis for nonisolated solutions to derivative-free methods of optimization
inferred← citeshttps://doi.org/10.1080/10556788.2011.638923openalex-snapshot
Derivative-free optimization methods for finite minimax problems
inferred← citeshttps://doi.org/10.1093/imanum/drs027openalex-snapshot
Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
inferred← citeshttps://doi.org/10.1109/tac.2023.3334999openalex-snapshot
Nonlocal Nonholonomic Source Seeking Despite Local Extrema
inferred← citeshttps://doi.org/10.1137/s0363012992238369openalex-snapshot
The Minimization of Semicontinuous Functions: Mollifier Subgradients
inferred← citeshttps://doi.org/10.34229/1028-0979-2024-2-6openalex-snapshot
Сучасні стохастичні квазіградієнтні алгоритми оптимізації
inferred← citeshttps://doi.org/10.34229/2707-451x.20.1.1openalex-snapshot
A Stochastic Smoothing Method for Nonsmooth Global Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1611.00724openalex-snapshot
Computing proximal points of convex functions with inexact subgradients
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.