On the public citation graph

ε-optimality criteria for convex programming problems via exact penalty functions

https://doi.org/10.1007/bf01580901
0 signed · 32 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/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/bf01681332openalex-snapshot
Necessary and sufficient conditions for a penalty method to be exact
inferredcites →https://doi.org/10.1007/bf02591938openalex-snapshot
Exact penalty functions and stability in locally Lipschitz programming
inferredcites →https://doi.org/10.1007/bf02592056openalex-snapshot
Penalty functions in ε-programming and ε-minimax problems
inferredcites →https://doi.org/10.1007/bf02594782openalex-snapshot
ε-Optimal solutions in nondifferentiable convex programming and some related questions
inferredcites →https://doi.org/10.1007/bfb0120986openalex-snapshot
Necessary conditions for ε-optimality
inferredcites →https://doi.org/10.1137/0323003openalex-snapshot
Sufficiency of Exact Penalty Minimization
inferredcites →https://doi.org/10.1287/mnsc.13.5.344openalex-snapshot
Non-Linear Programming Via Penalty Functions
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.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.1002/9780470400531.eorms0810openalex-snapshot
Nonlinear Multiobjective Programming
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-3-642-21114-0_8openalex-snapshot
Optimality Conditions for Approximate Solutions of Convex Semi-Infinite Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10898-004-5904-4openalex-snapshot
Multiplier Rules and Saddle-Point Theorems for Helbig’s Approximate Solutions in Convex Pareto Problems
inferred← citeshttps://doi.org/10.1007/s10957-007-9235-8openalex-snapshot
Cone Characterizations of Approximate Solutions in Real Vector Optimization
inferred← citeshttps://doi.org/10.1007/s10957-008-9403-5openalex-snapshot
Duality for ε-Variational Inequality
inferred← citeshttps://doi.org/10.1007/s10957-008-9475-2openalex-snapshot
ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints
inferred← citeshttps://doi.org/10.1007/s11117-017-0549-yopenalex-snapshot
On approximate solutions for robust convex semidefinite optimization problems
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/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/01630560500538789openalex-snapshot
ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
inferred← citeshttps://doi.org/10.1080/01630560903499845openalex-snapshot
ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
inferred← citeshttps://doi.org/10.1080/02331939808844406openalex-snapshot
ε-approximate solutions in multiobjective optimization
inferred← citeshttps://doi.org/10.1155/2007/19323openalex-snapshot
Generalized Augmented Lagrangian Problem and Approximate Optimal Solutions in Nonlinear Programming
inferred← citeshttps://doi.org/10.1155/2011/175327openalex-snapshot
"Equation missing" <!-- No EquationSource Format="TEX", only image -->-Optimal Solutions in Nonconvex Semi-Infinite Programs with Support Functions
inferred← citeshttps://doi.org/10.11650/tjm.13.2009.416openalex-snapshot
On -OPTIMALITY CONDITIONS FOR CONVEX SET-VALUED OPTIMIZATION PROBLEMS
inferred← citeshttps://doi.org/10.11650/tjm/240705openalex-snapshot
Approximate Optimality Conditions for Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.11650/twjm/1500405613openalex-snapshot
On $\epsilon$-OPTIMALITY CONDITIONS FOR CONVEX SET-VALUED OPTIMIZATION PROBLEMS
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
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.