兩個非對稱錐上最佳化問題之解集合的刻畫
No Thumbnail Available
Date
2017
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
無中文摘要
This paper is devoted to the characterizations of solution sets for general cone-constrained convex programming problems.In particular,when the cone reduces to two specific and nonsymmetric cone,that is,the power cone and the exponential cone,we demonstrate that the conclusion can be also verified by exploiting the structures of those two cones.
This paper is devoted to the characterizations of solution sets for general cone-constrained convex programming problems.In particular,when the cone reduces to two specific and nonsymmetric cone,that is,the power cone and the exponential cone,we demonstrate that the conclusion can be also verified by exploiting the structures of those two cones.
Description
Keywords
無中文關鍵詞, Power cone, Exponential cone, Lagrange multipliers, K-convex mapping