On the public citation graph

Methodes Duales pour le Calcul du Minimum d'une Fonction Convexe sur une Intersection de Convexes

https://doi.org/10.1007/bfb0066681
0 signed · 14 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.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1137/0108053openalex-snapshot
The Cutting-Plane Method for Solving Convex Programs
inferredcites →https://doi.org/10.1137/0304019openalex-snapshot
Nonlinear Programming: A Numerical Survey

What points at this work

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

inferred← citeshttps://doi.org/10.1002/mana.19760710109openalex-snapshot
Solving Optimization Problems with many Constraints by a Sequence of Subproblems Containing only two Constraints
inferred← citeshttps://doi.org/10.1007/3-540-07623-9_288openalex-snapshot
Eclatement de contraintes en parallele pour la minimisation d'une forme quadratique
inferred← citeshttps://doi.org/10.1007/bf01584087openalex-snapshot
Penalty function versus non-penalty function methods for constrained nonlinear programming problems
inferred← citeshttps://doi.org/10.1007/bf02612715openalex-snapshot
Decomposition through formalization in a product space
inferred← citeshttps://doi.org/10.1007/bfb0066683openalex-snapshot
Eclatement et Decentralisation en Calcul des Variations
inferred← citeshttps://doi.org/10.1007/bfb0079178openalex-snapshot
Un Algorithme Dual Pour le Calcul de la Distance Entre Deux Convexes
inferred← citeshttps://doi.org/10.1016/0021-9045(84)90068-6openalex-snapshot
Best approximation and optimization
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90174-9openalex-snapshot
The distance to a polyhedron
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)67353-1openalex-snapshot
Crossing of Algorithms in Decomposition Methods
inferred← citeshttps://doi.org/10.1137/s0363012902415487openalex-snapshot
An Outer Approximation Method for the Variational Inequality Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1804.09832openalex-snapshot
Linear programming on non-compact polytopes and the Kuratowski convergence with application in economics
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.