On the public citation graph
Characterizations of optimality without constraint qualification for the abstract convex program
0 signed · 77 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-322-96210-2_2openalex-snapshot
Topological Vector Spaces
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/bf00932906openalex-snapshot
Calculating the cone of directions of constancy
inferredcites →https://doi.org/10.1007/bf00933129openalex-snapshot
Characterization of optimality in convex programming without a constraint qualification
inferredcites →https://doi.org/10.1007/bf00933349openalex-snapshot
On the existence and nonexistence of Lagrange multipliers in Banach spaces
inferredcites →https://doi.org/10.1007/bf01229793openalex-snapshot
Linear maps majorized by a sublinear map
inferredcites →https://doi.org/10.1007/bf01442543openalex-snapshot
Regularity and stability for the mathematical programming problem in Banach spaces
inferredcites →https://doi.org/10.1007/bf01581627openalex-snapshot
Geometry of optimality conditions and constraint qualifications: The convex case
inferredcites →https://doi.org/10.1007/bf01584534openalex-snapshot
Geometry of optimality conditions and constraint qualifications
inferredcites →https://doi.org/10.1007/bfb0059450openalex-snapshot
A Course on Optimization and Best Approximation
inferredcites →https://doi.org/10.1007/bfb0120983openalex-snapshot
Characterizations of optimality without constraint qualification for the abstract convex program
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.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
inferredcites →https://doi.org/10.1080/00036817608839119openalex-snapshot
Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
inferredcites →https://doi.org/10.1080/00036817908839260openalex-snapshot
Characterizations of optimality in convex programming: the nondifferentiable case
inferredcites →https://doi.org/10.1080/00036817908839261openalex-snapshot
Characterizations of optimality in convex programming: the nondifferentiable case
inferredcites →https://doi.org/10.1080/00036818008839319openalex-snapshot
Complete characterization of optimality for convex programming in banach spaces†
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/0315004openalex-snapshot
Proper Efficient Points for Maximizations with Respect to Cones
inferredcites →https://doi.org/10.1515/9781400870530openalex-snapshot
Optimization: A Theory of Necessary Conditions
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.20467openalex-snapshot
Optimization of steerable sensor network for threat detection
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_133openalex-snapshot
Farkas lemmaFarkas lemma; Fourier–Motzkin elimination method; Fractional programming; Global optimization: Envelope representation; Gröbner bases for polynomial equations; Lagrangian duality: Basics; Least-index anticycling rules; Theorems of the alternative and optimizationFARKAS LEMMA:…
inferred← citeshttps://doi.org/10.1007/978-0-387-35514-6_13openalex-snapshot
Semidefinite and Lagrangian Relaxations for Hard Combinatorial Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_176openalex-snapshot
Farkas Lemma: Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-642-46618-2_8openalex-snapshot
A Result of Farkas Type and Duality in Vector Optimization
inferred← citeshttps://doi.org/10.1007/bf00047497openalex-snapshot
Characterizing optimality in mathematical programming models
inferred← citeshttps://doi.org/10.1007/bf00934929openalex-snapshot
A strengthened test for optimality
inferred← citeshttps://doi.org/10.1007/bf00941180openalex-snapshot
A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
inferred← citeshttps://doi.org/10.1007/bf00941497openalex-snapshot
An extension lemma and homogeneous programming
inferred← citeshttps://doi.org/10.1007/bf01581074openalex-snapshot
Generalizations of Slater's constraint qualification for infinite convex programs
inferred← citeshttps://doi.org/10.1007/bf01589443openalex-snapshot
A simple constraint qualification in infinite dimensional programming
inferred← citeshttps://doi.org/10.1007/bf01916896openalex-snapshot
On optimality in abstract convex programming
inferred← citeshttps://doi.org/10.1007/bf01920919openalex-snapshot
Nonlinear alternative theorems and nondifferentiable programming
inferred← citeshttps://doi.org/10.1007/bfb0120981openalex-snapshot
Optimality in convex programming: A feasible directions approach
inferred← citeshttps://doi.org/10.1007/s10107-019-01439-3openalex-snapshot
Amenable cones: error bounds without constraint qualifications
inferred← citeshttps://doi.org/10.1007/s10208-022-09586-4openalex-snapshot
Convergence Analysis under Consistent Error Bounds
inferred← citeshttps://doi.org/10.1007/s10589-012-9480-0openalex-snapshot
Strong duality and minimal representations for cone optimization
inferred← citeshttps://doi.org/10.1007/s10589-019-00130-9openalex-snapshot
Douglas–Rachford splitting and ADMM for pathological convex optimization
inferred← citeshttps://doi.org/10.1007/s10957-004-1712-8openalex-snapshot
Sequential Lagrangian Conditions for Convex Programs with Applications to Semidefinite Programming
inferred← citeshttps://doi.org/10.1007/s10957-024-02515-1openalex-snapshot
On the Uniform Duality in Copositive Optimization
inferred← citeshttps://doi.org/10.1007/s10958-012-0734-2openalex-snapshot
Optimality criteria without constraint qualifications for linear semidefinite problems
inferred← citeshttps://doi.org/10.1007/s11750-011-0189-5openalex-snapshot
Implicit optimality criterion for convex SIP problem with box constrained index set
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(88)90309-5openalex-snapshot
Equivalence of saddle-points and optima, and duality for a class of non-smooth non-convex problems
inferred← citeshttps://doi.org/10.1016/0167-6377(86)90111-2openalex-snapshot
Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
inferred← citeshttps://doi.org/10.1016/0362-546x(85)90053-7openalex-snapshot
Perturbed convex programming in reflexive Banach spaces
inferred← citeshttps://doi.org/10.1016/b978-044450550-7/50004-1openalex-snapshot
Nonsmooth Optimization Problems
inferred← citeshttps://doi.org/10.1017/s0004972700001908openalex-snapshot
Generalized convexity in nondifferentiable programming
inferred← citeshttps://doi.org/10.1017/s1446788700017250openalex-snapshot
Facial reduction 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/s1446788700025453openalex-snapshot
Continuity properties of vector-valued convex functions
inferred← citeshttps://doi.org/10.1023/a:1022606002804openalex-snapshot
Asymptotic Dual Conditions Characterizing Optimality for Infinite Convex Programs
inferred← citeshttps://doi.org/10.1080/01630568308816172openalex-snapshot
On minimization subject to cone constraints
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/02331938108842721openalex-snapshot
Stabilization and determination of the set of minimal binding constraints in convex programming1
inferred← citeshttps://doi.org/10.1080/02331938708843228openalex-snapshot
Nonconvex theorems of the alternative and minimization
inferred← citeshttps://doi.org/10.1080/02331938908843501openalex-snapshot
Approximating families of cones and proper efficiency in vector optimization
inferred← citeshttps://doi.org/10.1080/02331939208843830openalex-snapshot
Necessary and sufficient conditions for regularity of constraints in convex programming
inferred← citeshttps://doi.org/10.1080/02331939508844032openalex-snapshot
Small convex-valued subdifferentials in mathematical programming
inferred← citeshttps://doi.org/10.1137/s0363012994155677openalex-snapshot
Corrigendum: Lagrange Multipliers in Stochastic Programming
inferred← citeshttps://doi.org/10.1137/s0363012994268321openalex-snapshot
A Farkas lemma Without A Standard Closure Condition
inferred← citeshttps://doi.org/10.1137/s1052623402417699openalex-snapshot
New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
inferred← citeshttps://doi.org/10.1137/s1052623495288350openalex-snapshot
Strong Duality for Semidefinite Programming
inferred← citeshttps://doi.org/10.1163/9789004273245_003openalex-snapshot
Bibliographical Description
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.52714/dthu.26.6.2017.477openalex-snapshot
Điều kiện cần và đủ theo dãy cho nghiệm của bài toán tối ưu với ràng buộc nhúng
inferred← citeshttps://doi.org/10.68381/jca15010openalex-snapshot
Sequential Optimality Conditions in Convex Programming via Perturbation Approach
showing the first 49 of 50 · page through all 50
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.