On the public citation graph

The potential method for conditional maxima in the locally compact metric spaces

https://doi.org/10.1007/bf02165588
0 signed · 26 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/bf02165238openalex-snapshot
La mèthode des centres dans un espace topologique
inferredcites →https://doi.org/10.1137/0115046openalex-snapshot
The Slacked Unconstrained Minimization Technique for Convex Programming
inferredcites →https://doi.org/10.1287/mnsc.10.2.360openalex-snapshot
The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method
inferredcites →https://doi.org/10.1287/mnsc.10.4.601openalex-snapshot
Computational Algorithm for the Sequential Unconstrained Minimization Technique for Nonlinear Programming

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-4757-2868-2_5openalex-snapshot
Exact Penalty Function Methods for Nonlinear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.1007/978-1-4757-2868-2_7openalex-snapshot
Numerical Methods for Semi-Infinite Programming: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4757-6019-4_7openalex-snapshot
Exact Penalty Functions for Nondifferentiable Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_6openalex-snapshot
Principles of Sequential Quadratic Programming Methods for Solving Nonlinear Programs
inferred← citeshttps://doi.org/10.1007/978-94-009-0369-2_8openalex-snapshot
Exact Penalty Methods
inferred← citeshttps://doi.org/10.1007/bf01083884openalex-snapshot
Approximation methods for the unconstrained optimization of functions of several variables
inferred← citeshttps://doi.org/10.1007/bf01189901openalex-snapshot
Exact barrier function methods for Lipschitz programs
inferred← citeshttps://doi.org/10.1007/bf01404687openalex-snapshot
A generalization of the potential method for conditional maxima on the Banach, reflexive spaces
inferred← citeshttps://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
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/bf02346160openalex-snapshot
On the exactness of a class of nondifferentiable penalty functions
inferred← citeshttps://doi.org/10.1007/bf02591681openalex-snapshot
An exact penalty function for semi-infinite programming
inferred← citeshttps://doi.org/10.1007/bfb0120980openalex-snapshot
Sufficient conditions for a globally exact penalty function without convexity
inferred← citeshttps://doi.org/10.1080/02331939108843701openalex-snapshot
Exact penalty functions and Lagrange multipliers
inferred← citeshttps://doi.org/10.1137/0311029openalex-snapshot
New Conditions for Exactness of a Simple Penalty Function
inferred← citeshttps://doi.org/10.1137/0317020openalex-snapshot
Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
inferred← citeshttps://doi.org/10.1137/0321010openalex-snapshot
On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
inferred← citeshttps://doi.org/10.1137/0710063openalex-snapshot
Constrained Optimization Using a Nondifferentiable Penalty Function
inferred← citeshttps://doi.org/10.1137/1035089openalex-snapshot
Semi-Infinite Programming: Theory, Methods, and Applications
inferred← citeshttps://doi.org/10.1137/s105262349427621xopenalex-snapshot
An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
inferred← citeshttps://doi.org/10.5802/ojmo.28openalex-snapshot
The continuous quadrant penalty formulation of logical constraints
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.