On the public citation graph
Robust Approximate Optimality Conditions for Uncertain Nonsmooth Optimization with Infinite Number of Constraints
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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-04900-2openalex-snapshot
Conjugate Duality in Convex Optimization
inferredcites →https://doi.org/10.1007/bfb0120986openalex-snapshot
Necessary conditions for ε-optimality
inferredcites →https://doi.org/10.1007/s10013-018-0283-1openalex-snapshot
Complete Characterizations of Robust Strong Duality for Robust Vector Optimization Problems
inferredcites →https://doi.org/10.1007/s101070100286openalex-snapshot
Robust optimization ? methodology and applications
inferredcites →https://doi.org/10.1007/s10957-008-9475-2openalex-snapshot
ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints
inferredcites →https://doi.org/10.1007/s10957-014-0564-0openalex-snapshot
Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty
inferredcites →https://doi.org/10.1007/s10957-017-1136-xopenalex-snapshot
A Unifying Approach to Robust Convex Infinite Optimization Duality
inferredcites →https://doi.org/10.1007/s10957-018-1256-yopenalex-snapshot
Characterizations for Optimality Conditions of General Robust Optimization Problems
inferredcites →https://doi.org/10.1007/s11117-012-0186-4openalex-snapshot
On $${\epsilon}$$ -solutions for convex optimization problems with uncertainty data
inferredcites →https://doi.org/10.1007/s11117-017-0549-yopenalex-snapshot
On approximate solutions for robust convex semidefinite optimization problems
inferredcites →https://doi.org/10.1007/s11228-012-0219-yopenalex-snapshot
Robust Duality in Parametric Convex Optimization
inferredcites →https://doi.org/10.1007/s11590-016-1067-8openalex-snapshot
On quasi $$\epsilon $$ ϵ -solution for robust convex optimization problems
inferredcites →https://doi.org/10.1007/s11590-017-1187-9openalex-snapshot
Characterizations of robust solution set of convex programs with uncertain data
inferredcites →https://doi.org/10.1007/s40305-017-0167-1openalex-snapshot
Optimality Conditions of Approximate Solutions for Nonsmooth Semi-infinite Programming Problems
inferredcites →https://doi.org/10.1016/j.ejor.2017.08.003openalex-snapshot
On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization
inferredcites →https://doi.org/10.1016/j.jmaa.2014.01.033openalex-snapshot
Regularity conditions characterizing Fenchel–Lagrange duality and Farkas-type results in DC infinite programming
inferredcites →https://doi.org/10.1016/j.na.2010.04.020openalex-snapshot
Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
inferredcites →https://doi.org/10.1016/j.na.2016.01.002openalex-snapshot
Optimality and duality for robust multiobjective optimization problems
inferredcites →https://doi.org/10.1023/a:1022606002804openalex-snapshot
Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
inferredcites →https://doi.org/10.1137/080739124openalex-snapshot
Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
inferredcites →https://doi.org/10.1137/100791841openalex-snapshot
Strong Duality in Robust Convex Programming: Complete Characterizations
inferredcites →https://doi.org/10.11650/tjm/180603openalex-snapshot
An Approach to $\epsilon$-duality Theorems for Nonconvex Semi-infinite Multiobjective Optimization Problems
inferredcites →https://doi.org/10.3934/jimo.2016047openalex-snapshot
Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
inferredcites →https://doi.org/10.4134/bkms.2014.51.1.287openalex-snapshot
ON NONSMOOTH OPTIMALITY THEOREMS FOR ROBUST OPTIMIZATION PROBLEMS
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10898-022-01134-2openalex-snapshot
Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
inferred← citeshttps://doi.org/10.1007/s10957-019-01496-wopenalex-snapshot
Dual Approaches to Characterize Robust Optimal Solution Sets for a Class of Uncertain Optimization Problems
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-021-01785-2openalex-snapshot
Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
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.1016/j.cam.2021.113426openalex-snapshot
Fenchel–Lagrange duality for DC infinite programs with inequality constraints
inferred← citeshttps://doi.org/10.1051/ro/2019070openalex-snapshot
Regularity conditions and Farkas-type results for systems with fractional functions
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.2020.1763990openalex-snapshot
Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
inferred← citeshttps://doi.org/10.1155/2019/8657463openalex-snapshot
Optimal Pricing Strategies in a Product and Service Supply Chain with Extended Warranty Service Competition considering Retailer Fairness Concern
inferred← citeshttps://doi.org/10.1155/2020/6093545openalex-snapshot
A Further Study on Multiperiod Health Diagnostics Methodology under a Single-Valued Neutrosophic Set
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.2298/yjor201017013popenalex-snapshot
Optimality conditions and duality for multiobjective semi-infinite programming with data uncertainty via Mordukhovich subdifferential
inferred← citeshttps://doi.org/10.3390/math8030398openalex-snapshot
Robust Design Optimization for Low-Cost Concrete Box-Girder Bridge
inferred← citeshttps://doi.org/10.3934/jimo.2021019openalex-snapshot
Optimality conditions of fenchel-lagrange duality and farkas-type results for composite dc infinite programs
inferred← citeshttps://doi.org/10.3934/jimo.2024043openalex-snapshot
Local isolated efficiency in non-smooth robust semi-infinite multi-objective 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.