On the public citation graph
A Dual Method for Quadratic Programs with Quadratic Constraints
0 signed · 29 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.3800190204openalex-snapshot
Quadratic programming with quadratic constraints
inferredcites →https://doi.org/10.1016/0022-247x(70)90085-5openalex-snapshot
Geometric programming: Duality in quadratic programming and lp-approximation III (degenerate programs)
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.1080/00036817208839043openalex-snapshot
Geometric programs treated with slack variables +
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1137/0117031openalex-snapshot
Geometric Programming: Duality in Quadratic Programming and $l_p $-Approximation II (Canonical Programs)
inferredcites →https://doi.org/10.1287/mnsc.12.11.798openalex-snapshot
Programming with a Quadratic Constraint
inferredcites →https://doi.org/10.1287/mnsc.12.5.385openalex-snapshot
A Duality Theorem for Nonlinear Programming
inferredcites →https://doi.org/10.2307/2343701openalex-snapshot
Nonlinear Programming: A Unified Approach.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00121301openalex-snapshot
Reduction of indefinite quadratic programs to bilinear programs
inferred← citeshttps://doi.org/10.1007/bf01585763openalex-snapshot
Minimal representation of quadratically constrained convex feasible regions
inferred← citeshttps://doi.org/10.1007/bf01917102openalex-snapshot
Quadratically constrained quadratic programming: Some applications and a method for solution
inferred← citeshttps://doi.org/10.1007/bf01918629openalex-snapshot
Controlled dual perturbations for l p -programming
inferred← citeshttps://doi.org/10.1007/bf02098176openalex-snapshot
Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
inferred← citeshttps://doi.org/10.1007/bf02591966openalex-snapshot
An ellipsoid algorithm for nonlinear programming
inferred← citeshttps://doi.org/10.1007/bf02592062openalex-snapshot
Controlled perturbations for quadratically constrained quadratic programs
inferred← citeshttps://doi.org/10.1007/s10107-011-0454-2openalex-snapshot
An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90073-xopenalex-snapshot
A reduced gradient method for quadratic programs with quadratic constraints and lp-constrained lp-approximation problems
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90059-iopenalex-snapshot
Unboundedness of a convex quadratic function subject to concave and convex quadratic constraints
inferred← citeshttps://doi.org/10.1016/0377-2217(92)90082-kopenalex-snapshot
Generalized bilinear programming: Part I. Models, applications and linear programming relaxation
inferred← citeshttps://doi.org/10.1016/0377-2217(93)e0244-ropenalex-snapshot
An algorithm to determine boundedness of quadratically constrained convex quadratic programmes
inferred← citeshttps://doi.org/10.1016/j.amc.2014.09.044openalex-snapshot
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature
inferred← citeshttps://doi.org/10.1109/78.91146openalex-snapshot
A new optimal window (signal processing)
inferred← citeshttps://doi.org/10.1137/0323042openalex-snapshot
A Computational Comparison of the Ellipsoid Algorithm with Several Nonlinear Programming Algorithms
inferred← citeshttps://doi.org/10.1137/0728029openalex-snapshot
A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
inferred← citeshttps://doi.org/10.1137/090751414openalex-snapshot
An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
inferred← citeshttps://doi.org/10.1137/s1052623498335018openalex-snapshot
On Local Solutions of the Celis--Dennis--Tapia Subproblem
inferred← citeshttps://doi.org/10.4230/lipics.sea.2022.24openalex-snapshot
An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP
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.