Papers › Inverse Graphical Method for Global Optimization and Application to Design Centering Problem
Inverse Graphical Method for Global Optimization and Application to Design Centering Problem
Sergey Karpukhin
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Consider the problem of finding an optimal value of some objective functional subject to constraints over numerical domain. This type of problem arises frequently in practical engineering tasks. Nowdays almost all general methods for solving such a problem are based on user-supplied routines computing the objective value at some points. We study another approach called inverse relying on some procedure to estimate the set of points instead having objective values bounded by a specified constant. In particular, we present an inverse optimization algorithm derived from the bisection of the objective range. In case of seeking a proven global optimal solution inherently requiring many computations, and a problem with some kind of coherency utilized in estimation procedure, the inverse scheme is much more efficient than conventional ones. An example of such a problem, namely the design centering, is studied to compare the approaches.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections