Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2501.15419 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914546714673152 |
|---|---|
| author | Obara, Mitsuaki Okuno, Takayuki Takeda, Akiko |
| author_facet | Obara, Mitsuaki Okuno, Takayuki Takeda, Akiko |
| contents | We consider Riemannian inequality-constrained optimization problems. Such problems inherit the benefits of Riemannian approach developed in the unconstrained setting and naturally arise from applications in control, machine learning, and other fields. We propose a Riemannian primal-dual interior point trust region method (RIPTRM) for solving them. We prove its global convergence to an approximate Karush-Kuhn-Tucker point and a weak second-order stationary point. Under the strict complementarity condition, this result reduces to global convergence to a second-order stationary point. To the best of our knowledge, this is the first algorithm that incorporates the trust region strategy for constrained optimization on Riemannian manifolds, and has the second-order convergence property for optimization problems on Riemannian manifolds with nonlinear inequality constraints. We conduct numerical experiments in which we introduce a truncated conjugate gradient method and an eigenvalue-based subsolver for RIPTRM to approximately and exactly solve the trust region subproblems, respectively. Empirical results show that RIPTRMs consistently find solutions with high accuracy. Additionally, we observe that RIPTRM with the exact search direction shows promising performance in an instance where the Hessian of the Lagrangian has a large negative eigenvalue. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_15419 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems Obara, Mitsuaki Okuno, Takayuki Takeda, Akiko Optimization and Control We consider Riemannian inequality-constrained optimization problems. Such problems inherit the benefits of Riemannian approach developed in the unconstrained setting and naturally arise from applications in control, machine learning, and other fields. We propose a Riemannian primal-dual interior point trust region method (RIPTRM) for solving them. We prove its global convergence to an approximate Karush-Kuhn-Tucker point and a weak second-order stationary point. Under the strict complementarity condition, this result reduces to global convergence to a second-order stationary point. To the best of our knowledge, this is the first algorithm that incorporates the trust region strategy for constrained optimization on Riemannian manifolds, and has the second-order convergence property for optimization problems on Riemannian manifolds with nonlinear inequality constraints. We conduct numerical experiments in which we introduce a truncated conjugate gradient method and an eigenvalue-based subsolver for RIPTRM to approximately and exactly solve the trust region subproblems, respectively. Empirical results show that RIPTRMs consistently find solutions with high accuracy. Additionally, we observe that RIPTRM with the exact search direction shows promising performance in an instance where the Hessian of the Lagrangian has a large negative eigenvalue. |
| title | A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2501.15419 |