On the public citation graph

Algorithms for a class of nondifferentiable problems

https://doi.org/10.1007/bf00933357
0 signed · 30 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/bf00932905openalex-snapshot
On the convergence properties of second-order multiplier methods
inferredcites →https://doi.org/10.1007/bf00933161openalex-snapshot
Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
inferredcites →https://doi.org/10.1007/bf00933293openalex-snapshot
Approximation procedures based on the method of multipliers
inferredcites →https://doi.org/10.1007/bf01580395openalex-snapshot
Superlinearly convergent variable metric algorithms for general nonlinear programming problems
inferredcites →https://doi.org/10.1007/bf01580662openalex-snapshot
Mathematical programming study 3
inferredcites →https://doi.org/10.1007/bf01584320openalex-snapshot
Optimization of lipschitz continuous functions
inferredcites →https://doi.org/10.1007/bf01588967openalex-snapshot
Algorithms for nonlinear constraints that use lagrangian functions
inferredcites →https://doi.org/10.1007/bfb0120696openalex-snapshot
Nondifferentiable optimization via approximation
inferredcites →https://doi.org/10.1016/0005-1098(76)90077-7openalex-snapshot
Multiplier methods: A survey
inferredcites →https://doi.org/10.1016/0041-5553(68)90089-xopenalex-snapshot
Differentiability of a maximum function. I
inferredcites →https://doi.org/10.1016/0041-5553(69)90061-5openalex-snapshot
Minimization of unsmooth functionals
inferredcites →https://doi.org/10.1016/0041-5553(71)90094-2openalex-snapshot
The convergence rate of the penalty function method
inferredcites →https://doi.org/10.1090/s0002-9947-1975-0367131-6openalex-snapshot
Generalized Gradients and Applications
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
inferredcites →https://doi.org/10.1137/0311049openalex-snapshot
A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
inferredcites →https://doi.org/10.1137/0313030openalex-snapshot
Combined Primal-Dual and Penalty Methods for Constrained Minimization
inferredcites →https://doi.org/10.1137/0314017openalex-snapshot
On Penalty and Multiplier Methods for Constrained Minimization
inferredcites →https://doi.org/10.1137/0315037openalex-snapshot
Dual Variable Metric Algorithms for Constrained Optimization
inferredcites →https://doi.org/10.2172/1453943openalex-snapshot
Numerical Methods for Nonlinearly 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/bf00933293openalex-snapshot
Approximation procedures based on the method of multipliers
inferred← citeshttps://doi.org/10.1007/bf01391417openalex-snapshot
A quadratic approximation method for minimizing a class of quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bfb0121138openalex-snapshot
An algorithm for minimizing a certain class of quasidifferentiable functions
inferred← citeshttps://doi.org/10.1007/bfb0121139openalex-snapshot
A linearization method for minimizing certain quasidifferentiable functions
inferred← citeshttps://doi.org/10.1016/b978-0-12-093480-5.50010-6openalex-snapshot
References
inferred← citeshttps://doi.org/10.1017/9781009428095.021openalex-snapshot
Convex Optimization Theory
inferred← citeshttps://doi.org/10.1023/a:1008660924636openalex-snapshot
First-Order Algorithms for Generalized Semi-Infinite Min-Max Problems
inferred← citeshttps://doi.org/10.1023/a:1022627226891openalex-snapshot
Smooth Transformation of the Generalized Minimax Problem
inferred← citeshttps://doi.org/10.1080/02331938608843159openalex-snapshot
Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
inferred← citeshttps://doi.org/10.1137/s1052623499358951openalex-snapshot
Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
inferred← citeshttps://doi.org/10.21236/ada135072openalex-snapshot
Control Strategies for Complex Systems for Use in Aerospace Avionics.
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.