Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909645130432512 |
|---|---|
| author | Wang, Nuozhou Zhang, Junyu Zhang, Shuzhong |
| author_facet | Wang, Nuozhou Zhang, Junyu Zhang, Shuzhong |
| contents | We introduce and study various algorithms for solving nonconvex minimization with inequality constraints, based on the construction of convex surrogate envelopes that majorize the objective and the constraints. In the case where the objective and constraint functions are gradient Hölderian continuous, the surrogate functions can be readily constructed and the solution method can be efficiently implemented. The surrogate envelopes are extended to the settings where the second-order information is available, and the convex subproblems are further represented by Dikin ellipsoids using the self-concordance of the convex surrogate constraints. Iteration complexities have been developed for both convex and nonconvex optimization models. The numerical results show promising potential of the proposed approaches. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_08506 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization Wang, Nuozhou Zhang, Junyu Zhang, Shuzhong Optimization and Control We introduce and study various algorithms for solving nonconvex minimization with inequality constraints, based on the construction of convex surrogate envelopes that majorize the objective and the constraints. In the case where the objective and constraint functions are gradient Hölderian continuous, the surrogate functions can be readily constructed and the solution method can be efficiently implemented. The surrogate envelopes are extended to the settings where the second-order information is available, and the convex subproblems are further represented by Dikin ellipsoids using the self-concordance of the convex surrogate constraints. Iteration complexities have been developed for both convex and nonconvex optimization models. The numerical results show promising potential of the proposed approaches. |
| title | Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2506.08506 |