نتایج جستجو برای: convex semi infinite programming

تعداد نتایج: 567949  

Journal: :Computational Optimization and Applications 1996

Journal: :International Journal for Simulation and Multidisciplinary Design Optimization 2020

Journal: :European Journal of Operational Research 2007
Marco A. López Georg Still

A semi-infinite programming problem is an optimization problem in which finitely many variables appear in infinitely many constraints. This model naturally arises in an abundant number of applications in different fields of mathematics, economics and engineering. The paper, which intends to make a compromise between an introduction and a survey, treats the theoretical basis, numerical methods, ...

Journal: :Math. Program. 1992
Jonathan M. Borwein Adrian S. Lewis

In Part I of this work we derived a duality theorem for partially finite convex programs, problems for which the standard Slater condition fails almost invariably. Our result depended on a constraint qualification involving the notion of quasi relative interior. The derivation of the primal solution from a dual solution depended on the differentiability of the dual objective function: the diffe...

Journal: :SIAM Journal on Optimization 2017
Dávid Papp

In a common formulation of semi-infinite programs, the infinite constraint set is a requirement that a function parametrized by the decision variables is nonnegative over an interval. If this function is sufficiently closely approximable by a polynomial or a rational function, then the semi-infinite program can be reformulated as an equivalent semidefinite program. Solving this semidefinite pro...

2008
A. Ismael F. Vaz Eugénio C. Ferreira

Article history: Received 28 July 2007 Received in revised form 30 April 2008 Accepted 1 May 2008 Available online 9 May 2008

2015
A. Tezel Özturan

In this paper, a trust region method for generalized semi-infinite programming problems is presented. The method is based on [O. Yi-gui, “A filter trust region method for solving semi-infinite programming problems”, J. Appl. Math. Comput. 29, 311 (2009)]. We transformed the method from standard to generalized semi-infinite programming problems. The semismooth reformulation of the Karush–Kuhn–Tu...

Journal: :Math. Program. 2013
Miguel A. Goberna Vaithilingam Jeyakumar Guoyin Li Marco A. López

In this paper, we propose a duality theory for semi-infinite linear programming problems under uncertainty in the constraint functions, the objective function, or both, within the framework of robust optimization. We present robust duality by establishing strong duality between the robust counterpart of an uncertain semi-infinite linear program and the optimistic counterpart of its uncertain La...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید