On the public citation graph
Characterization of optimality in convex programming without a constraint qualification
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.1002/nav.3800080206openalex-snapshot
Constraint qualifications in maximization problems
inferredcites →https://doi.org/10.1007/978-3-642-80684-1openalex-snapshot
Lectures on Mathematical Theory of Extremum Problems
inferredcites →https://doi.org/10.1007/bf01584534openalex-snapshot
Geometry of optimality conditions and constraint qualifications
inferredcites →https://doi.org/10.1016/b978-0-12-597050-1.50014-2openalex-snapshot
Some Convex Programs Whose Duals Are Linearly Constrained
inferredcites →https://doi.org/10.1137/0120021openalex-snapshot
A Necessary and Sufficient Qualification for Constrained Optimization
inferredcites →https://doi.org/10.1137/0307016openalex-snapshot
Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
inferredcites →https://doi.org/10.1137/1013001openalex-snapshot
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
inferredcites →https://doi.org/10.1137/1015075openalex-snapshot
A Review of Constraint Qualifications in Finite-Dimensional Spaces
inferredcites →https://doi.org/10.1287/mnsc.18.9.567openalex-snapshot
Constraint Qualifications Revisited
inferredcites →https://doi.org/10.1287/opre.16.4.849openalex-snapshot
Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification
inferredcites →https://doi.org/10.2307/2342482openalex-snapshot
Mathematical Methods and Theory in Games, Programming, and Economics.
inferredcites →https://doi.org/10.2307/2980845openalex-snapshot
Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nav.3800270307openalex-snapshot
Optimality conditions for convex semi‐infinite programming problems
inferred← citeshttps://doi.org/10.1002/zamm.19790590616openalex-snapshot
A Note on Optimization Methods with Conditioned Gradients
inferred← citeshttps://doi.org/10.1007/978-1-4615-8285-4_9openalex-snapshot
Projection and Restriction Methods in Geometric Programming and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-46473-7_9openalex-snapshot
On Efficient Sets in Vector Maximum Problems — A Brief Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-48782-8_1openalex-snapshot
Characterization of Pareto and Lexicographic Optimal Solutions
inferred← citeshttps://doi.org/10.1007/bf00932906openalex-snapshot
Calculating the cone of directions of constancy
inferred← citeshttps://doi.org/10.1007/bf00933271openalex-snapshot
Projection and restriction methods in geometric programming and related problems
inferred← citeshttps://doi.org/10.1007/bf00933505openalex-snapshot
Method of reduction in convex programming
inferred← citeshttps://doi.org/10.1007/bf00934107openalex-snapshot
Second-order and related extremality conditions in nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf01580372openalex-snapshot
On A characterization of optimality in convex programming
inferred← citeshttps://doi.org/10.1007/bf01581627openalex-snapshot
Geometry of optimality conditions and constraint qualifications: The convex case
inferred← citeshttps://doi.org/10.1007/bf01916896openalex-snapshot
On optimality in abstract convex programming
inferred← citeshttps://doi.org/10.1007/bf01965717openalex-snapshot
Primal and dual optimality criteria in convex programming
inferred← citeshttps://doi.org/10.1007/bfb0120981openalex-snapshot
Optimality in convex programming: A feasible directions approach
inferred← citeshttps://doi.org/10.1007/bfb0120983openalex-snapshot
Characterizations of optimality without constraint qualification for the abstract convex program
inferred← citeshttps://doi.org/10.1007/bfb0120990openalex-snapshot
Kuhn-tucker multipliers and nonsmooth programs
inferred← citeshttps://doi.org/10.1007/bfb0121216openalex-snapshot
A sufficient condition for lower semicontinuity of solution sets of systems of convex inequalities
inferred← citeshttps://doi.org/10.1016/0022-247x(81)90138-4openalex-snapshot
Regularizing the abstract convex program
inferred← citeshttps://doi.org/10.1016/0022-247x(90)90376-qopenalex-snapshot
A note on multiple optimality conditions for programs with convex inequality constraints
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.1017/s0004972700001908openalex-snapshot
Generalized convexity in nondifferentiable programming
inferred← citeshttps://doi.org/10.1017/s1446788700012064openalex-snapshot
Optimality conditions for a cone-convex programming problem
inferred← citeshttps://doi.org/10.1017/s1446788700017882openalex-snapshot
Characterization of optimality for the abstract convex program with finite dimensional range
inferred← citeshttps://doi.org/10.1017/s144678870002468xopenalex-snapshot
Duality theorems for convex programming without constraint qualification
inferred← citeshttps://doi.org/10.1080/00036817908839260openalex-snapshot
Characterizations of optimality in convex programming: the nondifferentiable case
inferred← citeshttps://doi.org/10.1080/00036817908839261openalex-snapshot
Characterizations of optimality in convex programming: the nondifferentiable case
inferred← citeshttps://doi.org/10.1080/00036818008839319openalex-snapshot
Complete characterization of optimality for convex programming in banach spaces†
inferred← citeshttps://doi.org/10.1080/01630569308816525openalex-snapshot
A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential
inferred← citeshttps://doi.org/10.1080/02331937708842406openalex-snapshot
Convex programming and the lexicographic multicriteria problem
inferred← citeshttps://doi.org/10.1080/02331937808842484openalex-snapshot
Feasible direction methods in the absence of slater's condition
inferred← citeshttps://doi.org/10.1080/02331937908842560openalex-snapshot
Duality in convex programming: a linearization approach1
inferred← citeshttps://doi.org/10.1080/02331938108842721openalex-snapshot
Stabilization and determination of the set of minimal binding constraints in convex programming1
inferred← citeshttps://doi.org/10.1080/02331938908843438openalex-snapshot
Finite dimensional second order optimality conditions
inferred← citeshttps://doi.org/10.1088/1742-6596/1000/1/012163openalex-snapshot
Duality in non-linear programming
inferred← citeshttps://doi.org/10.1137/15m1052172openalex-snapshot
Bilevel Polynomial Programs and Semidefinite Relaxation Methods
inferred← citeshttps://doi.org/10.1163/9789004273245_003openalex-snapshot
Bibliographical Description
inferred← citeshttps://doi.org/10.1201/b11156-14openalex-snapshot
Representation of the Feasible Set and KKT Conditions
inferred← citeshttps://doi.org/10.1515/9781400864942.xliopenalex-snapshot
Bibliographical Description
inferred← citeshttps://doi.org/10.3138/9781442679092-007openalex-snapshot
Bibliographical Description
inferred← citeshttps://doi.org/10.68381/jca15010openalex-snapshot
Sequential Optimality Conditions in Convex Programming via Perturbation Approach
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.