On the public citation graph
On minimizing the sum of a convex function and a concave function
0 signed · 27 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/978-3-642-45567-4_7openalex-snapshot
Global Minimization of a Difference of Two Convex Functions
inferredcites →https://doi.org/10.1007/bfb0121159openalex-snapshot
Global minimization of a difference of two convex functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_417openalex-snapshot
Quasidifferentiable Optimization: Codifferentiable Functions
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_547openalex-snapshot
Quasidifferentiable Optimization: Codifferentiable Functions
inferred← citeshttps://doi.org/10.1007/978-1-4613-0275-9_18openalex-snapshot
Optimal Design and Identification Problems in Nonsmooth Mechanics
inferred← citeshttps://doi.org/10.1007/978-1-4613-0307-7_3openalex-snapshot
Multilevel Optimization Methods in Mechanics
inferred← citeshttps://doi.org/10.1007/978-1-4615-4113-4_6openalex-snapshot
Nonsmooth Optimization Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4615-4113-4_7openalex-snapshot
Nonsmooth Computational Mechanics
inferred← citeshttps://doi.org/10.1007/978-1-4615-5829-3_2openalex-snapshot
Applied Nonconvex Optimization Background
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-030-54621-2_547-1openalex-snapshot
Quasidifferentiable Optimization: Codifferentiable Functions
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/bf00370562openalex-snapshot
Numerical treatment of hemivariational inequalities in mechanics: two methods based on the solution of convex subproblems
inferred← citeshttps://doi.org/10.1007/bf01100082openalex-snapshot
Quasidifferentiability in nonsmooth, nonconvex mechanics
inferred← citeshttps://doi.org/10.1007/bf01176649openalex-snapshot
New types of variational principles based on the notion of quasidifferentiability
inferred← citeshttps://doi.org/10.1007/bf01196953openalex-snapshot
Nonsmooth and nonconvex structural analysis algorithms based on difference convex optimization techniques
inferred← citeshttps://doi.org/10.1007/bf01443620openalex-snapshot
Descent methods for quasidifferentiable minimization
inferred← citeshttps://doi.org/10.1016/0045-7825(94)90119-8openalex-snapshot
A new class of multilevel decomposition algorithms for non monotone problems based on the quasidifferentiability concept
inferred← citeshttps://doi.org/10.1080/10556780290027837openalex-snapshot
A Method for Minimization of Quasidifferentiable Functions
inferred← citeshttps://doi.org/10.1080/10556788.2013.854358openalex-snapshot
A proximal alternating linearization method for nonconvex optimization problems
inferred← citeshttps://doi.org/10.1080/10556789608805644openalex-snapshot
Difference convex optimization techniques in nonsmooth computational mechanics
inferred← citeshttps://doi.org/10.3182/20110828-6-it-1002.02999openalex-snapshot
On optimal damping of vibrating structures
inferred← citeshttps://doi.org/10.47852/bonviewjcce3202474openalex-snapshot
A Modified Hooke–Jeeves Algorithm in Two-Player Nonlinear Static Game: With an Application in Forest Management
inferred← citeshttps://doi.org/10.48550/arxiv.1105.0276openalex-snapshot
Proximal methods for minimizing the sum of a convex function and a composite function
inferred← citeshttps://doi.org/10.48550/arxiv.2004.13617openalex-snapshot
Adversarial Learning Guarantees for Linear Hypotheses and Neural Networks
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.