陳界山Chen, Jein-Shan李明晏Li, Ming-Yen2019-09-052017-08-212019-09-052017http://etds.lib.ntnu.edu.tw/cgi-bin/gs32/gsweb.cgi?o=dstdcdr&s=id=%22G060440006S%22.&%22.id.&http://rportal.lib.ntnu.edu.tw:80/handle/20.500.12235/101564無中文摘要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.無中文關鍵詞Power coneExponential coneLagrange multipliersK-convex mapping