On the public citation graph
Path-following proximal approach for solving Ill-posed convex semi-infinite programming problems
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.
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.19790590621openalex-snapshot
Ekeland, I. / Temam, R., Convex Analysis and Variational Problems. Amsterdam‐Oxford. North‐Holland Publ. Company. 1976. IX, 402 S., Dfl. 85.00. US $ 29.50 (SMAA 1)
inferredcites →https://doi.org/10.1007/978-3-322-93108-5openalex-snapshot
Numerische Methoden der Approximation und semi-infiniten Optimierung
inferredcites →https://doi.org/10.1007/bf01582234openalex-snapshot
Critical sets in parametric optimization
inferredcites →https://doi.org/10.1007/bfb0121212openalex-snapshot
On imbedding and parametric optimization—A concept of a globally convergent algorithm for nonlinear optimization problems
inferredcites →https://doi.org/10.1016/0045-7825(89)90053-4openalex-snapshot
Modern homotopy methods in optimization
inferredcites →https://doi.org/10.1016/c2009-0-19672-1openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1080/02331939208843853openalex-snapshot
A regularized penalty method for solving convex semi-infinite programs
inferredcites →https://doi.org/10.1109/9.29441openalex-snapshot
A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
inferredcites →https://doi.org/10.1137/0314056openalex-snapshot
Monotone Operators and the Proximal Point Algorithm
inferredcites →https://doi.org/10.1137/0330032openalex-snapshot
Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
inferredcites →https://doi.org/10.1137/0803047openalex-snapshot
A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
inferredcites →https://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferredcites →https://doi.org/10.2307/2153009openalex-snapshot
Advances in Numerical Partial Differential Equations and Optimization.
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_204openalex-snapshot
Sensitivity and stability in NLP ILL-POSED VARIATIONAL PROBLEMS
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_446openalex-snapshot
Semi-Infinite Programming: Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_273openalex-snapshot
Ill-posed Variational Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_588openalex-snapshot
Semi-infinite Programming: Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-1-4613-0287-2_25openalex-snapshot
Proximal Methods for Variational Inequalities with Set-Valued Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_273-1openalex-snapshot
Ill-posed Variational Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_588-1openalex-snapshot
Semi-infinite Programming: Numerical Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-45780-7_8openalex-snapshot
Stable Solution of Variational Inequalities with Composed Monotone Operators
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_1openalex-snapshot
Equilibrium Programming Problems: Prox-Regularization and Prox-Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_10openalex-snapshot
Multi–Step Proximal Method for Variational Inequalities with Monotone Operators
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00327-2openalex-snapshot
Linear semi-infinite programming theory: An updated survey
inferred← citeshttps://doi.org/10.1137/s0363012998333116openalex-snapshot
Proximal Point Approach and Approximation of Variational Inequalities
inferred← citeshttps://doi.org/10.1360/03ys0197openalex-snapshot
Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
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.