On the public citation graph
A proximal point algorithm for control approximation problems
0 signed · 28 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.1002/zamm.19750550729openalex-snapshot
A. Göpfert, Mathematische Optimierung in allgemeinen Vektorräumen. (Mathematisch‐Naturwissenschaftliche Bibliothek, Band 58). 216 S. m. 21 Abb. Leipzig 1973. BSB B. G. Teubner Verlagsgesellschaft. Preis brosch. 19,50 M
inferredcites →https://doi.org/10.1002/zamm.19800600812openalex-snapshot
Zeidler, E., Vorlesungen über nichtlineare Funktionalanalysis. III: Variationsmethoden und Optimierung. Teubner‐Texte zur Mathematik. Leipzig, BSB B. G. Teubner Verlagsgesellschaft, 1978. 239 S., 54 Abb., 19, – M. Best.‐Nr. 6658676
inferredcites →https://doi.org/10.1007/bf01415910openalex-snapshot
Generalization and sharpening of some duality relations for a class of vector optimization problems
inferredcites →https://doi.org/10.1007/bf01448388openalex-snapshot
Partial inverse of a monotone operator
inferredcites →https://doi.org/10.1007/bf01586091openalex-snapshot
Applications of the method of partial inverses to convex programming: Decomposition
inferredcites →https://doi.org/10.1007/bf02592080openalex-snapshot
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
inferredcites →https://doi.org/10.1016/0377-2217(85)90006-2openalex-snapshot
Geometrical properties of the Fermat-Weber problem
inferredcites →https://doi.org/10.1016/0898-1221(81)90082-1openalex-snapshot
The Weber problem revisited
inferredcites →https://doi.org/10.1051/ro/1988220403131openalex-snapshot
A primal-dual algorithm for a constrained Fermat-Weber problem involving mixed norms
inferredcites →https://doi.org/10.1080/02331938308842896openalex-snapshot
Zur vektoriellen linearen Tschebyscheff-Approximation
inferredcites →https://doi.org/10.1111/j.1467-9787.1984.tb01033.xopenalex-snapshot
A DUAL APPROACH FOR OBTAINING LOWER BOUNDS TO THE WEBER PROBLEM*
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.2748/tmj/1178227459openalex-snapshot
Another proof of the defect relation for moving targets
inferredcites →https://doi.org/10.4064/-14-1-35-45openalex-snapshot
Upper and lower bounds for minimal norm problems under linear constraints
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asjc.154openalex-snapshot
Proximal point method for optimal control processes governed by ordinary differential equations
inferred← citeshttps://doi.org/10.1007/978-3-030-37822-6_7openalex-snapshot
An Optimization Problems with a Composite Objective Function
inferred← citeshttps://doi.org/10.1007/978-3-322-81539-2_14openalex-snapshot
Standortprobleme in der Landschaftsgestaltung
inferred← citeshttps://doi.org/10.1007/978-3-642-57311-8_7openalex-snapshot
Maximal Point Theorems in Product Spaces and Applications for Multicriteria Approximation Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-59132-7_1openalex-snapshot
An Algorithm for Vectorial Control Approximation Problems
inferred← citeshttps://doi.org/10.1007/s001860200261openalex-snapshot
Strong convergence of a proximal-based method for convex optimization
inferred← citeshttps://doi.org/10.1007/s11590-009-0172-3openalex-snapshot
A partial complement method for approximating solutions of a primal dual fixed-point problem
inferred← citeshttps://doi.org/10.1016/b978-0-12-814788-7.00009-6openalex-snapshot
Convex Programming
inferred← citeshttps://doi.org/10.1016/b978-0-12-814788-7.00012-6openalex-snapshot
Optimal Control of Hybrid and Switched Systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-814788-7.00014-xopenalex-snapshot
Applications of the Relaxation-Based Approach
inferred← citeshttps://doi.org/10.1080/02331934.2019.1662419openalex-snapshot
Efficiencies and Pareto efficiencies of set-valued mappings on ordered spaces
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.