{"title":"A dual parameterization approach to linear-quadratic semi-infinite programming problems","authors":"Y. Liu, K. Teo, S. Ito","doi":"10.1080/10556789908805725","DOIUrl":null,"url":null,"abstract":"Semi-infinite programming problems are special optimization problems in which a cost is to be minimized subject to infinitely many constraints. This class of problems has many real-world applications. In this paper, we consider a class of linear-quadratic semi-infinite programming problems. Using the duality theory, the dual problem is obtained, where the decision variables are measures. A new parameterization scheme is developed for approximating these measures. On this bases, an efficient algorithm for computing the solution of the dual problem is obtained. Rigorous convergence results are given to support the algorithm. The solution of the primal problem is easily obtained from that of the dual problem. For illustration, three numerical examples are included.","PeriodicalId":54673,"journal":{"name":"Optimization Methods & Software","volume":"92 1","pages":"471-495"},"PeriodicalIF":1.4000,"publicationDate":"1999-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optimization Methods & Software","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1080/10556789908805725","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 13
Abstract
Semi-infinite programming problems are special optimization problems in which a cost is to be minimized subject to infinitely many constraints. This class of problems has many real-world applications. In this paper, we consider a class of linear-quadratic semi-infinite programming problems. Using the duality theory, the dual problem is obtained, where the decision variables are measures. A new parameterization scheme is developed for approximating these measures. On this bases, an efficient algorithm for computing the solution of the dual problem is obtained. Rigorous convergence results are given to support the algorithm. The solution of the primal problem is easily obtained from that of the dual problem. For illustration, three numerical examples are included.
期刊介绍:
Optimization Methods and Software
publishes refereed papers on the latest developments in the theory and realization of optimization methods, with particular emphasis on the interface between software development and algorithm design.
Topics include:
Theory, implementation and performance evaluation of algorithms and computer codes for linear, nonlinear, discrete, stochastic optimization and optimal control. This includes in particular conic, semi-definite, mixed integer, network, non-smooth, multi-objective and global optimization by deterministic or nondeterministic algorithms.
Algorithms and software for complementarity, variational inequalities and equilibrium problems, and also for solving inverse problems, systems of nonlinear equations and the numerical study of parameter dependent operators.
Various aspects of efficient and user-friendly implementations: e.g. automatic differentiation, massively parallel optimization, distributed computing, on-line algorithms, error sensitivity and validity analysis, problem scaling, stopping criteria and symbolic numeric interfaces.
Theoretical studies with clear potential for applications and successful applications of specially adapted optimization methods and software to fields like engineering, machine learning, data mining, economics, finance, biology, or medicine. These submissions should not consist solely of the straightforward use of standard optimization techniques.