A smooth approximation approach for optimization with probabilistic constraints based on sigmoid function
نویسندگان
چکیده
Abstract Many practical problems, such as computer science, communications network, product design, system control, statistics and finance, etc.,can be formulated a probabilistic constrained optimization problem (PCOP) which is challenging to solve since it usually nonconvex nonsmooth. Effective methods for the mostly focus on approximation techniques, convex approximation, D.C. (difference of two functions) so on. This paper aims at studying smooth approach. A constraint function based sigmoid analyzed. Equivalence PCOP corresponding are shown under some appropriate assumptions. Sequential (SCA) algorithm implemented problem. Numerical results suggest that approach proposed effective problems with constraints.
منابع مشابه
A Sample Approximation Approach for Optimization with Probabilistic Constraints
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical distribution obtained from a random sample. We show that such a sample approximation problem with risk level larger than the required risk level will yield a lower bound to the true optimal value with probability approac...
متن کاملA Support Function Based Algorithm for Optimization with Eigenvalue Constraints
Optimization of convex functions subject to eigenvalue constraints is intriguing because of peculiar analytical properties of eigenvalue functions and is of practical interest because of a wide range of applications in fields such as structural design and control theory. Here we focus on the optimization of a linear objective subject to a constraint on the smallest eigenvalue of an analytic and...
متن کاملOn an Approach to Optimization Problems with a Probabilistic Cost and or Constraints
We present a new approach to a class of probability constrained optimization problems that arise in the context of optimal engineering design. These problems are characterized by the fact that the probability of failure of one or several components either must be minimized or must not exceed a preassigned threshold. Our approach is interactive: it consists of replacing the original optimal desi...
متن کاملKnapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities. We merge approximation algorithms ...
متن کاملGeoid Determination Based on Log Sigmoid Function of Artificial Neural Networks: (A case Study: Iran)
A Back Propagation Artificial Neural Network (BPANN) is a well-known learning algorithmpredicated on a gradient descent method that minimizes the square error involving the networkoutput and the goal of output values. In this study, 261 GPS/Leveling and 8869 gravity intensityvalues of Iran were selected, then the geoid with three methods “ellipsoidal stokes integral”,“BPANN”, and “collocation” ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2022
ISSN: ['1025-5834', '1029-242X']
DOI: https://doi.org/10.1186/s13660-022-02774-4