Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and [Formula: see text] -norm objectives
{{output}}
In inverse optimization problems, we are given a feasible solution to an underlying optimization problem, and the goal is to modify the problem parameters so that the given input solution becomes optimal. In the minimum-cost setting, the underlying optimizatio... ...
