On the public citation graph
Asymptotic properties of sequences iteratively generated by point-to-set maps
0 signed · 34 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/bf00933379openalex-snapshot
On the structure of cluster point sets of iteratively generated sequences
inferredcites →https://doi.org/10.1007/bf01397369openalex-snapshot
A systematic approach to the synthesis of algorithms
inferredcites →https://doi.org/10.1007/bf01580449openalex-snapshot
Optimization algorithms and point-to-set-maps
inferredcites →https://doi.org/10.1016/0022-247x(75)90058-xopenalex-snapshot
A canonical structure for iterative procedures
inferredcites →https://doi.org/10.1016/0041-5553(63)90382-3openalex-snapshot
Gradient methods for the minimisation of functionals
inferredcites →https://doi.org/10.1016/s0022-0000(74)80035-8openalex-snapshot
Algorithm model for penalty functions-type iterative procedures
inferredcites →https://doi.org/10.1016/s0022-0000(76)80021-9openalex-snapshot
Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
inferredcites →https://doi.org/10.1051/m2an/196903r100171openalex-snapshot
On the convergence of optimization algorithms
inferredcites →https://doi.org/10.1051/m2an/1977110100611openalex-snapshot
Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes
inferredcites →https://doi.org/10.1090/s0002-9947-1951-0042109-4openalex-snapshot
Topologies on spaces of subsets
inferredcites →https://doi.org/10.1109/tac.1974.1100535openalex-snapshot
Introduction to linear and nonlinear programming
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/0315049openalex-snapshot
Convergence Conditions for a Type of Algorithm Model
inferredcites →https://doi.org/10.1137/1015073openalex-snapshot
Point-to-Set Maps in Mathematical Programming
inferredcites →https://doi.org/10.1215/s0012-7094-41-00838-4openalex-snapshot
A generalization of Brouwer’s fixed point theorem
inferredcites →https://doi.org/10.1287/mnsc.16.1.1openalex-snapshot
Convergence Conditions for Nonlinear Programming Algorithms
inferredcites →https://doi.org/10.1512/iumj.1969.18.18006openalex-snapshot
Calculus of Set Valued Functions and Control
inferredcites →https://doi.org/10.2307/1909424openalex-snapshot
Nonlinear Programming: A Unified Approach
inferredcites →https://doi.org/10.2307/2005025openalex-snapshot
Solution of Equations and Systems of Equations
inferredcites →https://doi.org/10.2307/2005111openalex-snapshot
Computational Methods in Optimization: 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-1-4613-3400-2_9openalex-snapshot
Parallel Cost Approximation Algorithms for Differentiable Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-61347-0_3openalex-snapshot
Algorithms for Extracting Convergent Subsequences
inferred← citeshttps://doi.org/10.1007/978-3-642-69909-2_2openalex-snapshot
Tatonnement Processes with Set-Valued Excess-Demand
inferred← citeshttps://doi.org/10.1007/978-3-662-41526-9_8openalex-snapshot
On Invariance and Periodicity Properties in Set-Valued Processes
inferred← citeshttps://doi.org/10.1007/bfb0120953openalex-snapshot
Asymptotic properties of reduction methods applying linearly equality constrained reduced problems
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50018-5openalex-snapshot
APPROXIMATION AND CONVERGENCE IN NONLINEAR OPTIMIZATION
inferred← citeshttps://doi.org/10.1023/a:1018358602892openalex-snapshot
Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets
inferred← citeshttps://doi.org/10.1080/00207728808547141openalex-snapshot
Cluster points and stability
inferred← citeshttps://doi.org/10.1137/s105262349427577xopenalex-snapshot
Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs
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.