On the public citation graph
A simple constraint qualification in infinite dimensional programming
0 signed · 46 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-4684-9369-6openalex-snapshot
Geometric Functional Analysis and its Applications
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/0022-247x(69)90054-7openalex-snapshot
Linear equations and inequalities on finite dimensional, real or complex, vector spaces: A unified theory
inferredcites →https://doi.org/10.1016/0024-3795(81)90143-9openalex-snapshot
Some applications of optimization in matrix theory
inferredcites →https://doi.org/10.1017/s1446788700017882openalex-snapshot
Characterization of optimality for the abstract convex program with finite dimensional range
inferredcites →https://doi.org/10.1137/0508072openalex-snapshot
A Volterra Equation with a Nonconvolution Kernel
inferredcites →https://doi.org/10.1137/1013065openalex-snapshot
Linear Programming in Reflexive Spaces
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-1-4615-3600-0_18openalex-snapshot
Spectral Estimation Via Convex Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46564-2_1openalex-snapshot
Openness, Closedness and Duality in Banach Spaces with Applications to Continuous Linear Programming
inferred← citeshttps://doi.org/10.1007/978-94-017-2217-9_5openalex-snapshot
A Survey of Convergence Results for Maximum Entropy Methods
inferred← citeshttps://doi.org/10.1007/bf00940705openalex-snapshot
Quasi interiors, lagrange multipliers, andL p spectral estimation with lattice bounds
inferred← citeshttps://doi.org/10.1007/bf01580588openalex-snapshot
A nonlinear equation for linear programming
inferred← citeshttps://doi.org/10.1007/bf01581073openalex-snapshot
Partially finite convex programming, Part II: Explicit lattice models
inferred← citeshttps://doi.org/10.1007/bf01581074openalex-snapshot
Generalizations of Slater's constraint qualification for infinite convex programs
inferred← citeshttps://doi.org/10.1007/bf01581693openalex-snapshot
Facial reduction in partially finite convex programming
inferred← citeshttps://doi.org/10.1007/bf01891408openalex-snapshot
Constrained best approximation in Hilbert space
inferred← citeshttps://doi.org/10.1007/bf02193099openalex-snapshot
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
inferred← citeshttps://doi.org/10.1007/s10107-015-0951-9openalex-snapshot
On conic QPCCs, conic QCQPs and completely positive programs
inferred← citeshttps://doi.org/10.1007/s10589-010-9356-0openalex-snapshot
A smoothing Newton-type method for solving the L 2 spectral estimation problem with lower and upper bounds
inferred← citeshttps://doi.org/10.1007/s10898-006-9003-6openalex-snapshot
Liberating the Subgradient Optimality Conditions from Constraint Qualifications
inferred← citeshttps://doi.org/10.1007/s11117-024-01032-9openalex-snapshot
Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
inferred← citeshttps://doi.org/10.1007/s11117-026-01171-1openalex-snapshot
On duality theory in vector spaces without topology via algebraic core
inferred← citeshttps://doi.org/10.1016/0021-9045(92)90117-7openalex-snapshot
Constrained best approximation in Hilbert space, II
inferred← citeshttps://doi.org/10.1016/j.jmaa.2004.10.001openalex-snapshot
Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
inferred← citeshttps://doi.org/10.1023/a:1018363021404openalex-snapshot
An Interior-Point Method for Approximate Positive Semidefinite Completions
inferred← citeshttps://doi.org/10.1023/b:jota.0000037607.48762.45openalex-snapshot
On Constraint Qualifications in Nonsmooth Optimization
inferred← citeshttps://doi.org/10.1080/01630563.2011.653071openalex-snapshot
Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation
inferred← citeshttps://doi.org/10.1080/10556788.2014.990452openalex-snapshot
Gradient methods and conic least-squares problems
inferred← citeshttps://doi.org/10.1088/0266-5611/15/2/018openalex-snapshot
Positive solutions to linear inverse problems
inferred← citeshttps://doi.org/10.1090/s0002-9939-04-07844-xopenalex-snapshot
A simple closure condition for the normal cone intersection formula
inferred← citeshttps://doi.org/10.1109/cdc.1990.204070openalex-snapshot
Nonlinear perturbations for linear semi-infinite optimization problems
inferred← citeshttps://doi.org/10.1109/cdc.1996.573633openalex-snapshot
Minimization of peak values of signals in feedback systems
inferred← citeshttps://doi.org/10.1137/0326053openalex-snapshot
A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems
inferred← citeshttps://doi.org/10.1137/0328051openalex-snapshot
A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
inferred← citeshttps://doi.org/10.1137/050624509openalex-snapshot
A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
inferred← citeshttps://doi.org/10.1137/0803012openalex-snapshot
Partially-Finite Programming in $L_1 $ and the Existence of Maximum Entropy Estimates
inferred← citeshttps://doi.org/10.1137/0909048openalex-snapshot
Smoothing and Interpolation in a Convex Subset of a Hilbert Space
inferred← citeshttps://doi.org/10.1137/110826102openalex-snapshot
Double Smoothing Technique for Large-Scale Linearly Constrained Convex Optimization
inferred← citeshttps://doi.org/10.1137/17m1149778openalex-snapshot
Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance
inferred← citeshttps://doi.org/10.1137/s0363012994268321openalex-snapshot
A Farkas lemma Without A Standard Closure Condition
inferred← citeshttps://doi.org/10.1137/s1052623495288350openalex-snapshot
Strong Duality for Semidefinite Programming
inferred← citeshttps://doi.org/10.1287/moor.12.2.224openalex-snapshot
Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence Functionals
inferred← citeshttps://doi.org/10.1287/moor.2023.1382openalex-snapshot
A Semismooth Newton-Type Method for the Nearest Doubly Stochastic Matrix Problem
inferred← citeshttps://doi.org/10.3934/jimo.2013.9.983openalex-snapshot
On constraint qualifications: Motivation, design and inter-relations
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.