全局二次优化的一个充分条件

IF 0.5 Q4 ECONOMICS

Croatian Operational Research Review Pub Date : 2020-07-02 DOI:10.17535/crorr.2020.0002

Mourad Naffouti, A. Baccari

{"title":"全局二次优化的一个充分条件","authors":"Mourad Naffouti, A. Baccari","doi":"10.17535/crorr.2020.0002","DOIUrl":null,"url":null,"abstract":"This paper is devoted to global optimality conditions for quadratic optimization problems in a real space of dimension n. More precisely, we are concerned with nonconvex quadratic optimization problems with linear constraints. We present some sufficient conditions of global optimality for such problems subject to linear equality and inequality constraints. We prove that when the set of Karush-Kuhn-Tucker triplets of this problem is convex, then a local minimizer is global","PeriodicalId":44065,"journal":{"name":"Croatian Operational Research Review","volume":"11 1","pages":"11-19"},"PeriodicalIF":0.5000,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.17535/crorr.2020.0002","citationCount":"0","resultStr":"{\"title\":\"A sufficient conditions for global quadratic optimization\",\"authors\":\"Mourad Naffouti, A. Baccari\",\"doi\":\"10.17535/crorr.2020.0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is devoted to global optimality conditions for quadratic optimization problems in a real space of dimension n. More precisely, we are concerned with nonconvex quadratic optimization problems with linear constraints. We present some sufficient conditions of global optimality for such problems subject to linear equality and inequality constraints. We prove that when the set of Karush-Kuhn-Tucker triplets of this problem is convex, then a local minimizer is global\",\"PeriodicalId\":44065,\"journal\":{\"name\":\"Croatian Operational Research Review\",\"volume\":\"11 1\",\"pages\":\"11-19\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2020-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.17535/crorr.2020.0002\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Croatian Operational Research Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17535/crorr.2020.0002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Croatian Operational Research Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17535/crorr.2020.0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了实n维空间中二次优化问题的全局最优性条件。更确切地说，我们关注的是具有线性约束的非凸二次优化。在线性等式和不等式约束下，我们给出了这类问题全局最优性的一些充分条件。我们证明了当这个问题的Karush-Kuhn-Tucker三元组集是凸的时，则局部极小值是全局的

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A sufficient conditions for global quadratic optimization

This paper is devoted to global optimality conditions for quadratic optimization problems in a real space of dimension n. More precisely, we are concerned with nonconvex quadratic optimization problems with linear constraints. We present some sufficient conditions of global optimality for such problems subject to linear equality and inequality constraints. We prove that when the set of Karush-Kuhn-Tucker triplets of this problem is convex, then a local minimizer is global

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Croatian Operational Research Review ECONOMICS-

CiteScore

1.40

自引率

0.00%

发文量

审稿时长

22 weeks

期刊介绍： Croatian Operational Research Review (CRORR) is the journal which publishes original scientific papers from the area of operational research. The purpose is to publish papers from various aspects of operational research (OR) with the aim of presenting scientific ideas that will contribute both to theoretical development and practical application of OR. The scope of the journal covers the following subject areas: linear and non-linear programming, integer programing, combinatorial and discrete optimization, multi-objective programming, stohastic models and optimization, scheduling, macroeconomics, economic theory, game theory, statistics and econometrics, marketing and data analysis, information and decision support systems, banking, finance, insurance, environment, energy, health, neural networks and fuzzy systems, control theory, simulation, practical OR and applications. The audience includes both researchers and practitioners from the area of operations research, applied mathematics, statistics, econometrics, intelligent methods, simulation, and other areas included in the above list of topics. The journal has an international board of editors, consisting of more than 30 editors – university professors from Croatia, Slovenia, USA, Italy, Germany, Austria and other coutries.