On the public citation graph

An exponential penalty method for nondifferentiable minimax problems with general constraints

https://doi.org/10.1007/bf00933227
0 signed · 25 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.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/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1016/0041-5553(66)90114-5openalex-snapshot
Constrained minimization methods
inferredcites →https://doi.org/10.1016/0041-5553(72)90002-xopenalex-snapshot
Numerical methods for finding saddle points
inferredcites →https://doi.org/10.1016/c2009-0-19672-1openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1016/c2013-0-11400-6openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0312048openalex-snapshot
An Interior Penalty Method for Minimax Problems with Constraints
inferredcites →https://doi.org/10.1137/0312052openalex-snapshot
A Class of Exponential Penalty Functions
inferredcites →https://doi.org/10.1137/1.9781611971255openalex-snapshot
Nonlinear Programming
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis

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-3-642-57014-8_11openalex-snapshot
Convergence Analysis of a Perturbed Version of the θ — Scheme of Glowinski-Le Tallec
inferred← citeshttps://doi.org/10.1007/bf01204180openalex-snapshot
The perturbed proximal point algorithm and some of its applications
inferred← citeshttps://doi.org/10.1007/bf01582220openalex-snapshot
Asymptotic analysis of the exponential penalty trajectory in linear programming
inferred← citeshttps://doi.org/10.1007/bf01919289openalex-snapshot
On penalty methods for minimax problems
inferred← citeshttps://doi.org/10.1007/bf02190058openalex-snapshot
Stable exponential-penalty algorithm with superlinear convergence
inferred← citeshttps://doi.org/10.1007/s40840-016-0340-4openalex-snapshot
Vector Exponential Penalty Function Method for Nondifferentiable Multiobjective Programming Problems
inferred← citeshttps://doi.org/10.1016/0005-1098(82)90024-3openalex-snapshot
A new solution to optimization-satisfaction problems by a penalty method
inferred← citeshttps://doi.org/10.1016/j.amc.2011.01.051openalex-snapshot
A new exact exponential penalty function method and nonconvex mathematical programming
inferred← citeshttps://doi.org/10.1017/s0263574715000521openalex-snapshot
Indirect solution of optimal control problems with state variable inequality constraints: finite difference approximation
inferred← citeshttps://doi.org/10.1051/m2an/1994280201891openalex-snapshot
The perturbed Tikhonov's algorithm and some of its applications
inferred← citeshttps://doi.org/10.1109/tac.1981.1102607openalex-snapshot
A new computational method for Stackelberg and min-max problems by use of a penalty method
inferred← citeshttps://doi.org/10.1115/1.3426439openalex-snapshot
International Bibliographies
inferred← citeshttps://doi.org/10.1287/moor.22.1.43openalex-snapshot
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
inferred← citeshttps://doi.org/10.68381/jca07010openalex-snapshot
Absolute Minimizer in Convex Programming by Exponential Penalty
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.