On the public citation graph
A Nonconvex Duality with Zero Gap and Applications
0 signed · 57 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-45610-7_3openalex-snapshot
Generalized Differentiability / Duality and Optimization for Problems Dealing with Differences of Convex Functions
inferredcites →https://doi.org/10.1007/978-3-642-97881-4openalex-snapshot
Geometric Algorithms and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/978-3-662-00547-7openalex-snapshot
Nonlinear Functional Analysis
inferredcites →https://doi.org/10.1007/bf00119933openalex-snapshot
Polyhedral annexaton, dualization and dimension reduction technique in global optimization
inferredcites →https://doi.org/10.1007/bf00119988openalex-snapshot
Mathematical programs with a two-dimensional reverse convex constraint
inferredcites →https://doi.org/10.1007/bf00934366openalex-snapshot
An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
inferredcites →https://doi.org/10.1007/bf01096773openalex-snapshot
A generalized duality and applications
inferredcites →https://doi.org/10.1007/bf01580765openalex-snapshot
The design centering problem as a D.C. programming problem
inferredcites →https://doi.org/10.1007/bf01582050openalex-snapshot
A convex-like duality scheme for quasi-convex programs
inferredcites →https://doi.org/10.1007/bf01584248openalex-snapshot
An elementary survey of general duality theory in mathematical programming
inferredcites →https://doi.org/10.1007/bf02592948openalex-snapshot
Some NP-complete problems in quadratic and nonlinear programming
inferredcites →https://doi.org/10.1016/0022-247x(78)90243-3openalex-snapshot
Duality in nonconvex optimization
inferredcites →https://doi.org/10.1016/0022-247x(86)90046-6openalex-snapshot
A general theory of dual optimization problems
inferredcites →https://doi.org/10.1016/0022-247x(91)90197-8openalex-snapshot
Quasiconjugates of functions, duality relationship between Quasiconvex Minimization under a Reverse Convex Constraint and Quasiconvex Maximization under a Convex Constraint, and applications
inferredcites →https://doi.org/10.1016/0377-2217(84)90107-3openalex-snapshot
On the convexification of nonlinear programming problems: An applications-oriented survey
inferredcites →https://doi.org/10.1016/s0304-0208(08)72403-4openalex-snapshot
A General Deterministic Approach to Global Optimization VIA D.C. Programming
inferredcites →https://doi.org/10.1080/00036818308839476openalex-snapshot
Surrogate conjugate functionals and surrogate convexity
inferredcites →https://doi.org/10.1080/02331938808843379openalex-snapshot
Quasiconvex duality theory by generalized conjugation methods
inferredcites →https://doi.org/10.1137/0524087openalex-snapshot
Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-23393-8_6openalex-snapshot
Generalized Convex Duality and its Economic Applicatons
inferred← citeshttps://doi.org/10.1007/0-387-25570-2_1openalex-snapshot
Unilateral Analysis and Duality
inferred← citeshttps://doi.org/10.1007/4-431-27233-x_5openalex-snapshot
The bearing of duality on microeconomics
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_1openalex-snapshot
Are Generalized Derivatives Sseful for Generalized Convex Functions?
inferred← citeshttps://doi.org/10.1007/978-1-4613-3341-8_15openalex-snapshot
Duality in DC Programming
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_4openalex-snapshot
D.C. Optimization: Theory, Methods and Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-37007-9_24openalex-snapshot
Monotonicity and Dualities
inferred← citeshttps://doi.org/10.1007/978-3-642-59073-3_26openalex-snapshot
Quasiconvex Duality for the Max of Two Functions
inferred← citeshttps://doi.org/10.1007/bf02192166openalex-snapshot
Diewert-Crouzeix conjugation for general quasiconvex duality and applications
inferred← citeshttps://doi.org/10.1007/bf02941093openalex-snapshot
Some recent developments in deterministic global optimization
inferred← citeshttps://doi.org/10.1007/s10479-004-5022-1openalex-snapshot
The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10898-009-9478-zopenalex-snapshot
Are dualities appropriate for duality theories in optimization?
inferred← citeshttps://doi.org/10.1007/s10898-011-9794-yopenalex-snapshot
Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
inferred← citeshttps://doi.org/10.1007/s10898-013-0055-0openalex-snapshot
Problems with resource allocation constraints and optimization over the efficient set
inferred← citeshttps://doi.org/10.1007/s10898-014-0261-4openalex-snapshot
Projective dualities for quasiconvex problems
inferred← citeshttps://doi.org/10.1007/s10957-011-9822-6openalex-snapshot
Symmetric Duality for Homogeneous Multiple-Objective Problems
inferred← citeshttps://doi.org/10.1007/s11590-019-01523-9openalex-snapshot
Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization
inferred← citeshttps://doi.org/10.1007/s40306-016-0182-zopenalex-snapshot
Conjugate Duality and Optimization over Weakly Efficient Set
inferred← citeshttps://doi.org/10.1016/j.jmaa.2010.10.041openalex-snapshot
Conjugate duality for vector-maximization problems
inferred← citeshttps://doi.org/10.1023/a:1008327614099openalex-snapshot
Duality for Anticonvex Programs
inferred← citeshttps://doi.org/10.1023/a:1013875600711openalex-snapshot
Optimization over the efficient set: overview
inferred← citeshttps://doi.org/10.1023/a:1026404623838openalex-snapshot
A Deterministic Approach to Linear Programs with Several Additional Multiplicative Constraints
inferred← citeshttps://doi.org/10.1051/proc:072016openalex-snapshot
Glimpses upon quasiconvex analysis
inferred← citeshttps://doi.org/10.1080/02331930008844469openalex-snapshot
What is quasiconvex analysis?
inferred← citeshttps://doi.org/10.1080/02331930500138536openalex-snapshot
Multipliers and general Lagrangians
inferred← citeshttps://doi.org/10.1080/02331939908844436openalex-snapshot
Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **
inferred← citeshttps://doi.org/10.1137/0524087openalex-snapshot
Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
inferred← citeshttps://doi.org/10.1137/0806012openalex-snapshot
A Generalized Convexity and Variational Inequality for Quasi-Convex Minimization
inferred← citeshttps://doi.org/10.1137/s1052623495295857openalex-snapshot
Duality in Reverse Convex 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.