Thông tin tài liệu


Nhan đề : 
Inexact penalty decomposition methods for optimization problems with geometric constraints
Tác giả : 
Christian, Kanzow
Matteo, Lapucci
Năm xuất bản : 
2023
Nhà xuất bản : 
Springer
Tóm tắt : 
This paper provides a theoretical and numerical investigation of a penalty decomposition scheme for the solution of optimization problems with geometric constraints. In particular, we consider some situations where parts of the constraints are nonconvex and complicated, like cardinality constraints, disjunctive programs, or matrix problems involving rank constraints. By a variable duplication and decomposition strategy, the method presented here explicitly handles these difficult constraints, thus generating iterates which are feasible with respect to them, while the remaining (standard and supposingly simple) constraints are tackled by sequential penalization. Inexact optimization steps are proven sufficient for the resulting algorithm to work, so that it is employable even with difficult objective functions.
Mô tả: 
CC BY
URI: 
https://link.springer.com/article/10.1007/s10589-023-00475-2
https://dlib.phenikaa-uni.edu.vn/handle/PNK/7551
Bộ sưu tập
OER - Khoa học Tự nhiên
XEM MÔ TẢ

13

XEM TOÀN VĂN

56

Danh sách tệp tin đính kèm: