On the public citation graph

On the stability of solutions to quadratic programming problems

https://doi.org/10.1007/pl00011404
0 signed · 35 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.1007/978-1-4612-0981-2openalex-snapshot
Nonlinear Functional Analysis and its Applications
inferredcites →https://doi.org/10.1007/978-3-0348-6328-5openalex-snapshot
Non-Linear Parametric Optimization
inferredcites →https://doi.org/10.1007/bf00940021openalex-snapshot
Stability of linearly constrained convex quadratic programs
inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1007/bf01580110openalex-snapshot
Stability of the solution of definite quadratic programs
inferredcites →https://doi.org/10.1007/bf02192198openalex-snapshot
Sensitivity analysis for generalized linear-quadratic problems
inferredcites →https://doi.org/10.1007/bfb0120850openalex-snapshot
Generalized equations and their solutions, Part I: Basic theory
inferredcites →https://doi.org/10.1007/bfb0120989openalex-snapshot
Generalized equations and their solutions, part II: Applications to nonlinear programming
inferredcites →https://doi.org/10.1007/s101070050052openalex-snapshot
Continuity properties of the Karush-Kuhn-Tucker point set in quadratic programming problems
inferredcites →https://doi.org/10.1080/02331887608801291openalex-snapshot
Stability in convex quadratic parametric programming
inferredcites →https://doi.org/10.1080/02331930108844553openalex-snapshot
Sufficient conditions for the stability of the karush- kuhn - tucker point set in quadratic programming
inferredcites →https://doi.org/10.1137/1.9780898719000openalex-snapshot
The Linear Complementarity Problem
inferredcites →https://doi.org/10.1287/opre.25.3.435openalex-snapshot
A Characterization of Stability in Linear Programming
inferredcites →https://doi.org/10.2969/jmsj/00630343openalex-snapshot
Logarithmic order of free distributive lattice

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00186-010-0324-3openalex-snapshot
Global infimum of strictly convex quadratic functions with bounded perturbations
inferred← citeshttps://doi.org/10.1007/s10898-025-01500-wopenalex-snapshot
Computing local minimizers in polynomial optimization under genericity conditions
inferred← citeshttps://doi.org/10.1007/s10957-006-9076-xopenalex-snapshot
Continuity of the Solution Map in Quadratic Programs under Linear Perturbations
inferred← citeshttps://doi.org/10.1007/s10957-007-9215-zopenalex-snapshot
Continuous Selection and Unique Polyhedral Representation of Solutions to Convex Parametric Quadratic Programs
inferred← citeshttps://doi.org/10.1007/s10957-010-9772-4openalex-snapshot
Maximizing Strictly Convex Quadratic Functions with Bounded Perturbations
inferred← citeshttps://doi.org/10.1007/s10957-014-0530-xopenalex-snapshot
Boundedness of a Type of Iterative Sequences in Two-Dimensional Quadratic Programming
inferred← citeshttps://doi.org/10.1007/s10957-016-0910-5openalex-snapshot
Stability and Genericity for Semi-algebraic Compact Programs
inferred← citeshttps://doi.org/10.1007/s10957-026-03024-zopenalex-snapshot
Characterizing Stability of Parametric Nonconvex Polynomial Optimization Problems under Total Perturbations
inferred← citeshttps://doi.org/10.1007/s11766-015-3124-yopenalex-snapshot
Lipschitz continuity of the optimal value function and KKT solution set in indefinite quadratic programs
inferred← citeshttps://doi.org/10.1080/02331930108844553openalex-snapshot
Sufficient conditions for the stability of the karush- kuhn - tucker point set in quadratic programming
inferred← citeshttps://doi.org/10.1080/02331930600819597openalex-snapshot
Some properties of solution sets to nonconvex quadratic programming problems
inferred← citeshttps://doi.org/10.1080/02331931003746114openalex-snapshot
Some properties of boundedly perturbed strictly convex quadratic functions
inferred← citeshttps://doi.org/10.1080/02331934.2014.891033openalex-snapshot
Continuity of parametric mixed-integer quadratic programs and its application to stability analysis of two-stage quadratic stochastic programs with mixed-integer recourse
inferred← citeshttps://doi.org/10.1109/acc.2005.1470060openalex-snapshot
Unique polyhedral representations of continuous selections for convex multiparametric quadratic programs
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760327openalex-snapshot
Sufficient conditions for the Lipschitz continuity of QP-based multi-objective control of humanoid robots
inferred← citeshttps://doi.org/10.1109/tcns.2018.2843164openalex-snapshot
Locality in Network Optimization
inferred← citeshttps://doi.org/10.1109/wmwa.2009.8openalex-snapshot
Parametric Pivoting Algorithm for Parametric Quadratic Programming Problem
inferred← citeshttps://doi.org/10.1137/070710317openalex-snapshot
Stability of Linear-Quadratic Minimization over Euclidean Balls
inferred← citeshttps://doi.org/10.1137/080741069openalex-snapshot
Minimizing Convex Functions with Bounded Perturbations
inferred← citeshttps://doi.org/10.11650/twjm/1500405615openalex-snapshot
STABILITY OF A CLASS OF QUADRATIC PROGRAMS WITH A CONIC CONSTRAINT
inferred← citeshttps://doi.org/10.48550/arxiv.1902.02363openalex-snapshot
Stability of the optimal values under small perturbations of the constraint set
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.