On the public citation graph

Necessary optimality conditions and saddle points for approximate optimization in banach spaces

0 signed · 44 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.1006/jmaa.1994.1144openalex-snapshot

Generalized Differential Calculus for Nonsmooth and Set-Valued Mappings

inferredcites →https://doi.org/10.1007/978-3-030-42760-3openalex-snapshot

Introduction to the Theory of Nonlinear Optimization

inferredcites →https://doi.org/10.1007/978-3-642-02431-3openalex-snapshot

Variational Analysis

inferredcites →https://doi.org/10.1007/978-3-662-03271-8openalex-snapshot

Introduction to the Theory of Nonlinear Optimization

inferredcites →https://doi.org/10.1007/bf00940466openalex-snapshot

?-duality theorem of nondifferentiable nonconvex multiobjective 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/bfb0089089openalex-snapshot

Convex Functions, Monotone Operators and Differentiability

inferredcites →https://doi.org/10.1007/bfb0120986openalex-snapshot

Necessary conditions for ε-optimality

inferredcites →https://doi.org/10.1023/a:1017960629124openalex-snapshot

Approximate Optimal Solutions and Nonlinear Lagrangian Functions*

inferredcites →https://doi.org/10.1051/jphystap:019020010017801openalex-snapshot

Comptes rendus de l'Académie des Sciences

inferredcites →https://doi.org/10.1080/01630569408816574openalex-snapshot

∊ -gradients pour les ponctions localements lipschitziennes et applications

inferredcites →https://doi.org/10.1080/02331930108844524openalex-snapshot

An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗

inferredcites →https://doi.org/10.1090/s0002-9947-96-01543-7openalex-snapshot

Nonsmooth sequential analysis in Asplund spaces

inferredcites →https://doi.org/10.1137/1.9781611971309openalex-snapshot

Optimization and Nonsmooth Analysis

inferredcites →https://doi.org/10.1137/s0363012900374816openalex-snapshot

Necessary Suboptimality and Optimality Conditions via Variational Principles

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10107-020-01597-9openalex-snapshot

A unified concept of approximate and quasi efficient solutions and associated subdifferentials in multiobjective optimization

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/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-017-1199-8openalex-snapshot

Approximate Optimality and Approximate Duality for Quasi Approximate Solutions in Robust Convex Semidefinite Programs

inferred← citeshttps://doi.org/10.1007/s11117-024-01032-9openalex-snapshot

Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications

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/s11750-020-00546-1openalex-snapshot

Optimality conditions for approximate proper solutions in multiobjective optimization with polyhedral cones

inferred← citeshttps://doi.org/10.1007/s11750-026-00716-7openalex-snapshot

A note on constraint qualification for saddle point conditions involving convex and linear affine functions

inferred← citeshttps://doi.org/10.1007/s40324-016-0063-3openalex-snapshot

Optimality conditions for approximate quasi efficiency in set-valued equilibrium problems

inferred← citeshttps://doi.org/10.1007/s40324-016-0099-4openalex-snapshot

Approximate quasi efficiency of set-valued optimization problems via weak subdifferential

inferred← citeshttps://doi.org/10.1016/j.jmaa.2011.12.050openalex-snapshot

Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems

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.1080/01630560802099274openalex-snapshot

Two Types of Approximate Saddle Points

inferred← citeshttps://doi.org/10.1080/01630563.2019.1660891openalex-snapshot

Characterizations of Approximate Duality and Saddle Point Theorems for Nonsmooth Robust Vector Optimization

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.2021.1871730openalex-snapshot

Characterizations of robust ε -quasi optimal solutions for nonsmooth optimization problems with uncertain data

inferred← citeshttps://doi.org/10.1155/2011/175327openalex-snapshot

"Equation missing" -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.1201/b11156-14openalex-snapshot

Representation of the Feasible Set and KKT Conditions

inferred← citeshttps://doi.org/10.1360/ssm-2024-0250openalex-snapshot

Duality on approximate solutions of nonconvex vector optimization problems

inferred← citeshttps://doi.org/10.2298/fil2216615gopenalex-snapshot

Gerstewitz nonlinear scalar functional and the applications in vector optimization problems

inferred← citeshttps://doi.org/10.23952/jnva.7.2023.5.03openalex-snapshot

Further results on quasi efficient solutions in multiobjective optimization

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.3934/jimo.2012.8.749openalex-snapshot

Lagrange multiplier rules for approximate solutions in vector optimization

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.