{"title":"PSEUDO-CONVEX功能","authors":"O. Mangasarian","doi":"10.1137/0303020","DOIUrl":null,"url":null,"abstract":"The purpose of this work is to, introduce pseudo-convex functions and to describe some of their properties and applications. The class of all pseudo-convex functions over a convex set C includes the class of all differentiable convex functions on C and is included in the class of all differentiable quasi-convex functions on C. An interesting property of pseudo-convex functions is that a local condition, such as the vanishing of the gradient, is a global optimality condition. One of the main results of this work consists of showing that the Kuhn-Tucker differential conditions are sufficient for optimality when the objective function is pseudo-convex and the constraints are quasi-convex. Other results of this work are a strict converse duality theorem for mathematical programming and a stability criterion for ordinary differential equations.","PeriodicalId":215491,"journal":{"name":"Journal of The Society for Industrial and Applied Mathematics, Series A: Control","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"265","resultStr":"{\"title\":\"PSEUDO-CONVEX FUNCTIONS\",\"authors\":\"O. Mangasarian\",\"doi\":\"10.1137/0303020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The purpose of this work is to, introduce pseudo-convex functions and to describe some of their properties and applications. The class of all pseudo-convex functions over a convex set C includes the class of all differentiable convex functions on C and is included in the class of all differentiable quasi-convex functions on C. An interesting property of pseudo-convex functions is that a local condition, such as the vanishing of the gradient, is a global optimality condition. One of the main results of this work consists of showing that the Kuhn-Tucker differential conditions are sufficient for optimality when the objective function is pseudo-convex and the constraints are quasi-convex. Other results of this work are a strict converse duality theorem for mathematical programming and a stability criterion for ordinary differential equations.\",\"PeriodicalId\":215491,\"journal\":{\"name\":\"Journal of The Society for Industrial and Applied Mathematics, Series A: Control\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"265\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of The Society for Industrial and Applied Mathematics, Series A: Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/0303020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Society for Industrial and Applied Mathematics, Series A: Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0303020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The purpose of this work is to, introduce pseudo-convex functions and to describe some of their properties and applications. The class of all pseudo-convex functions over a convex set C includes the class of all differentiable convex functions on C and is included in the class of all differentiable quasi-convex functions on C. An interesting property of pseudo-convex functions is that a local condition, such as the vanishing of the gradient, is a global optimality condition. One of the main results of this work consists of showing that the Kuhn-Tucker differential conditions are sufficient for optimality when the objective function is pseudo-convex and the constraints are quasi-convex. Other results of this work are a strict converse duality theorem for mathematical programming and a stability criterion for ordinary differential equations.