On the public citation graph

Necessary conditions for ε-optimality

https://doi.org/10.1007/bfb0120986
0 signed · 99 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/1-4020-0611-x_682openalex-snapshot
Nonlinear programming
inferredcites →https://doi.org/10.1007/978-3-642-48294-6openalex-snapshot
Foundations of Optimization
inferredcites →https://doi.org/10.1007/bf00933162openalex-snapshot
On functions whose stationary points are global minima
inferredcites →https://doi.org/10.1016/0022-247x(74)90025-0openalex-snapshot
On the variational principle
inferredcites →https://doi.org/10.1137/0315061openalex-snapshot
Semismooth and Semiconvex Functions in Constrained Optimization
inferredcites →https://doi.org/10.1287/moor.1.2.165openalex-snapshot
A New Approach to Lagrange Multipliers
inferredcites →https://doi.org/10.1287/opre.11.3.399openalex-snapshot
Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

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/0-387-23639-2_16openalex-snapshot
ε-Optimality for Nonsmooth Programming on a Hilbert Space
inferred← citeshttps://doi.org/10.1007/978-1-4757-3623-6_13openalex-snapshot
Approximative Efficiency
inferred← citeshttps://doi.org/10.1007/978-3-540-92828-7_12openalex-snapshot
Interactive Decomposition-Coordination Methods for Complex Decision Problems
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/978-3-662-12603-5_14openalex-snapshot
On Duality Theory Related to Approximate Solutions of Vector-Valued Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-981-19-6406-0_14openalex-snapshot
Approximate Optimality Conditions for a Multi-objective Programming Problem
inferred← citeshttps://doi.org/10.1007/bf00936165openalex-snapshot
?-solutions in vector minimization problems
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/bf02592056openalex-snapshot
Penalty functions in ε-programming and ε-minimax problems
inferred← citeshttps://doi.org/10.1007/s00186-005-0007-7openalex-snapshot
ɛ-Subdifferentials of Set-valued Maps and ɛ-Weak Pareto Optimality for Multiobjective Optimization
inferred← citeshttps://doi.org/10.1007/s00186-023-00840-1openalex-snapshot
Directional and approximate efficiency in set optimization
inferred← citeshttps://doi.org/10.1007/s10473-020-0320-5openalex-snapshot
On Approximate Efficiency for Nonsmooth Robust Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10589-011-9443-xopenalex-snapshot
An inexact spectral bundle method for convex quadratic semidefinite programming
inferred← citeshttps://doi.org/10.1007/s10589-023-00485-0openalex-snapshot
Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
inferred← citeshttps://doi.org/10.1007/s10700-026-09482-4openalex-snapshot
Tackling uncertain data in solution methods of nonsmooth vector semi-infinite 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/s10898-012-9994-0openalex-snapshot
ε-Mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
inferred← citeshttps://doi.org/10.1007/s10898-021-01098-9openalex-snapshot
Generalized $${\varepsilon }$$-quasi solutions of set optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-022-01218-zopenalex-snapshot
A new global algorithm for factor-risk-constrained mean-variance portfolio selection
inferred← citeshttps://doi.org/10.1007/s10898-024-01415-yopenalex-snapshot
Optimality analysis for $$\epsilon $$-quasi solutions of optimization problems via $$\epsilon $$-upper convexificators: a dual approach
inferred← citeshttps://doi.org/10.1007/s10915-026-03465-8openalex-snapshot
Effective Algorithms for Optimal Portfolio Selection with Relative Marginal Risk Constraints
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/s10957-011-9891-6openalex-snapshot
Existence and Optimality Conditions for Approximate Solutions to Vector Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-017-1199-8openalex-snapshot
Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs
inferred← citeshttps://doi.org/10.1007/s10957-024-02461-yopenalex-snapshot
Output-Space Outer Approximation Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programs
inferred← citeshttps://doi.org/10.1007/s10957-025-02812-3openalex-snapshot
Pascoletti-Serafini Scalarizations for Approximate Quasi Efficient Solutions for Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11117-023-00971-zopenalex-snapshot
On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
inferred← citeshttps://doi.org/10.1007/s11117-024-01046-3openalex-snapshot
On $$\varepsilon $$-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
inferred← citeshttps://doi.org/10.1007/s11590-011-0352-9openalex-snapshot
Optimality conditions and duality on approximate solutions in vector optimization with arcwise connectivity
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/s11590-016-1067-8openalex-snapshot
On quasi $$\epsilon $$ ϵ -solution for robust convex optimization problems
inferred← citeshttps://doi.org/10.1007/s11590-018-1287-1openalex-snapshot
Optimality conditions for $${\varvec{\epsilon }}$$ ϵ -quasi solutions of optimization problems via $${\varvec{\epsilon }}$$ ϵ -upper convexificators with applications
inferred← citeshttps://doi.org/10.1007/s11590-018-1343-xopenalex-snapshot
Optimality conditions in convex optimization with locally Lipschitz constraints
inferred← citeshttps://doi.org/10.1007/s11590-019-01464-3openalex-snapshot
On approximate solutions and saddle point theorems for robust convex optimization
inferred← citeshttps://doi.org/10.1007/s11590-026-02310-zopenalex-snapshot
Stability for set optimization problems and applications
inferred← citeshttps://doi.org/10.1007/s12532-018-0142-9openalex-snapshot
New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
inferred← citeshttps://doi.org/10.1007/s12597-025-00971-5openalex-snapshot
$$\mathcal {E}$$-LU-optimal solution for nonsmooth semi-infinite interval-valued 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.1007/s40305-017-0167-1openalex-snapshot
Optimality Conditions of Approximate Solutions for Nonsmooth Semi-infinite Programming Problems
inferred← citeshttps://doi.org/10.1007/s40305-023-00489-xopenalex-snapshot
$$\varepsilon $$-Quasi-Weakly Solution for Semi-infinite Vector Optimization Problems with Data Uncertainty
inferred← citeshttps://doi.org/10.1007/s40306-019-00358-xopenalex-snapshot
Optimality Conditions for Approximate Pareto Solutions of a Nonsmooth Vector Optimization Problem with an Infinite Number of Constraints
inferred← citeshttps://doi.org/10.1007/s40324-021-00276-9openalex-snapshot
Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
inferred← citeshttps://doi.org/10.1007/s40840-024-01666-8openalex-snapshot
Approximate Optimal Solutions for Multiobjective Optimization Problems with Infinite Constraints
inferred← citeshttps://doi.org/10.1016/0066-4138(85)90035-7openalex-snapshot
Approximate solutions of vector optimization problems
inferred← citeshttps://doi.org/10.1016/0362-546x(86)90069-6openalex-snapshot
The drop theorem, the petal theorem and Ekeland's variational principle
inferred← citeshttps://doi.org/10.1016/j.cor.2013.02.011openalex-snapshot
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
inferred← citeshttps://doi.org/10.1016/j.na.2010.02.012openalex-snapshot
Generalized -quasi-solutions in multiobjective optimization problems: Existence results and optimality conditions
inferred← citeshttps://doi.org/10.1016/s0377-2217(03)00206-6openalex-snapshot
ε-optimality for multiobjective programming on a Banach space
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:1004657412928openalex-snapshot
∈-Weak Minimal Solutions of Vector Optimization Problems with Set-Valued Maps
inferred← citeshttps://doi.org/10.1023/a:1017960629124openalex-snapshot
Approximate Optimal Solutions and Nonlinear Lagrangian Functions*
inferred← citeshttps://doi.org/10.1051/ro/2024015openalex-snapshot
Approximate proper efficiencies in nonsmooth semi-infinite multiobjective optimization problems
inferred← citeshttps://doi.org/10.1051/ro/2026081openalex-snapshot
Deterministic characterizations of approximate solutions for nonsmooth nonconvex uncertain programs
inferred← citeshttps://doi.org/10.1080/00036811.2026.2720808openalex-snapshot
On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty
inferred← citeshttps://doi.org/10.1080/01630560500538789openalex-snapshot
ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
inferred← citeshttps://doi.org/10.1080/01630560802099274openalex-snapshot
Two Types of Approximate Saddle Points
inferred← citeshttps://doi.org/10.1080/01630569408816574openalex-snapshot
∊ -gradients pour les ponctions localements lipschitziennes et applications
inferred← citeshttps://doi.org/10.1080/02331934.2019.1579212openalex-snapshot
On approximate solutions for nonsmooth robust multiobjective optimization problems
inferred← citeshttps://doi.org/10.1080/02331934.2020.1763990openalex-snapshot
Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
inferred← citeshttps://doi.org/10.1080/02331934.2021.1871730openalex-snapshot
Characterizations of robust ε -quasi optimal solutions for nonsmooth optimization problems with uncertain data
inferred← citeshttps://doi.org/10.1080/02331939808844406openalex-snapshot
ε-approximate solutions in multiobjective optimization
inferred← citeshttps://doi.org/10.1080/10556788.2014.945448openalex-snapshot
Characterizing ϵ-properly efficient solutions
inferred← citeshttps://doi.org/10.1111/mafi.12383openalex-snapshot
Effective algorithms for optimal portfolio deleveraging problem with cross impact
inferred← citeshttps://doi.org/10.1137/s0363012900374816openalex-snapshot
Necessary Suboptimality and Optimality Conditions via Variational Principles
inferred← citeshttps://doi.org/10.1137/s1052623400371806openalex-snapshot
A Nonlinear Lagrangian Approach to Constrained Optimization Problems
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/180603openalex-snapshot
An Approach to $\epsilon$-duality Theorems for Nonconvex Semi-infinite Multiobjective 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.1186/1687-1812-2011-6openalex-snapshot
On ε-optimality conditions for multiobjective fractional optimization problems
inferred← citeshttps://doi.org/10.1186/s13660-017-1452-6openalex-snapshot
A new kind of inner superefficient points
inferred← citeshttps://doi.org/10.1186/s13660-018-1773-0openalex-snapshot
Approximate weakly efficient solutions of set-valued vector equilibrium problems
inferred← citeshttps://doi.org/10.1186/s13660-019-1997-7openalex-snapshot
On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
inferred← citeshttps://doi.org/10.1201/9781315152448-18openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.1515/ijb-2022-0061openalex-snapshot
A modified rule of three for the one-sided binomial confidence interval
inferred← citeshttps://doi.org/10.1515/taa-2021-0100openalex-snapshot
Approximate fixed points and fixed points for multi-valued almost E-contractions
inferred← citeshttps://doi.org/10.2478/candc-2023-0038openalex-snapshot
Continuous time non-smooth optimization through quasi efficiency
inferred← citeshttps://doi.org/10.2478/candc-2025-0010openalex-snapshot
Optimality conditions for ε-weak local quasi-efficient solutions of D.C. vector optimization problems
inferred← citeshttps://doi.org/10.3390/math10152763openalex-snapshot
Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems
inferred← citeshttps://doi.org/10.3390/math7010012openalex-snapshot
Robust Approximate Optimality Conditions for Uncertain Nonsmooth Optimization with Infinite Number of Constraints
inferred← citeshttps://doi.org/10.3934/jimo.2012.8.749openalex-snapshot
Lagrange multiplier rules for approximate solutions in vector optimization
inferred← citeshttps://doi.org/10.3934/jimo.2025069openalex-snapshot
Parametric characterization of approximate quasi solutions in the class of quasidifferentiable multiobjective fractional programming problems
inferred← citeshttps://doi.org/10.3934/math.2022132openalex-snapshot
On robust weakly $ \varepsilon $-efficient solutions for multi-objective fractional programming problems under data uncertainty
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.