On the public citation graph

Penalty functions in ε-programming and ε-minimax problems

https://doi.org/10.1007/bf02592056
0 signed · 33 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/bf01442140openalex-snapshot
On equiwellset minimum problems
inferredcites →https://doi.org/10.1007/bf01584647openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf01588250openalex-snapshot
Exact penalty functions in nonlinear programming
inferredcites →https://doi.org/10.1007/bf02594782openalex-snapshot
ε-Optimal solutions in nondifferentiable convex programming and some related questions
inferredcites →https://doi.org/10.1007/bfb0006503openalex-snapshot
On equiwellset minimum problems
inferredcites →https://doi.org/10.1007/bfb0120986openalex-snapshot
Necessary conditions for ε-optimality
inferredcites →https://doi.org/10.1016/0022-247x(74)90025-0openalex-snapshot
On the variational principle
inferredcites →https://doi.org/10.1016/0362-546x(82)90087-6openalex-snapshot
An application of Ekeland's theorem to minimax problems
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
inferredcites →https://doi.org/10.1287/moor.9.4.576openalex-snapshot
A Minimax Theorem
inferredcites →https://doi.org/10.7146/math.scand.a-11878openalex-snapshot
Lipschitz $r$-continuity of the approximative subdifferential of a convex function.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1099-1360(199612)5:4<271::aid-mcda114>3.0.co;2-wopenalex-snapshot
Approximately Efficient Solutions in Vector Optimization
inferred← citeshttps://doi.org/10.1006/jmaa.1996.0080openalex-snapshot
ϵ-Pareto Optimality for Nondifferentiable Multiobjective Programming via Penalty Function
inferred← citeshttps://doi.org/10.1007/978-94-015-8472-2_9openalex-snapshot
Well-Posedness for Nash Equilibria and Related Topics
inferred← citeshttps://doi.org/10.1007/bf00940327openalex-snapshot
?-Duality theorem of nondifferentiable nonconvex multiobjective programming
inferred← citeshttps://doi.org/10.1007/bf00940328openalex-snapshot
?-Duality theorem of nondifferentiable nonconvex multiobjective programming
inferred← citeshttps://doi.org/10.1007/bf00940466openalex-snapshot
?-duality theorem of nondifferentiable nonconvex multiobjective programming
inferred← citeshttps://doi.org/10.1007/bf01580901openalex-snapshot
ε-optimality criteria for convex programming problems via exact penalty functions
inferred← citeshttps://doi.org/10.1007/bf02578991openalex-snapshot
Necessary optimality conditions and saddle points for approximate optimization in banach spaces
inferred← citeshttps://doi.org/10.1007/s11590-014-0780-4openalex-snapshot
Characterizations of the approximate solution sets of nonsmooth optimization problems and its applications
inferred← citeshttps://doi.org/10.1007/s40096-014-0128-3openalex-snapshot
Sequential optimality conditions for multiobjective fractional programming problems
inferred← citeshttps://doi.org/10.1016/0022-247x(89)90247-3openalex-snapshot
Convergence of approximate saddle points
inferred← citeshttps://doi.org/10.1016/s0898-1221(99)00105-4openalex-snapshot
ε-Optimality and duality for multiobjective fractional programming
inferred← citeshttps://doi.org/10.1023/a:1017960629124openalex-snapshot
Approximate Optimal Solutions and Nonlinear Lagrangian Functions*
inferred← citeshttps://doi.org/10.1080/00207168908803698openalex-snapshot
An algorithm for a constrained saddle point problem via an exact penalty method
inferred← citeshttps://doi.org/10.1080/01630569408816574openalex-snapshot
∊ -gradients pour les ponctions localements lipschitziennes et applications
inferred← citeshttps://doi.org/10.1080/02331939408844028openalex-snapshot
One-sided derivative of min max and saddle points with respect to a parameter*
inferred← citeshttps://doi.org/10.1080/02331939808844406openalex-snapshot
ε-approximate solutions in multiobjective optimization
inferred← citeshttps://doi.org/10.1109/cdc.1992.371152openalex-snapshot
Derivatives of saddle points under relaxed assumptions
inferred← citeshttps://doi.org/10.11650/twjm/1500407131openalex-snapshot
ɛ-OPTIMALITY AND DUALITY FOR FRACTIONAL PROGRAMMING
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.1515/9783110811919.443openalex-snapshot
Bibliography
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.