Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions [PDF]
Yugoslav Journal of Operations Research, 2017 In this paper, we consider a nonsmooth semi-infinite multiobjective programming problem involving support functions. We establish sufficient optimality conditions for the primal problem.
Singh Yadvendra, Mishra S.K., Lai K.K.
doaj +1 more source
Solving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks [PDF]
Control and Optimization in Applied Mathematics, 2016 Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization
Alaeddin Malek +2 more
doaj
A Spline Smoothing Newton Method for Semi-Infinite Minimax Problems
Journal of Applied Mathematics, 2014 Based on discretization methods for solving semi-infinite programming problems, this paper presents a spline smoothing Newton method for semi-infinite minimax problems. The spline smoothing technique uses a smooth cubic spline instead of max function and
Li Dong, Bo Yu, Yu Xiao
doaj +1 more source
A reduction method for semi-infinite programming by means of a global stochastic approach [PDF]
, 2009 We describe a reduction algorithm for solving semi-infinite programming problems. The proposed algorithm uses the simulated annealing method equipped with a function stretching as a multi-local procedure, and a penalty technique for the finite ...
Pereira, Ana I. P. N. +3 more
core +1 more source
A solution method for combined semi-infinite and semi-definite programming [PDF]
, 2004 In this paper, we develop a discretisation algorithm with an adaptive scheme for solving a class of combined semi-infinite and semi-definite programming problems.
Yang, X. Q., Li, S. J.
core +2 more sources
On Constrained Set-Valued Semi-Infinite Programming Problems with ρ-Cone Arcwise Connectedness
Axioms, 2021 In this paper, we establish sufficient Karush–Kuhn–Tucker (for short, KKT) conditions of a set-valued semi-infinite programming problem (SP) via the notion of contingent epiderivative of set-valued maps. We also derive duality results of Mond–Weir (MWD),
Koushik Das, Savin Treanţă
doaj +1 more source
Optimality Conditions for Nondifferentiable Multiobjective Semi-Infinite Programming Problems
Abstract and Applied Analysis, 2016 We have considered a multiobjective semi-infinite programming problem with a feasible set defined by inequality constraints. First we studied a Fritz-John type necessary condition. Then, we introduced two constraint qualifications and derive the weak and
D. Barilla, G. Caristi, A. Puglisi
doaj +1 more source
International Journal for Simulation and Multidisciplinary Design Optimization, 2020 In this paper, we study a nonsmooth semi-infinite multi-objective E-convex programming problem involving support functions. We derive sufficient optimality conditions for the primal problem.
Emam Tarek
doaj +1 more source
Lagrange duality and saddle point optimality conditions for semi-infinite mathematical programming problems with equilibrium constraints [PDF]
Yugoslav Journal of Operations Research, 2019 In this paper, we consider a special class of optimization problems which contains infinitely many inequality constraints and finitely many complementarity constraints known as the semi-infinite mathematical programming problem with equilibrium ...
Singh Kunwar V.K. +2 more
doaj +1 more source
Numerical experiments in semi-infinite programming [PDF]
, 1993 A quasi-Newton algorithm for semi-infinite programming using an L∞ exact penalty function is described, and numerical results are presented. Comparisons with three Newton algorithms and one other quasi-Newton algorithm show that the algorithm is very
Coope, I. D., Price, Christopher John
core