Characterizing solution set of a nonconvex programming problem via its dual problems

Characterizing solution set of a nonconvex programming problem via its dual problems

Using duality theory, we propose a new approach to charact erize solution set of a nonconvex optimization problem. Several characterizations of solution set of the problem are established via it s dual problems. Charact eriza tions of solution sets of some class of convexj'nonconvex optimizatio...

Mô tả đầy đủ

Đã lưu trong:
Chi tiết về thư mục
Những tác giả chính: Đỗ, Sang Kim, Tạ, Quang Sơn
Định dạng: Bài viết
Ngôn ngữ:English
Được phát hành: Trường Đại học Đà Lạt 2014
Những chủ đề:
Mixed type duality
Lagrange function
Solution set
Truy cập trực tuyến:https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428
Các nhãn: Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
Thư viện lưu trữ: Thư viện Trường Đại học Đà Lạt
id oai:scholar.dlu.edu.vn:DLU123456789-37428
record_format dspace
spelling oai:scholar.dlu.edu.vn:DLU123456789-374282023-10-27T14:41:50Z Characterizing solution set of a nonconvex programming problem via its dual problems Đỗ, Sang Kim Tạ, Quang Sơn Mixed type duality Lagrange function Solution set Using duality theory, we propose a new approach to charact erize solution set of a nonconvex optimization problem. Several characterizations of solution set of the problem are established via it s dual problems. Charact eriza tions of solution sets of some class of convexj'nonconvex optimization problems given in several papers before can be covered. Example is given. Mathematics Subject Classification. 90C46, 49N15. 2014-05-29T01:28:07Z 2014-05-29T01:28:07Z 2012 Article https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428 en Tạp chí Khoa học Đại học Đà Lạt, số 3b;tr. 14-22 application/pdf Trường Đại học Đà Lạt
institution Thư viện Trường Đại học Đà Lạt
collection Thư viện số
language English
topic Mixed type duality
Lagrange function
Solution set
spellingShingle Mixed type duality
Lagrange function
Solution set
Đỗ, Sang Kim
Tạ, Quang Sơn
Characterizing solution set of a nonconvex programming problem via its dual problems
description Using duality theory, we propose a new approach to charact erize solution set of a nonconvex optimization problem. Several characterizations of solution set of the problem are established via it s dual problems. Charact eriza tions of solution sets of some class of convexj'nonconvex optimization problems given in several papers before can be covered. Example is given. Mathematics Subject Classification. 90C46, 49N15.
format Article
author Đỗ, Sang Kim
Tạ, Quang Sơn
author_facet Đỗ, Sang Kim
Tạ, Quang Sơn
author_sort Đỗ, Sang Kim
title Characterizing solution set of a nonconvex programming problem via its dual problems
title_short Characterizing solution set of a nonconvex programming problem via its dual problems
title_full Characterizing solution set of a nonconvex programming problem via its dual problems
title_fullStr Characterizing solution set of a nonconvex programming problem via its dual problems
title_full_unstemmed Characterizing solution set of a nonconvex programming problem via its dual problems
title_sort characterizing solution set of a nonconvex programming problem via its dual problems
publisher Trường Đại học Đà Lạt
publishDate 2014
url https://scholar.dlu.edu.vn/thuvienso/handle/DLU123456789/37428
_version_ 1781718738833244160

Những quyển sách tương tự