On the public citation graph

A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes

https://doi.org/10.1007/bf01582149
0 signed · 38 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.1002/nav.3800030109openalex-snapshot
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1007/bf01448356openalex-snapshot
Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
inferredcites →https://doi.org/10.1007/bf01580381openalex-snapshot
Finding the nearest point in A polytope
inferredcites →https://doi.org/10.1007/bf02591851openalex-snapshot
Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
inferredcites →https://doi.org/10.1007/bf02591991openalex-snapshot
Error bounds for monotone linear complementarity problems
inferredcites →https://doi.org/10.1137/0306032openalex-snapshot
A Tight Upper Bound on the Rate of Convergence of Frank-Wolfe Algorithm
inferredcites →https://doi.org/10.15807/jorsj.33.188openalex-snapshot
A DUAL ALGORITHM FOR FINDING THE MINIMUM-NORM POINT IN A POLYTOPE
inferredcites →https://doi.org/10.15807/jorsj.35.353openalex-snapshot
A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES

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-3-031-90606-0_7openalex-snapshot
Rethinking Linear Programming: A New Finite-Termination LP-Newton Approach
inferred← citeshttps://doi.org/10.1007/bf01432655openalex-snapshot
Error bounds for solutions of linear equations and inequalities
inferred← citeshttps://doi.org/10.1007/bf03167224openalex-snapshot
An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane
inferred← citeshttps://doi.org/10.1007/bf03167575openalex-snapshot
A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes
inferred← citeshttps://doi.org/10.1007/bfb0035533openalex-snapshot
An algorithm for finding the chebyshev center of a convex polyhedron
inferred← citeshttps://doi.org/10.1007/s00453-018-0436-3openalex-snapshot
A Simple Projection Algorithm for Linear Programming Problems
inferred← citeshttps://doi.org/10.1007/s10589-005-4560-zopenalex-snapshot
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering
inferred← citeshttps://doi.org/10.1007/s10589-020-00211-0openalex-snapshot
The distance between convex sets with Minkowski sum structure: application to collision detection
inferred← citeshttps://doi.org/10.1007/s10898-005-6017-4openalex-snapshot
Hausdorff Matching and Lipschitz Optimization
inferred← citeshttps://doi.org/10.1007/s11081-008-9067-xopenalex-snapshot
Zonotopes and the LP-Newton method
inferred← citeshttps://doi.org/10.1016/0167-6377(94)90019-1openalex-snapshot
An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00164-2openalex-snapshot
Finding the projection on a polytope: An iterative method
inferred← citeshttps://doi.org/10.1016/j.patcog.2026.113279openalex-snapshot
Learning to optimize unsupervised image fusion with learnable loss and fusion strategy
inferred← citeshttps://doi.org/10.1016/s0096-3003(97)10043-1openalex-snapshot
An approximate algorithm for computing multidimensional convex hulls
inferred← citeshttps://doi.org/10.1016/s0377-2217(98)00370-1openalex-snapshot
A vertex algorithm for collision detection
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)85008-7openalex-snapshot
An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
inferred← citeshttps://doi.org/10.1023/a:1024755315702openalex-snapshot
Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
inferred← citeshttps://doi.org/10.1137/070680436openalex-snapshot
Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
inferred← citeshttps://doi.org/10.1137/s0097539793250287openalex-snapshot
A Subexponential Algorithm for Abstract Optimization Problems
inferred← citeshttps://doi.org/10.1145/336154.336191openalex-snapshot
An efficient, exact, and generic quadratic programming solver for geometric optimization
inferred← citeshttps://doi.org/10.15807/jorsj.35.353openalex-snapshot
A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
inferred← citeshttps://doi.org/10.15807/jorsj.48.24openalex-snapshot
A NEW APPROACH OF REVISING UNSTABLE DATA IN ANP BY BAYES THEOREM
inferred← citeshttps://doi.org/10.15807/jorsj.50.515openalex-snapshot
MATRIX BALANCING PROBLEM AND BINARY AHP( the 50th Anniversary of the Operations Research Society of Japan)
inferred← citeshttps://doi.org/10.1609/aaai.v35i10.17126openalex-snapshot
Fast PCA in 1-D Wasserstein Spaces via B-splines Representation and Metric Projection
inferred← citeshttps://doi.org/10.24963/ijcai.2023/440openalex-snapshot
HyperFed: Hyperbolic Prototypes Exploration with Consistent Aggregation for Non-IID Data in Federated Learning
inferred← citeshttps://doi.org/10.3390/books978-3-03928-159-6openalex-snapshot
Cooperative Connected and Automated Mobility (CCAM)
inferred← citeshttps://doi.org/10.3390/electronics8090938openalex-snapshot
Multi-Task Scheduling Based on Classification in Mobile Edge Computing
inferred← citeshttps://doi.org/10.3929/ethz-a-004448632openalex-snapshot
Quadratic programming in geometric optimization: theory, implementation, and applications
inferred← citeshttps://doi.org/10.3934/math.2026191openalex-snapshot
A numerical LP-Newton method for solving linear programming using separating hyperplanes
inferred← citeshttps://doi.org/10.48550/arxiv.2101.09039openalex-snapshot
Projected Statistical Methods for Distributional Data on the Real Line with the Wasserstein Metric
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.