Newton-type algorithms for inverse optimization: weighted bottleneck Hamming distance and $$\ell _\infty$$-norm objectives
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 optimization problem is endowed with a linear cost...
Saved in:
| Published in: | Optimization letters Vol. 19; no. 8; pp. 1665 - 1690 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.11.2025
|
| ISSN: | 1862-4472, 1862-4480 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!