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

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

2007
S. J. Li

In this paper, the equivalence relation between a semi-infinite quadratically constrained convex quadratic programming problem and a combined semidefinite and semi-infinite programming problem is considered. Then, an efficient and reliable discretization algorithm for solving a general class of combined semidefinite and semi-infinite programming problems is developed. Both the continuoustime en...

1999
Jan-J. Rückmann Alexander Shapiro

This paper deals with generalized semi-infinite optimization problems where the (infinite) index set of inequality constraints depends on the state variables and all involved functions are twice continuously differentiable. Necessary and sufficient second order optimality conditions for such problems are derived under assumptions which imply that the corresponding optimal value function is seco...

2008
Changyu Wang Jinchuan Zhou Xiuhua Xu

In this paper, we develop the sufficient conditions for the existence of local and global saddle points of two classes of augmented Lagrangian functions for nonconvex optimization problem with both equality and inequality constraints, which improve the corresponding results in available papers. The main feature of our sufficient condition for the existence of global saddle points is that we do ...

2007
Jane J. Ye Soon-Yi Wu E. Polak

In this paper we study first order optimality conditions for the class of generalized semi-infinite programming problems (GSIPs). We extend various wellknown constraint qualifications for finite programming problems to GSIPs and analyze the extent to which a corresponding Karush-Kuhn-Tucker (KKT) condition depends on these extensions. It is shown that in general the KKT condition for GSIPs take...

Journal: :ESAIM: Control, Optimisation and Calculus of Variations 2008

Journal: :SIAM Journal on Optimization 2010
Huynh van Ngai Alexander Kruger Michel Théra

In this paper, we are concerned with the stability of the error bounds for semi-infinite convex constraint systems. Roughly speaking, the error bound of a system of inequalities is said to be stable if all its “small” perturbations admit a (local or global) error bound. We first establish subdifferential characterizations of the stability of error bounds for semi-infinite systems of convex ineq...

H. Zavieh, S. H. Nasseri,

In practice, there are many problems which decision parameters are fuzzy numbers, and some kind of this problems are formulated as either possibilitic programming or multi-objective programming methods. In this paper, we consider a multi-objective programming problem with fuzzy data in constraints and introduce a new approach for solving these problems base on a combination of the multi-objecti...

Journal: :Oper. Res. Lett. 2007
Michi Nishihara Mutsunori Yagiura Toshihide Ibaraki

We clarify a financial meaning of duality in the semi-infinite programming problem which emerges in the context of determining a derivative price range based only on the no-arbitrage assumption and the observed prices of other derivatives. The interpretation links studies in the above context to studies in stochastic models.

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

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