On the public citation graph
Characterizing global optimality for DC optimization problems under convex inequality constraints
0 signed · 50 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-1-4615-2025-2openalex-snapshot
Handbook of Global Optimization
inferredcites →https://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferredcites →https://doi.org/10.1007/978-1-4684-9369-6openalex-snapshot
Geometric Functional Analysis and its Applications
inferredcites →https://doi.org/10.1007/978-1-4757-6019-4_13openalex-snapshot
From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality
inferredcites →https://doi.org/10.1007/978-3-662-02796-7openalex-snapshot
Convex analysis and minimization algorithms
inferredcites →https://doi.org/10.1007/978-94-009-5796-1openalex-snapshot
Mathematical Programming and Control Theory
inferredcites →https://doi.org/10.1007/bf00939737openalex-snapshot
Zero duality gaps in infinite-dimensional programming
inferredcites →https://doi.org/10.1007/bf01100690openalex-snapshot
Calculus rules for global approximate minima and applications to approximate subdifferential calculus
inferredcites →https://doi.org/10.1007/bf01581074openalex-snapshot
Generalizations of Slater's constraint qualification for infinite convex programs
inferredcites →https://doi.org/10.1007/bf01582061openalex-snapshot
A Farkas lemma for difference sublinear systems and quasidifferentiable programming
inferredcites →https://doi.org/10.1007/bfb0000035openalex-snapshot
Constrained Global Optimization: Algorithms and Applications
inferredcites →https://doi.org/10.1016/0022-247x(79)90098-2openalex-snapshot
On systems of convex inequalities
inferredcites →https://doi.org/10.1016/0893-9659(93)90097-7openalex-snapshot
A new version of Farkas' lemma and global convex maximization
inferredcites →https://doi.org/10.1023/a:1008365206132openalex-snapshot
Conditions for Global Optimality 2
inferredcites →https://doi.org/10.1023/a:1022606002804openalex-snapshot
Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
inferredcites →https://doi.org/10.1137/0803042openalex-snapshot
A Global Optimization Algorithm for Concave Quadratic Programming Problems
inferredcites →https://doi.org/10.1137/1.9781611970524openalex-snapshot
Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1137/1.9781611970524.ch1openalex-snapshot
1. Conjugate Duality and Optimization
inferredcites →https://doi.org/10.1287/moor.20.4.818openalex-snapshot
Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
inferredcites →https://doi.org/10.1287/moor.3.3.231openalex-snapshot
Approximations of Dynamic Programs, I
inferredcites →https://doi.org/10.1287/moor.8.2.231openalex-snapshot
Strong and Weak Convexity of Sets and Functions
inferredcites →https://doi.org/10.68381/jca02021openalex-snapshot
A General Approach to Dual Characterizations of Solvability of Inequality Systems with Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-37007-9_17openalex-snapshot
On the Work of W. Oettli in Generalized Convexity and Nonconvex Optimization — a Review and Some Perspectives
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/s10107980013aopenalex-snapshot
Dual conditions characterizing optimality for convex multi-objective programs
inferred← citeshttps://doi.org/10.1007/s10898-007-9159-8openalex-snapshot
Some new Farkas-type results for inequality systems with DC functions
inferred← citeshttps://doi.org/10.1007/s10898-019-00833-7openalex-snapshot
New global optimality conditions for nonsmooth DC optimization problems
inferred← citeshttps://doi.org/10.1007/s10957-019-01605-9openalex-snapshot
On Set Containment Characterizations for Sets Described by Set-Valued Maps with Applications
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/s11228-010-0166-4openalex-snapshot
Convex Inequalities Without Constraint Qualification nor Closedness Condition, and Their Applications in Optimization
inferred← citeshttps://doi.org/10.1007/s11228-022-00644-1openalex-snapshot
On Subdifferentials Via a Generalized Conjugation Scheme: An Application to DC Problems and Optimality Conditions
inferred← citeshttps://doi.org/10.1007/s40314-025-03151-9openalex-snapshot
Epsilon-subdifferentiability for interval-valued functions and its application in interval optimization problems
inferred← citeshttps://doi.org/10.1016/j.na.2011.07.003openalex-snapshot
Characterization of d.c. functions in terms of quasidifferentials
inferred← citeshttps://doi.org/10.1016/j.na.2012.11.025openalex-snapshot
Optimality conditions for DC programming problems with reverse convex constraints
inferred← citeshttps://doi.org/10.1080/01630560903499845openalex-snapshot
ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
inferred← citeshttps://doi.org/10.1080/01630569608816697openalex-snapshot
Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization
inferred← citeshttps://doi.org/10.1080/02331931003770411openalex-snapshot
On difference convexity of locally Lipschitz functions
inferred← citeshttps://doi.org/10.1080/09720510.2002.10701053openalex-snapshot
Farkas theorems for positively homogeneous quasiconvex functions
inferred← citeshttps://doi.org/10.1109/tsp.2014.2330349openalex-snapshot
The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
inferred← citeshttps://doi.org/10.1137/030602332openalex-snapshot
Farkas-Type Results With Conjugate Functions
inferred← citeshttps://doi.org/10.1137/09077552xopenalex-snapshot
Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
inferred← citeshttps://doi.org/10.1155/2010/363012openalex-snapshot
ϵ-Duality Theorems for Convex Semidefinite Optimization Problems with Conic Constraints
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/twjm/1500404757openalex-snapshot
ON $\epsilon$-APPROXIMATE SOLUTIONS FOR CONVEX SEMIDEFINITE 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.3934/jimo.2013.9.669openalex-snapshot
Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.671openalex-snapshot
Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93827openalex-snapshot
Applicability of deterministic global optimization to the short-term hydrothermal coordination problem
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.