On the public citation graph

Ordinary convex programs without a duality gap

https://doi.org/10.1007/bf00932472
0 signed · 30 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.1090/qam/141530openalex-snapshot
Duality in nonlinear programming
inferredcites →https://doi.org/10.1090/s0002-9939-1957-0087574-2openalex-snapshot
Systems of Inequalities Involving Convex Functions
inferredcites →https://doi.org/10.1215/s0012-7094-65-03238-2openalex-snapshot
Helly’s theorem and minima of convex functions
inferredcites →https://doi.org/10.1515/9781400873173openalex-snapshot
Convex Analysis
inferredcites →https://doi.org/10.1525/9780520411586-036openalex-snapshot
Nonlinear Programming

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-642-46536-9_3openalex-snapshot
Multiple Criteria Optimization; A State of the Art Review
inferred← citeshttps://doi.org/10.1007/b130810openalex-snapshot
Nonsmooth Equations in Optimization
inferred← citeshttps://doi.org/10.1007/bf01580138openalex-snapshot
A dual approach to solving nonlinear programming problems by unconstrained optimization
inferred← citeshttps://doi.org/10.1007/bf01580372openalex-snapshot
On A characterization of optimality in convex programming
inferred← citeshttps://doi.org/10.1007/bf01593807openalex-snapshot
Efficiency in multiple objective optimization problems
inferred← citeshttps://doi.org/10.1007/bf01965717openalex-snapshot
Primal and dual optimality criteria in convex programming
inferred← citeshttps://doi.org/10.1007/pl00011416openalex-snapshot
Logarithmic SUMT limits in convex programming
inferred← citeshttps://doi.org/10.1007/s10107-003-0461-zopenalex-snapshot
Duality gap in convex programming
inferred← citeshttps://doi.org/10.1007/s10107-006-0003-6openalex-snapshot
Set Intersection Theorems and Existence of Optimal Solutions
inferred← citeshttps://doi.org/10.1007/s10107-007-0110-zopenalex-snapshot
Some convex programs without a duality gap
inferred← citeshttps://doi.org/10.1007/s10107-021-01647-wopenalex-snapshot
Characterizing quasiconvexity of the pointwise infimum of a family of arbitrary translations of quasiconvex functions, with applications to sums and quasiconvex optimization
inferred← citeshttps://doi.org/10.1007/s10957-022-02079-yopenalex-snapshot
On the Lower Semicontinuity of the Value Function and Existence of Solutions in Quasiconvex Optimization
inferred← citeshttps://doi.org/10.1016/0377-2217(86)90048-2openalex-snapshot
On efficient sets in vector maximum problems — A brief survey
inferred← citeshttps://doi.org/10.1016/b978-0-12-468662-5.50017-3openalex-snapshot
MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITY
inferred← citeshttps://doi.org/10.1016/b978-0-12-597050-1.50014-2openalex-snapshot
Some Convex Programs Whose Duals Are Linearly Constrained
inferred← citeshttps://doi.org/10.1016/j.na.2009.01.233openalex-snapshot
Penalty function methods and a duality gap for invex optimization problems
inferred← citeshttps://doi.org/10.1016/s0168-2024(09)70046-3openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1080/02331934.2025.2579724openalex-snapshot
Lagrange dualities for DC infinite optimization problems
inferred← citeshttps://doi.org/10.1080/02331937708842406openalex-snapshot
Convex programming and the lexicographic multicriteria problem
inferred← citeshttps://doi.org/10.1080/02331939908844440openalex-snapshot
Stable parametric programming*
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397252openalex-snapshot
Gate sizing by lagrangian relaxation revisited
inferred← citeshttps://doi.org/10.1109/tcad.2009.2018872openalex-snapshot
Gate Sizing by Lagrangian Relaxation Revisited
inferred← citeshttps://doi.org/10.1137/1035044openalex-snapshot
Lagrange Multipliers and Optimality
inferred← citeshttps://doi.org/10.1137/s1052623401397242openalex-snapshot
Coupling General Penalty Schemes for Convex Programming with the Steepest Descent and the Proximal Point Algorithm
inferred← citeshttps://doi.org/10.6028/nist.ir.6426openalex-snapshot
On weakly analytic and faithfully convex functions in convex programming
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.