Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2305.12211 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929536361299968 |
|---|---|
| author | Paeng, Jinhee Park, Jisun Ryu, Ernest K. |
| author_facet | Paeng, Jinhee Park, Jisun Ryu, Ernest K. |
| contents | Coordinate update/descent algorithms are widely used in large-scale optimization due to their low per-iteration cost and scalability, but their behavior on infeasible or misspecified problems has not been much studied compared to the algorithms that use full updates. For coordinate-update methods to be as widely adopted to the extent so that they can be used as engines of general-purpose solvers, it is necessary to also understand their behavior under pathological problem instances. In this work, we show that the normalized iterates of randomized coordinate-update fixed-point iterations (RC-FPI) converge to the infimal displacement vector and use this result to design an efficient infeasibility detection method. We then extend the analysis to the setup where the coordinates are defined by non-orthonormal basis using the Friedrichs angle and then apply the machinery to decentralized optimization problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_12211 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Coordinate-Update Algorithms can Efficiently Detect Infeasible Optimization Problems Paeng, Jinhee Park, Jisun Ryu, Ernest K. Optimization and Control Coordinate update/descent algorithms are widely used in large-scale optimization due to their low per-iteration cost and scalability, but their behavior on infeasible or misspecified problems has not been much studied compared to the algorithms that use full updates. For coordinate-update methods to be as widely adopted to the extent so that they can be used as engines of general-purpose solvers, it is necessary to also understand their behavior under pathological problem instances. In this work, we show that the normalized iterates of randomized coordinate-update fixed-point iterations (RC-FPI) converge to the infimal displacement vector and use this result to design an efficient infeasibility detection method. We then extend the analysis to the setup where the coordinates are defined by non-orthonormal basis using the Friedrichs angle and then apply the machinery to decentralized optimization problems. |
| title | Coordinate-Update Algorithms can Efficiently Detect Infeasible Optimization Problems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2305.12211 |