Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.07418 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908527158624256 |
|---|---|
| author | Yang, Chengmiao Jiao, Liguo Lee, Jae Hyoung |
| author_facet | Yang, Chengmiao Jiao, Liguo Lee, Jae Hyoung |
| contents | In this paper, we define a new type of nonsmooth convex function, called {\em first-order SDSOS-convex semi-algebraic function}, which is an extension of the previously proposed first-order SDSOS-convex polynomials (Chuong et al. in J Global Optim 75:885--919, 2019). This class of nonsmooth convex functions contains many well-known functions, such as the Euclidean norm, the $\ell_1$-norm commonly used in compressed sensing and sparse optimization, and the least squares function frequently employed in machine learning and regression analysis. We show that, under suitable assumptions, the optimal value and optimal solutions of first-order SDSOS-convex semi-algebraic programs can be found by exactly solving an associated second-order cone programming problem. Finally, an application to robust optimization with first-order SDSOS-convex polynomials is discussed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_07418 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | First-order SDSOS-convex semi-algebraic optimization and exact SOCP relaxations Yang, Chengmiao Jiao, Liguo Lee, Jae Hyoung Optimization and Control In this paper, we define a new type of nonsmooth convex function, called {\em first-order SDSOS-convex semi-algebraic function}, which is an extension of the previously proposed first-order SDSOS-convex polynomials (Chuong et al. in J Global Optim 75:885--919, 2019). This class of nonsmooth convex functions contains many well-known functions, such as the Euclidean norm, the $\ell_1$-norm commonly used in compressed sensing and sparse optimization, and the least squares function frequently employed in machine learning and regression analysis. We show that, under suitable assumptions, the optimal value and optimal solutions of first-order SDSOS-convex semi-algebraic programs can be found by exactly solving an associated second-order cone programming problem. Finally, an application to robust optimization with first-order SDSOS-convex polynomials is discussed. |
| title | First-order SDSOS-convex semi-algebraic optimization and exact SOCP relaxations |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2509.07418 |