On the public citation graph
Definitheitsbedingungen für relative Extrema bei Optimierungs- und Approximationsaufgaben
0 signed · 69 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.19660460544openalex-snapshot
G. Meinardus, Approximation von Funktionen und ihre numerische Behandlung. (Springer Tracts in Natural Philosophy, Ergebnisse der angewandten Mathematik, Vol. 4) VIII + 180 S. m. 21 Abb. Berlin/Göttingen/Heidelberg/New York 1964. Springer‐Verlag. Preis geb. DM 49,–
inferredcites →https://doi.org/10.1007/978-3-0348-0439-4_12openalex-snapshot
Second Order Conditions for Constrained Minima
inferredcites →https://doi.org/10.1007/978-3-0348-5881-6_34openalex-snapshot
Lösungsschranken bei Elliptischen Differentialgleichungen
inferredcites →https://doi.org/10.1007/978-3-642-85646-4openalex-snapshot
Approximation von Funktionen und ihre numerische Behandlung
inferredcites →https://doi.org/10.1007/bf02277454openalex-snapshot
Lokal optimale Schranken bei Randwertaufgaben
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6009-xopenalex-snapshot
Foundations of Modern Analysis
inferredcites →https://doi.org/10.1137/0115056openalex-snapshot
Second Order Conditions for Constrained Minima
inferredcites →https://doi.org/10.2307/2003660openalex-snapshot
International Series of Numerical Mathematics
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_39openalex-snapshot
Bilevel Programming: Optimality Conditions and Duality
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_447openalex-snapshot
Semi-Infinite Programming: Second Order Optimality Conditions
inferred← citeshttps://doi.org/10.1007/0-387-34221-4_10openalex-snapshot
A semi-infinite approach to design centering
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_213openalex-snapshot
Generalized Semi-infinite Programming: Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_47openalex-snapshot
Bilevel Programming: Optimality Conditions and Duality
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_589openalex-snapshot
Semi-infinite Programming: Second Order Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_623openalex-snapshot
Smoothing Methods for Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_2openalex-snapshot
On Stability and Deformation in Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_4openalex-snapshot
First and Second Order Optimality Conditions and Perturbation Analysis of Semi-Infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_213-1openalex-snapshot
Generalized Semi-infinite Programming: Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_589-1openalex-snapshot
Semi-infinite Programming: Second Order Optimality Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_623-1openalex-snapshot
Smoothing Methods for Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-5997-4_11openalex-snapshot
On Decomposition and Structural Stability in Non-Convex Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-6253-0_12openalex-snapshot
On the Local Structure of the Feasible Set in Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-0348-6285-1_14openalex-snapshot
H-Mengen und Minimalbedingungen bei Approximationsproblemen
inferred← citeshttps://doi.org/10.1007/978-3-319-12583-1_23openalex-snapshot
Multiobjective Semi-infinite Optimization: Convexification and Properly Efficient Points
inferred← citeshttps://doi.org/10.1007/978-3-642-46329-7_11openalex-snapshot
Charakterisierung Lokaler Pareto-Optima
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_5openalex-snapshot
On Regular Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-48417-9_10openalex-snapshot
Second Order Analysis in Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-51682-5_11openalex-snapshot
Stability of Stationary Solutions in Semi-Infinite Optimization via the Reduction Approach
inferred← citeshttps://doi.org/10.1007/978-3-662-02851-3_6openalex-snapshot
Nonconvex Optimization and Its Structural Frontiers
inferred← citeshttps://doi.org/10.1007/bf00933151openalex-snapshot
Higher-order necessary conditions in abstract mathematical programming
inferred← citeshttps://doi.org/10.1007/bf00934484openalex-snapshot
Higher-order necessary conditions for infinite and semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/bf00939841openalex-snapshot
Semi-infinite optimization: Structure and stability of the feasible set
inferred← citeshttps://doi.org/10.1007/bf01189030openalex-snapshot
Second-order necessary and sufficient optimality conditions for minimizing a sup-type function
inferred← citeshttps://doi.org/10.1007/bf01419533openalex-snapshot
Kriterien erster und zweiter Ordnung f�r lokal beste Approximationen bei Problemen mit Nebenbedingungen
inferred← citeshttps://doi.org/10.1007/bf01436923openalex-snapshot
Kriterien zweiter Ordnung f�r lokal beste Approximationen
inferred← citeshttps://doi.org/10.1007/bf01588788openalex-snapshot
Second order necessary optimality conditions for minimizing a sup-type function
inferred← citeshttps://doi.org/10.1007/bf02055190openalex-snapshot
Suggested research topics in sensitivity and stability analysis for semi-infinite programming problems
inferred← citeshttps://doi.org/10.1007/bf02055198openalex-snapshot
On parametric nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02578994openalex-snapshot
On generalized semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bfb0003882openalex-snapshot
Necessary conditions of higher order for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bfb0006502openalex-snapshot
Semi-infinite programming: Conditions of optimality and applications
inferred← citeshttps://doi.org/10.1007/bfb0087410openalex-snapshot
A newton-method for nonlinear Chebyshev approximation
inferred← citeshttps://doi.org/10.1007/s101070050095openalex-snapshot
On existence and uniqueness of stationary points in semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/s10898-007-9232-3openalex-snapshot
Smoothing by mollifiers. Part I: semi-infinite optimization
inferred← citeshttps://doi.org/10.1007/s10898-011-9753-7openalex-snapshot
On saddle points in nonconvex semi-infinite programming
inferred← citeshttps://doi.org/10.1007/s11590-007-0069-yopenalex-snapshot
Generalized semi-infinite programming: the Symmetric Reduction Ansatz
inferred← citeshttps://doi.org/10.1016/0021-9045(73)90066-xopenalex-snapshot
Nonlinear Chebyshev approximation by H-polynomials
inferred← citeshttps://doi.org/10.1016/0021-9045(76)90114-3openalex-snapshot
Chebyshev approximation by H-polynomials: A numerical method
inferred← citeshttps://doi.org/10.1016/j.cam.2007.02.012openalex-snapshot
Generalized semi-infinite programming: A tutorial
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.06.009openalex-snapshot
How to solve a semi-infinite optimization problem
inferred← citeshttps://doi.org/10.1017/s033427000000775xopenalex-snapshot
On the topology of parametric optimal control
inferred← citeshttps://doi.org/10.1080/02331930008844493openalex-snapshot
On level sets of marginal functions
inferred← citeshttps://doi.org/10.1080/02331934.2017.1282955openalex-snapshot
On duality in multiobjective semi-infinite optimization
inferred← citeshttps://doi.org/10.1080/02331938708843230openalex-snapshot
On sufficient conditions for local optimality in semi-infinite programming
inferred← citeshttps://doi.org/10.1080/02331939508844106openalex-snapshot
Second order optimality conditions for generalized semi-infinite programming problems
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701064openalex-snapshot
Generalized semi-infinite optimization : theory and applications in optimal control and discrete optimization
inferred← citeshttps://doi.org/10.1080/10556780903483349openalex-snapshot
Infinite kernel learning via infinite and semi-infinite programming
inferred← citeshttps://doi.org/10.1137/060657741openalex-snapshot
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/0805031openalex-snapshot
Local Convergence of SQP Methods in Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1137/s0363012901398393openalex-snapshot
Solving Semi-Infinite Optimization Problems with Interior Point Techniques
inferred← citeshttps://doi.org/10.1137/s1052623496306760openalex-snapshot
Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
inferred← citeshttps://doi.org/10.4208/jcm.v24.n6.p719openalex-snapshot
On Karush-Kuhn-Tucker Points for a Smoothing Method in Semi-Infinite Optimization
inferred← citeshttps://doi.org/10.68381/jca09039openalex-snapshot
On the Topology of Generalized Semi-Infinite Optimization
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.