On the public citation graph

Numerical computation of the projection of a point onto a polyhedron

https://doi.org/10.1007/bf00935003
0 signed · 23 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/bf01390423openalex-snapshot
Error analysis of an algorithm for solving an underdetermined linear system
inferredcites →https://doi.org/10.1007/bf01404569openalex-snapshot
A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
inferredcites →https://doi.org/10.1007/bf02576535openalex-snapshot
Metodi diretti per la risoluzione di sistemi lineari
inferredcites →https://doi.org/10.1016/0022-247x(71)90095-3openalex-snapshot
Sur l'approximation d'équations et inéquations aux dérivées partielles non linéaires de type monotone
inferredcites →https://doi.org/10.1016/0377-2217(82)90093-5openalex-snapshot
Practical optimization
inferredcites →https://doi.org/10.1057/jors.1977.131openalex-snapshot
Mathematical Programming Methods
inferredcites →https://doi.org/10.1137/0108011openalex-snapshot
The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
inferredcites →https://doi.org/10.1137/0708038openalex-snapshot
On the Numerical Solution of Constrained Least-Squares Problems
inferredcites →https://doi.org/10.1137/1.9781611971217openalex-snapshot
Solving Least Squares Problems
inferredcites →https://doi.org/10.2307/2286501openalex-snapshot
Solving Least Squares Problems.
inferredcites →https://doi.org/10.2307/3008974openalex-snapshot
Mathematical Programming Methods

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf00941313openalex-snapshot
A big-M type method for the computation of projections onto polyhedrons
inferred← citeshttps://doi.org/10.1007/bf01390423openalex-snapshot
Error analysis of an algorithm for solving an underdetermined linear system
inferred← citeshttps://doi.org/10.1007/bf02576535openalex-snapshot
Metodi diretti per la risoluzione di sistemi lineari
inferred← citeshttps://doi.org/10.1007/s10107-012-0601-4openalex-snapshot
Factorization and cutting planes for completely positive matrices by copositive projection
inferred← citeshttps://doi.org/10.1007/s10589-016-9886-1openalex-snapshot
A dual gradient-projection method for large-scale strictly convex quadratic problems
inferred← citeshttps://doi.org/10.1016/0024-3795(86)90141-2openalex-snapshot
Error analysis of algorithms for computing the projection of a point onto a linear manifold
inferred← citeshttps://doi.org/10.1016/0024-3795(90)90241-4openalex-snapshot
On the error estimate for the projection of a point onto a linear manifold
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90515-popenalex-snapshot
Perturbation analysis for the projection of a point to an affine set
inferred← citeshttps://doi.org/10.1137/s0895479896306604openalex-snapshot
Perturbation Results for Projecting a Point onto a Linear Manifold
inferred← citeshttps://doi.org/10.25353/ubtr-xxxx-c3c9-eb0a/openalex-snapshot
Some aspects of the optimization over the copositive and the completely positive cone
inferred← citeshttps://doi.org/10.4236/am.2017.82013openalex-snapshot
A New Global Scalarization Method for Multiobjective Optimization with an Arbitrary Ordering Cone
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1639openalex-snapshot
A projection method for approximating fixed points of quasi nonexpansive mappings without the usual demiclosedness condition
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.