Continuous Optimization On generalized semi-infinite optimization and bilevel optimization
نویسندگان
چکیده
The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a special case of a (BL). We consider the so-called reduction approach for (BL) and (GSIP) leading to optimality conditions and Newton-type methods for solving the problems. We show by a structural analysis that for (GSIP)-problems the regularity assumptions for the reduction approach can be expected to hold generically at a solution but for general (BL)-problems not. The genericity behavior of (BL) and (GSIP) is in particular studied for linear problems. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
On generalized semi-infinite optimization and bilevel optimization
The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a special case of a (BL). We consider the so-called reduction approach for (BL) and (GSIP) leading to optimality conditions and Newtontype methods for solving the problems. We show by a structural analysis that for (GSIP)-...
متن کاملA lifting method for generalized semi-infinite programs based on lower level Wolfe duality
This paper introduces novel numerical solution strategies for generalized semi-infinite optimization problems (GSIP), a class of mathematical optimization problems which occur naturally in the context of design centering problems, robust optimization problems, and many fields of engineering science. GSIPs can be regarded as bilevel optimization problems, where a parametric lower-level maximizat...
متن کاملA New Approach for Approximating Solution of Continuous Semi-Infinite Linear Programming
This paper describes a new optimization method for solving continuous semi-infinite linear problems. With regard to the dual properties, the problem is presented as a measure theoretical optimization problem, in which the existence of the solution is guaranteed. Then, on the basis of the atomic measure properties, a computation method was presented for obtaining the near optimal so...
متن کاملPessimistic Bilevel Optimization
We study a variant of the pessimistic bilevel optimization problem, which comprises constraints that must be satisfied for any optimal solution of a subordinate (lower-level) optimization problem. We present conditions that guarantee the existence of optimal solutions in such a problem, and we characterize the computational complexity of various subclasses of the problem. We then focus on probl...
متن کاملSemi-Infinite Optimization with Implicit Functions
In this work, equality-constrained bilevel optimization problems, arising from engineering design, economics, and operations research problems, are reformulated as an equivalent semi-infinite program (SIP) with implicit functions embedded, which are defined by the original equality constraints that model the system. Using recently developed theoretical tools for bounding implicit functions, a r...
متن کامل