• Title/Summary/Keyword: semi-infinite programming

Search Result 6, Processing Time 0.022 seconds

OPTIMALITY CONDITIONS AND DUALITY FOR SEMI-INFINITE PROGRAMMING INVOLVING SEMILOCALLY TYPE I-PREINVEX AND RELATED FUNCTIONS

  • Jaiswal, Monika;Mishra, Shashi Kant;Al Shamary, Bader
    • Communications of the Korean Mathematical Society
    • /
    • v.27 no.2
    • /
    • pp.411-423
    • /
    • 2012
  • A nondifferentiable nonlinear semi-infinite programming problem is considered, where the functions involved are ${\eta}$-semidifferentiable type I-preinvex and related functions. Necessary and sufficient optimality conditions are obtained for a nondifferentiable nonlinear semi-in nite programming problem. Also, a Mond-Weir type dual and a general Mond-Weir type dual are formulated for the nondifferentiable semi-infinite programming problem and usual duality results are proved using the concepts of generalized semilocally type I-preinvex and related functions.

SOLVING A CLASS OF GENERALIZED SEMI-INFINITE PROGRAMMING VIA AUGMENTED LAGRANGIANS

  • Zhang, Haiyan;Liu, Fang;Wang, Changyu
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.1_2
    • /
    • pp.365-374
    • /
    • 2009
  • Under certain conditions, we use augmented Lagrangians to transform a class of generalized semi-infinite min-max problems into common semi-infinite min-max problems, with the same set of local and global solutions. We give two conditions for the transformation. One is a necessary and sufficient condition, the other is a sufficient condition which can be verified easily in practice. From the transformation, we obtain a new first-order optimality condition for this class of generalized semi-infinite min-max problems.

  • PDF

A SUPERLINEAR $\mathcal{VU}$ SPACE-DECOMPOSITION ALGORITHM FOR SEMI-INFINITE CONSTRAINED PROGRAMMING

  • Huang, Ming;Pang, Li-Ping;Lu, Yuan;Xia, Zun-Quan
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.5_6
    • /
    • pp.759-772
    • /
    • 2012
  • In this paper, semi-infinite constrained programming, a class of constrained nonsmooth optimization problems, are transformed into unconstrained nonsmooth convex programs under the help of exact penalty function. The unconstrained objective function which owns the primal-dual gradient structure has connection with $\mathcal{VU}$-space decomposition. Then a $\mathcal{VU}$-space decomposition method can be applied for solving this unconstrained programs. Finally, the superlinear convergence algorithm is proved under certain assumption.

An algorithm for computer-aided controller design using semi-infinite programming technique (SIP를 이용한 computer-aided 제어기 설계에 대한 알고리즘)

  • 권태용;이종용;이상효
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1986.10a
    • /
    • pp.629-632
    • /
    • 1986
  • Both combinatorial and parametric optimization are used in computer-aided design(CAD). The most commonly occuring parametric optimization problems in engineering design such as design of control systems, design of electric circuits are usually expressed either as differentiable or as nondifferentiable semi-infinite programming(SIP) problems. In this paper we express algorithms for a class of computer-aided design problems arising in control systems.

  • PDF

ROBUST SEMI-INFINITE INTERVAL-VALUED OPTIMIZATION PROBLEM WITH UNCERTAIN INEQUALITY CONSTRAINTS

  • Jaichander, Rekha R.;Ahmad, Izhar;Kummari, Krishna
    • Korean Journal of Mathematics
    • /
    • v.30 no.3
    • /
    • pp.475-489
    • /
    • 2022
  • This paper focuses on a robust semi-infinite interval-valued optimization problem with uncertain inequality constraints (RSIIVP). By employing the concept of LU-optimal solution and Extended Mangasarian-Fromovitz Constraint Qualification (EMFCQ), necessary optimality conditions are established for (RSIIVP) and then sufficient optimality conditions for (RSIIVP) are derived, by using the tools of convexity. Moreover, a Wolfe type dual problem for (RSIIVP) is formulated and usual duality results are discussed between the primal (RSIIVP) and its dual (RSIWD) problem. The presented results are demonstrated by non-trivial examples.

Dynamic analysis of concrete gravity dam-reservoir systems by wavenumber approach in the frequency domain

  • Lotfi, Vahid;Samii, Ali
    • Earthquakes and Structures
    • /
    • v.3 no.3_4
    • /
    • pp.533-548
    • /
    • 2012
  • Dynamic analysis of concrete gravity dam-reservoir systems is an important topic in the study of fluid-structure interaction problems. It is well-known that the rigorous approach for solving this problem relies heavily on employing a two-dimensional semi-infinite fluid element. The hyper-element is formulated in frequency domain and its application in this field has led to many especial purpose programs which were demanding from programming point of view. In this study, a technique is proposed for dynamic analysis of dam-reservoir systems in the context of pure finite element programming which is referred to as the wavenumber approach. In this technique, the wavenumber condition is imposed on the truncation boundary or the upstream face of the near-field water domain. The method is initially described. Subsequently, the response of an idealized triangular dam-reservoir system is obtained by this approach, and the results are compared against the exact response. Based on this investigation, it is concluded that this approach can be envisaged as a great substitute for the rigorous type of analysis.