An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929514362175488 |
|---|---|
| author | Sempere, Gregorio M. de Oliveira, Welington Royset, Johannes O. |
| author_facet | Sempere, Gregorio M. de Oliveira, Welington Royset, Johannes O. |
| contents | This work proposes an implementable proximal-type method for a broad class of optimization problems involving nonsmooth and nonconvex objective and constraint functions. In contrast to existing methods that rely on an ad hoc model approximating the nonconvex functions, our approach can work with a nonconvex model constructed by the pointwise minimum of finitely many convex models. The latter can be chosen with reasonable flexibility to better fit the underlying functions' structure. We provide a unifying framework and analysis covering several subclasses of composite optimization problems and show that our method computes points satisfying certain necessary optimality conditions, which we will call model criticality. Depending on the specific model being used, our general concept of criticality boils down to standard necessary optimality conditions. Numerical experiments on some stochastic reliability-based optimization problems illustrate the practical performance of the method. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_07471 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint Sempere, Gregorio M. de Oliveira, Welington Royset, Johannes O. Optimization and Control This work proposes an implementable proximal-type method for a broad class of optimization problems involving nonsmooth and nonconvex objective and constraint functions. In contrast to existing methods that rely on an ad hoc model approximating the nonconvex functions, our approach can work with a nonconvex model constructed by the pointwise minimum of finitely many convex models. The latter can be chosen with reasonable flexibility to better fit the underlying functions' structure. We provide a unifying framework and analysis covering several subclasses of composite optimization problems and show that our method computes points satisfying certain necessary optimality conditions, which we will call model criticality. Depending on the specific model being used, our general concept of criticality boils down to standard necessary optimality conditions. Numerical experiments on some stochastic reliability-based optimization problems illustrate the practical performance of the method. |
| title | An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2407.07471 |