Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.03787 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908865477476352 |
|---|---|
| author | Zhang, Chao Wang, Di |
| author_facet | Zhang, Chao Wang, Di |
| contents | We consider a class of two-stage nonconvex nonsmooth stochastic conic program, where the objective functions in both stages can contain nonsmooth terms that are functions with easily computed proximal mappings, further composed with affine mappings. This kind of problem is capable of modeling various applications. Solving these problems, however, can be challenging due to the two-stage structure with possibly large number of scenarios, the nonconvex, nonsmooth and even non-Lipschitz discontinuous terms, as well as the conic constraints. In this paper, we define a KKT point of the problem, show that it is a necessary optimality condition under mild conditions, and transform it to an equivalent nonmonotone nonsmooth two-stage stochastic variational inequality (SVI). We then propose a successive difference-of-convex (SDC) method by making use of Moreau envelope to solve it, the subproblems of which are approximately solved by the progressive hedging method for solving maximal monotone two-stage SVI. We show the rigorous convergence of our method under suitable assumptions. An extension of Markowitz's mean-variance model is provided as an application and numerical results on it demonstrate the effectiveness of the model and the SDC method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_03787 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | A successive difference-of-convex method for a class of two-stage nonconvex nonsmooth stochastic conic program via SVI Zhang, Chao Wang, Di Optimization and Control 90C15, 90C33, 49J40 We consider a class of two-stage nonconvex nonsmooth stochastic conic program, where the objective functions in both stages can contain nonsmooth terms that are functions with easily computed proximal mappings, further composed with affine mappings. This kind of problem is capable of modeling various applications. Solving these problems, however, can be challenging due to the two-stage structure with possibly large number of scenarios, the nonconvex, nonsmooth and even non-Lipschitz discontinuous terms, as well as the conic constraints. In this paper, we define a KKT point of the problem, show that it is a necessary optimality condition under mild conditions, and transform it to an equivalent nonmonotone nonsmooth two-stage stochastic variational inequality (SVI). We then propose a successive difference-of-convex (SDC) method by making use of Moreau envelope to solve it, the subproblems of which are approximately solved by the progressive hedging method for solving maximal monotone two-stage SVI. We show the rigorous convergence of our method under suitable assumptions. An extension of Markowitz's mean-variance model is provided as an application and numerical results on it demonstrate the effectiveness of the model and the SDC method. |
| title | A successive difference-of-convex method for a class of two-stage nonconvex nonsmooth stochastic conic program via SVI |
| topic | Optimization and Control 90C15, 90C33, 49J40 |
| url | https://arxiv.org/abs/2603.03787 |