On the public citation graph

A linearization method for minimizing certain quasidifferentiable functions

https://doi.org/10.1007/bfb0121139
0 signed · 24 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/978-1-4613-9447-1_2openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1007/bf00933293openalex-snapshot
Approximation procedures based on the method of multipliers
inferredcites →https://doi.org/10.1007/bf00933357openalex-snapshot
Algorithms for a class of nondifferentiable problems
inferredcites →https://doi.org/10.1007/bf01391417openalex-snapshot
A quadratic approximation method for minimizing a class of quasidifferentiable functions
inferredcites →https://doi.org/10.1007/bf01584544openalex-snapshot
On the rate of convergence of certain methods of centers
inferredcites →https://doi.org/10.1007/bf01585095openalex-snapshot
Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
inferredcites →https://doi.org/10.1007/bfb0120960openalex-snapshot
A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
inferredcites →https://doi.org/10.1007/bfb0121138openalex-snapshot
An algorithm for minimizing a certain class of quasidifferentiable functions
inferredcites →https://doi.org/10.1016/b978-0-12-468660-1.50021-9openalex-snapshot
MINIMISATION DE FONCTIONS LOCALEMENT LIPSCHITZIENNES: APPLICATIONS A LA PROGRAMMATION MI-CONVEXE, MI-DIFFERENTIABLE
inferredcites →https://doi.org/10.1080/02331938308842828openalex-snapshot
On quasidifferentiable mappings
inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot
Optimization and Nonsmooth Analysis
inferredcites →https://doi.org/10.1287/moor.10.2.185openalex-snapshot
A Linearization Algorithm for Nonsmooth Minimization
inferredcites →https://doi.org/10.2140/pjm.1966.16.1openalex-snapshot
Minimization of functions having Lipschitz continuous first partial derivatives

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-0-387-89496-6_8openalex-snapshot
Algorithms of Quasidifferentiable Optimization for the Separation of Point Sets
inferred← citeshttps://doi.org/10.1007/978-1-4757-3137-8_2openalex-snapshot
Numerical Methods for Minimizing Quasidifferentiable Functions: A Survey and Comparison
inferred← citeshttps://doi.org/10.1007/978-3-7091-2624-0_2openalex-snapshot
Nonconvex Superpotentials and Hemivariational Inequalities. Quasidifferentiability in Mechanics
inferred← citeshttps://doi.org/10.1007/bf01443620openalex-snapshot
Descent methods for quasidifferentiable minimization
inferred← citeshttps://doi.org/10.1007/bf02192649openalex-snapshot
Convergence of the steepest descent method for minimizing quasiconvex functions
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:1014075113874openalex-snapshot
A method of truncated codifferential with application to some problems of cluster analysis
inferred← citeshttps://doi.org/10.1023/a:1023227716953openalex-snapshot
Continuous Subdifferential Approximations and Their Applications
inferred← citeshttps://doi.org/10.1080/10556780290027837openalex-snapshot
A Method for Minimization of Quasidifferentiable Functions
inferred← citeshttps://doi.org/10.1137/0910013openalex-snapshot
A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
inferred← citeshttps://doi.org/10.1137/s1052623499358951openalex-snapshot
Second-Order Algorithms for Generalized Finite and Semi-Infinite Min-Max Problems
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.