On the public citation graph

Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms

https://doi.org/10.1007/bfb0120843
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/bf00932219openalex-snapshot
Implementation of gradient methods by tangential discretization
inferredcites →https://doi.org/10.1007/bf01580449openalex-snapshot
Optimization algorithms and point-to-set-maps
inferredcites →https://doi.org/10.1016/0022-247x(67)90139-4openalex-snapshot
On the continuity of the minimum set of a continuous function
inferredcites →https://doi.org/10.1016/b978-0-12-597050-1.50005-1openalex-snapshot
A Method of Centers by Upper-Bounding Functions with Applications
inferredcites →https://doi.org/10.1051/m2an/196802r100431openalex-snapshot
Programmation mathématique convexe
inferredcites →https://doi.org/10.1070/rm1971v026n03abeh003834openalex-snapshot
ON THE THEORY OF NON-LINEAR MINIMAX PROBLEMS
inferredcites →https://doi.org/10.1137/0308003openalex-snapshot
The Validity of a Family of Optimization Methods
inferredcites →https://doi.org/10.1137/0309039openalex-snapshot
Abstract Models for the Synthesis of Optimization Algorithms
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/1.9781611971255openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1137/1013001openalex-snapshot
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
inferredcites →https://doi.org/10.1137/1015073openalex-snapshot
Point-to-Set Maps in Mathematical Programming
inferredcites →https://doi.org/10.1287/opre.18.1.107openalex-snapshot
Stability in Nonlinear Programming
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.2307/1909227openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.2307/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.

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-3-642-61347-0_2openalex-snapshot
Decidability and Undecidability in the Limit
inferred← citeshttps://doi.org/10.1007/978-3-642-61347-0_3openalex-snapshot
Algorithms for Extracting Convergent Subsequences
inferred← citeshttps://doi.org/10.1007/bf01305758openalex-snapshot
Multivalued mappings
inferred← citeshttps://doi.org/10.1007/bf01396706openalex-snapshot
Algorithmes pour suites non convergentes
inferred← citeshttps://doi.org/10.1007/bf01587098openalex-snapshot
Global convergence of Rosen's gradient projection method
inferred← citeshttps://doi.org/10.1007/bf02007433openalex-snapshot
An overall study of convergence conditions for algorithms in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02007671openalex-snapshot
Remarks on the convergence of Rosen's gradient projection method
inferred← citeshttps://doi.org/10.1007/bf02007672openalex-snapshot
Discussion on the convergence of Rosen's gradient projection method
inferred← citeshttps://doi.org/10.1007/bf02592021openalex-snapshot
A convergence theorem of Rosen’s gradient projection method
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90223-3openalex-snapshot
Continuousization of the family of point-to-set maps and its applications
inferred← citeshttps://doi.org/10.1109/tac.2024.3447809openalex-snapshot
Robust Data-Driven Control of Discrete-Time Linear Systems With Errors in Variables
inferred← citeshttps://doi.org/10.1109/tac.2025.3545766openalex-snapshot
Analysis of Input-Affine Dynamical Systems Using Parameterized Robust Counterparts
inferred← citeshttps://doi.org/10.17760/d20487158openalex-snapshot
Safety quantification for nonlinear and time-delay systems using occupation measures
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.