79 results on '"Constrained optimization"'
Search Results
52. Algebraic Solution of Tropical Polynomial Optimization Problems.
- Author
-
Krivulin, Nikolai
- Subjects
- *
POLYNOMIALS , *PROBLEM solving , *LINEAR systems , *COMPUTATIONAL complexity , *ALGEBRA , *SEMIRINGS (Mathematics) , *CONSTRAINED optimization - Abstract
We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication). The problems are to minimize the objective functions given by tropical analogues of multivariate Puiseux polynomials, subject to box constraints on the variables. A technique for variable elimination is presented that converts the original optimization problem to a new one in which one variable is removed and the box constraint for this variable is modified. The novel approach may be thought of as an extension of the Fourier–Motzkin elimination method for systems of linear inequalities in ordered fields to the issue of polynomial optimization in ordered tropical semifields. We use this technique to develop a procedure to solve the problem in a finite number of iterations. The procedure includes two phases: backward elimination and forward substitution of variables. We describe the main steps of the procedure, discuss its computational complexity and present numerical examples. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
53. State Space Modeling with Non-Negativity Constraints Using Quadratic Forms.
- Author
-
Theodosiadou, Ourania and Tsaklidis, George
- Subjects
- *
KALMAN filtering , *ALGORITHMS , *STOCHASTIC processes , *QUADRATIC forms , *DYNAMICAL systems , *RANDOM variables , *CONSTRAINED optimization - Abstract
State space model representation is widely used for the estimation of nonobservable (hidden) random variables when noisy observations of the associated stochastic process are available. In case the state vector is subject to constraints, the standard Kalman filtering algorithm can no longer be used in the estimation procedure, since it assumes the linearity of the model. This kind of issue is considered in what follows for the case of hidden variables that have to be non-negative. This restriction, which is common in many real applications, can be faced by describing the dynamic system of the hidden variables through non-negative definite quadratic forms. Such a model could describe any process where a positive component represents "gain", while the negative one represents "loss"; the observation is derived from the difference between the two components, which stands for the "surplus". Here, a thorough analysis of the conditions that have to be satisfied regarding the existence of non-negative estimations of the hidden variables is presented via the use of the Karush–Kuhn–Tucker conditions. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
54. From an Optimal Point to an Optimal Region: A Novel Methodology for Optimization of Multimodal Constrained Problems and a Novel Constrained Sliding Particle Swarm Optimization Strategy.
- Author
-
Rebello, Carine M., Martins, Márcio A. F., Loureiro, José M., Rodrigues, Alírio E., Ribeiro, Ana M., and Nogueira, Idelfonso B. R.
- Subjects
- *
PARTICLE swarm optimization , *CONSTRAINED optimization , *CONFIDENCE regions (Mathematics) , *MOVING bed reactors , *CONFIDENCE intervals , *BIOFLUORESCENCE - Abstract
The present work proposes a novel methodology for an optimization procedure extending the optimal point to an optimal area based on an uncertainty map of deterministic optimization. To do so, this work proposes the deductions of a likelihood-based test to draw confidence regions of population-based optimizations. A novel Constrained Sliding Particle Swarm Optimization algorithm is also proposed that can cope with the optimization procedures characterized by multi-local minima. There are two open issues in the optimization literature, uncertainty analysis of the deterministic optimization and application of meta-heuristic algorithms to solve multi-local minima problems. The proposed methodology was evaluated in a series of five benchmark tests. The results demonstrated that the methodology is able to identify all the local minima and the global one, if any. Moreover, it was able to draw the confidence regions of all minima found by the optimization algorithm, hence, extending the optimal point to an optimal region. Moreover, providing the set of decision variables that can give an optimal value, with statistical confidence. Finally, the methodology is evaluated to address a case study from chemical engineering; the optimization of a complex multifunctional process where separation and reaction are processed simultaneously, a true moving bed reactor. The method was able to efficiently identify the two possible optimal operating regions of this process. Therefore, proving the practical application of this methodology. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
55. Second-Order PDE Constrained Controlled Optimization Problems with Application in Mechanics.
- Author
-
Treanţă, Savin
- Subjects
- *
CONSTRAINED optimization , *ALGORITHMS , *PROBLEM solving , *EULER-Lagrange equations , *LAGRANGE equations - Abstract
The present paper deals with a class of second-order PDE constrained controlled optimization problems with application in Lagrange–Hamilton dynamics. Concretely, we formulate and prove necessary conditions of optimality for the considered class of control problems driven by multiple integral cost functionals involving second-order partial derivatives. Moreover, an illustrative example is provided to highlight the effectiveness of the results derived in the paper. In the final part of the paper, we present an algorithm to summarize the steps for solving a control problem such as the one investigated here. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
56. A Real Time Bolometer Tomographic Reconstruction Algorithm in Nuclear Fusion Reactors.
- Author
-
Montisci, Augusto, Carcangiu, Sara, Sias, Giuliana, Cannas, Barbara, and Fanni, Alessandra
- Subjects
- *
FUSION reactors , *BOLOMETERS , *PLASMA physics , *CONSTRAINED optimization , *DISTRIBUTION (Probability theory) , *PLASMA confinement - Abstract
In tokamak nuclear fusion reactors, one of the main issues is to know the total emission of radiation, which is mandatory to understand the plasma physics and is very useful to monitor and control the plasma evolution. This radiation can be measured by means of a bolometer system that consists in a certain number of elements sensitive to the integral of the radiation along straight lines crossing the plasma. By placing the sensors in such a way to have families of crossing lines, sophisticated tomographic inversion algorithms allow to reconstruct the radiation tomography in the 2D poloidal cross-section of the plasma. In tokamaks, the number of projection cameras is often quite limited resulting in an inversion mathematic problem very ill conditioned so that, usually, it is solved by means of a grid-based, iterative constrained optimization procedure, whose convergence time is not suitable for the real time requirements. In this paper, to illustrate the method, an assumption not valid in general is made on the correlation among the grid elements, based on the statistical distribution of the radiation emissivity over a set of tomographic reconstructions, performed off-line. Then, a regularization procedure is carried out, which merge highly correlated grid elements providing a squared coefficients matrix with an enough low condition number. This matrix, which is inverted offline once for all, can be multiplied by the actual bolometer measures returning the tomographic reconstruction, with calculations suitable for real time application. The proposed algorithm is applied, in this paper, to a synthetic case study. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
57. An Enhanced DC-Link Voltage Response for Wind-Driven Doubly Fed Induction Generator Using Adaptive Fuzzy Extended State Observer and Sliding Mode Control.
- Author
-
Alhato, Mohammed Mazen, Ibrahim, Mohamed N., Rezk, Hegazy, Bouallègue, Soufiene, and Bizon, Nicu
- Subjects
- *
SLIDING mode control , *INDUCTION generators , *ADAPTIVE fuzzy control , *PARTICLE swarm optimization , *SEARCH algorithms , *CONSTRAINED optimization , *VOLTAGE - Abstract
This paper presents an enhancement method to improve the performance of the DC-link voltage loop regulation in a Doubly-Fed Induction Generator (DFIG)- based wind energy converter. An intelligent, combined control approach based on a metaheuristics-tuned Second-Order Sliding Mode (SOSM) controller and an adaptive fuzzy-scheduled Extended State Observer (ESO) is proposed and successfully applied. The proposed fuzzy gains-scheduling mechanism is performed to adaptively tune and update the bandwidth of the ESO while disturbances occur. Besides common time-domain performance indexes, bounded limitations on the effective parameters of the designed Super Twisting (STA)-based SOSM controllers are set thanks to the Lyapunov theory and used as nonlinear constraints for the formulated hard optimization control problem. A set of advanced metaheuristics, such as Thermal Exchange Optimization (TEO), Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Harmony Search Algorithm (HSA), Water Cycle Algorithm (WCA), and Grasshopper Optimization Algorithm (GOA), is considered to solve the constrained optimization problem. Demonstrative simulation results are carried out to show the superiority and effectiveness of the proposed control scheme in terms of grid disturbances rejection, closed-loop tracking performance, and robustness against the chattering phenomenon. Several comparisons to our related works, i.e., approaches based on TEO-tuned PI controller, TEO-tuned STA-SOSM controller, and STA-SOSM controller-based linear observer, are presented and discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
58. A Theoretical Framework for Optimality Conditions of Nonlinear Type-2 Interval-Valued Unconstrained and Constrained Optimization Problems Using Type-2 Interval Order Relations.
- Author
-
Rahman, Md Sadikur, Shaikh, Ali Akbar, Ali, Irfan, Bhunia, Asoke Kumar, Fügenschuh, Armin, and Massouros, Christos G.
- Subjects
- *
MATHEMATICAL optimization , *NONLINEAR theories , *CONSTRAINED optimization - Abstract
In the traditional nonlinear optimization theory, the Karush-Kuhn-Tucker (KKT) optimality conditions for constrained optimization problems with inequality constraints play an essential role. The situation becomes challenging when the theory of traditional optimization is discussed under uncertainty. Several researchers have discussed the interval approach to tackle nonlinear optimization uncertainty and derived the optimality conditions. However, there are several realistic situations in which the interval approach is not suitable. This study aims to introduce the Type-2 interval approach to overcome the limitation of the classical interval approach. This study introduces Type-2 interval order relation and Type-2 interval-valued function concepts to derive generalized KKT optimality conditions for constrained optimization problems under uncertain environments. Then, the optimality conditions are discussed for the unconstrained Type-2 interval-valued optimization problem and after that, using these conditions, generalized KKT conditions are derived. Finally, the proposed approach is demonstrated by numerical examples. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
59. A Projected Forward-Backward Algorithm for Constrained Minimization with Applications to Image Inpainting.
- Author
-
Suantai, Suthep, Kankam, Kunrada, Cholamjiak, Prasit, and Ciegis, Raimondas
- Subjects
- *
FORWARD-backward algorithm , *INPAINTING , *IMAGE processing , *CONSTRAINED optimization , *SUBDIFFERENTIALS - Abstract
In this research, we study the convex minimization problem in the form of the sum of two proper, lower-semicontinuous, and convex functions. We introduce a new projected forward-backward algorithm using linesearch and inertial techniques. We then establish a weak convergence theorem under mild conditions. It is known that image processing such as inpainting problems can be modeled as the constrained minimization problem of the sum of convex functions. In this connection, we aim to apply the suggested method for solving image inpainting. We also give some comparisons to other methods in the literature. It is shown that the proposed algorithm outperforms others in terms of iterations. Finally, we give an analysis on parameters that are assumed in our hypothesis. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
60. New Preconditioned Iteration Method Solving the Special Linear System from the PDE-Constrained Optimal Control Problem.
- Author
-
Li, Yan-Ran, Shao, Xin-Hui, Li, Shi-Yu, and Scapellato, Andrea
- Subjects
- *
LINEAR systems , *KRYLOV subspace , *PARTIAL differential equations , *CONSTRAINED optimization , *PROBLEM solving - Abstract
In many fields of science and engineering, partial differential equation (PDE) constrained optimal control problems are widely used. We mainly solve the optimization problem constrained by the time-periodic eddy current equation in this paper. We propose the three-block splitting (TBS) iterative method and proved that it is unconditionally convergent. At the same time, the corresponding TBS preconditioner is derived from the TBS iteration method, and we studied the spectral properties of the preconditioned matrix. Finally, numerical examples in two-dimensions is applied to demonstrate the advantages of the TBS iterative method and TBS preconditioner with the Krylov subspace method. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
61. Algebraic Solution to Constrained Bi-Criteria Decision Problem of Rating Alternatives through Pairwise Comparisons.
- Author
-
Krivulin, Nikolai and Kolokoltsov, Vassili
- Subjects
- *
STATISTICAL decision making , *CHEBYSHEV approximation , *PROBLEM solving , *APPROXIMATION error , *CONSTRAINED optimization , *SEMIRINGS (Mathematics) - Abstract
We consider a decision-making problem to evaluate absolute ratings of alternatives from the results of their pairwise comparisons according to two criteria, subject to constraints on the ratings. We formulate the problem as a bi-objective optimization problem of constrained matrix approximation in the Chebyshev sense in logarithmic scale. The problem is to approximate the pairwise comparison matrices for each criterion simultaneously by a common consistent matrix of unit rank, which determines the vector of ratings. We represent and solve the optimization problem in the framework of tropical (idempotent) algebra, which deals with the theory and applications of idempotent semirings and semifields. The solution involves the introduction of two parameters that represent the minimum values of approximation error for each matrix and thereby describe the Pareto frontier for the bi-objective problem. The optimization problem then reduces to a parametrized vector inequality. The necessary and sufficient conditions for solutions of the inequality serve to derive the Pareto frontier for the problem. All solutions of the inequality, which correspond to the Pareto frontier, are taken as a complete Pareto-optimal solution to the problem. We apply these results to the decision problem of interest and present illustrative examples. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
62. A Kriging-Assisted Multi-Objective Constrained Global Optimization Method for Expensive Black-Box Functions †.
- Author
-
Li, Yaohui, Shen, Jingfang, Cai, Ziliang, Wu, Yizhong, and Wang, Shuting
- Subjects
- *
KRIGING , *GLOBAL optimization , *CONSTRAINED optimization , *STANDARD deviations - Abstract
The kriging optimization method that can only obtain one sampling point per cycle has encountered a bottleneck in practical engineering applications. How to find a suitable optimization method to generate multiple sampling points at a time while improving the accuracy of convergence and reducing the number of expensive evaluations has been a wide concern. For this reason, a kriging-assisted multi-objective constrained global optimization (KMCGO) method has been proposed. The sample data obtained from the expensive function evaluation is first used to construct or update the kriging model in each cycle. Then, kriging-based estimated target, RMSE (root mean square error), and feasibility probability are used to form three objectives, which are optimized to generate the Pareto frontier set through multi-objective optimization. Finally, the sample data from the Pareto frontier set is further screened to obtain more promising and valuable sampling points. The test results of five benchmark functions, four design problems, and a fuel economy simulation optimization prove the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
63. Optimality Conditions for Group Sparse Constrained Optimization Problems.
- Author
-
Wu, Wenying and Peng, Dingtao
- Subjects
- *
CONSTRAINED optimization , *CONES - Abstract
In this paper, optimality conditions for the group sparse constrained optimization (GSCO) problems are studied. Firstly, the equivalent characterizations of Bouligand tangent cone, Clarke tangent cone and their corresponding normal cones of the group sparse set are derived. Secondly, by using tangent cones and normal cones, four types of stationary points for GSCO problems are given: T B -stationary point, N B -stationary point, T C -stationary point and N C -stationary point, which are used to characterize first-order optimality conditions for GSCO problems. Furthermore, both the relationship among the four types of stationary points and the relationship between stationary points and local minimizers are discussed. Finally, second-order necessary and sufficient optimality conditions for GSCO problems are provided. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
64. Constrained Mixed-Variable Design Optimization Based on Particle Swarm Optimizer with a Diversity Classifier for Cyclically Neighboring Subpopulations.
- Author
-
Kim, Tae-Hyoung, Cho, Minhaeng, and Shin, Sangwoo
- Subjects
- *
METAHEURISTIC algorithms , *PARTICLE swarm optimization , *PARTICLE interactions , *ENGINEERING design - Abstract
In this research, an easy-to-use particle swarm optimizer (PSO) for solving constrained engineering design problems involving mixed-integer-discrete-continuous (MIDC) variables that adopt two kinds of diversity-enhancing mechanisms to achieve superior reliability and validity was developed. As an initial diversity-boosting tool, the local neighborhood topology of each particle is set up such that information exchange is restricted to a limited number of consecutively numbered particles. This topological mechanism forces each particle to move in the search space while interacting only with its neighboring subpopulation. The second diversity-enhancing task is to ensure that the exploration behavior of each particle in the search space is governed such that it follows the diversity classifier decision applied to its subpopulation. This diversity classification iteratively adjusts the three-phase velocity-related mechanism of each particle such that it approaches or retreats from its previous best position/the current best position among the subpopulation. In summary, this PSO tool not only introduces the social interaction of the particle within its cyclically neighboring subpopulation but also exploits the three-phase velocity behavior law governed by the distributed diversity measures categorized for each neighboring subpopulation. This scheme has superior reliability, as well as high practicality for engineering optimization problems involving MIDC variables, which are handled by the widely adopted straightforward rounding-off technique used in most swarm-inspired metaheuristic search technologies. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
65. A New Algorithm for the Common Solutions of a Generalized Variational Inequality System and a Nonlinear Operator Equation in Banach Spaces.
- Author
-
Wang, Yuanheng, Li, Cancan, and Lu, Lirong
- Subjects
- *
BANACH spaces , *NONLINEAR equations , *ALGORITHMS , *NONLINEAR operators , *NONEXPANSIVE mappings , *CONSTRAINED optimization , *MATHEMATICAL equivalence - Abstract
We study a new algorithm for the common solutions of a generalized variational inequality system and the fixed points of an asymptotically non-expansive mapping in Banach spaces. Under some specific assumptions imposed on the control parameters, some strong convergence theorems for the sequence generated by our new viscosity iterative scheme to approximate their common solutions are proved. As an application of our main results, we solve the standard constrained convex optimization problem. The results here generalize and improve some other authors' recently corresponding results. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
66. When Will a Sequence of Points in a Riemannian Submanifold Converge?
- Author
-
Truong, Tuyen Trung
- Subjects
- *
RIEMANNIAN manifolds , *RANDOM dynamical systems , *DEEP learning , *METRIC spaces , *CONSTRAINED optimization , *EMBEDDING theorems - Abstract
Let X be a Riemannian manifold and x n a sequence of points in X. Assume that we know a priori some properties of the set A of cluster points of x n . The question is under what conditions that x n will converge. An answer to this question serves to understand the convergence behaviour for iterative algorithms for (constrained) optimisation problems, with many applications such as in Deep Learning. We will explore this question, and show by some examples that having X a submanifold (more generally, a metric subspace) of a good Riemannian manifold (even in infinite dimensions) can greatly help. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
67. A New Hybrid BA_ABC Algorithm for Global Optimization Problems.
- Author
-
Yildizdan, Gülnur and Baykan, Ömer Kaan
- Subjects
- *
GLOBAL optimization , *BEES algorithm , *MATHEMATICAL optimization , *ALGORITHMS , *CONSTRAINED optimization - Abstract
Bat Algorithm (BA) and Artificial Bee Colony Algorithm (ABC) are frequently used in solving global optimization problems. Many new algorithms in the literature are obtained by modifying these algorithms for both constrained and unconstrained optimization problems or using them in a hybrid manner with different algorithms. Although successful algorithms have been proposed, BA's performance declines in complex and large-scale problems are still an ongoing problem. The inadequate global search capability of the BA resulting from its algorithm structure is the major cause of this problem. In this study, firstly, inertia weight was added to the speed formula to improve the search capability of the BA. Then, a new algorithm that operates in a hybrid manner with the ABC algorithm, whose diversity and global search capability is stronger than the BA, was proposed. The performance of the proposed algorithm (BA_ABC) was examined in four different test groups, including classic benchmark functions, CEC2005 small-scale test functions, CEC2010 large-scale test functions, and classical engineering design problems. The BA_ABC results were compared with different algorithms in the literature and current versions of the BA for each test group. The results were interpreted with the help of statistical tests. Furthermore, the contribution of BA and ABC algorithms, which constitute the hybrid algorithm, to the solutions is examined. The proposed algorithm has been found to produce successful and acceptable results. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
68. Success History-Based Adaptive Differential Evolution Using Turning-Based Mutation.
- Author
-
Sun, Xingping, Jiang, Linsheng, Shen, Yong, Kang, Hongwei, and Chen, Qingyi
- Subjects
- *
DIFFERENTIAL evolution , *CLUSTER analysis (Statistics) , *CONSTRAINED optimization , *MATHEMATICAL optimization , *ALGORITHMS - Abstract
Single objective optimization algorithms are the foundation of establishing more complex methods, like constrained optimization, niching and multi-objective algorithms. Therefore, improvements to single objective optimization algorithms are important because they can impact other domains as well. This paper proposes a method using turning-based mutation that is aimed to solve the problem of premature convergence of algorithms based on SHADE (Success-History based Adaptive Differential Evolution) in high dimensional search space. The proposed method is tested on the Single Objective Bound Constrained Numerical Optimization (CEC2020) benchmark sets in 5, 10, 15, and 20 dimensions for all SHADE, L-SHADE, and jSO algorithms. The effectiveness of the method is verified by population diversity measure and population clustering analysis. In addition, the new versions (Tb-SHADE, TbL-SHADE and Tb-jSO) using the proposed turning-based mutation get apparently better optimization results than the original algorithms (SHADE, L-SHADE, and jSO) as well as the advanced DISH and the jDE100 algorithms in 10, 15, and 20 dimensional functions, but only have advantages compared with the advanced j2020 algorithm in 5 dimensional functions. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
69. Efficient Methods for Parameter Estimation of Ordinary and Partial Differential Equation Models of Viral Hepatitis Kinetics.
- Author
-
Churkin, Alexander, Lewkiewicz, Stephanie, Reinharz, Vladimir, Dahari, Harel, and Barash, Danny
- Subjects
- *
PARTIAL differential equations , *ORDINARY differential equations , *PARAMETER estimation , *VIRAL hepatitis , *MAGNITUDE (Mathematics) , *MULTISCALE modeling - Abstract
Parameter estimation in mathematical models that are based on differential equations is known to be of fundamental importance. For sophisticated models such as age-structured models that simulate biological agents, parameter estimation that addresses all cases of data points available presents a formidable challenge and efficiency considerations need to be employed in order for the method to become practical. In the case of age-structured models of viral hepatitis dynamics under antiviral treatment that deal with partial differential equations, a fully numerical parameter estimation method was developed that does not require an analytical approximation of the solution to the multiscale model equations, avoiding the necessity to derive the long-term approximation for each model. However, the method is considerably slow because of precision problems in estimating derivatives with respect to the parameters near their boundary values, making it almost impractical for general use. In order to overcome this limitation, two steps have been taken that significantly reduce the running time by orders of magnitude and thereby lead to a practical method. First, constrained optimization is used, letting the user add constraints relating to the boundary values of each parameter before the method is executed. Second, optimization is performed by derivative-free methods, eliminating the need to evaluate expensive numerical derivative approximations. The newly efficient methods that were developed as a result of the above approach are described for hepatitis C virus kinetic models during antiviral therapy. Illustrations are provided using a user-friendly simulator that incorporates the efficient methods for both the ordinary and partial differential equation models. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
70. Elephant Herding Optimization: Variants, Hybrids, and Applications.
- Author
-
Li, Juan, Lei, Hong, Alavi, Amir H., and Wang, Gai-Ge
- Subjects
- *
ELEPHANT behavior , *ELEPHANTS , *COMBINATORIAL optimization , *CONSTRAINED optimization , *BENCHMARK problems (Computer science) - Abstract
Elephant herding optimization (EHO) is a nature-inspired metaheuristic optimization algorithm based on the herding behavior of elephants. EHO uses a clan operator to update the distance of the elephants in each clan with respect to the position of a matriarch elephant. The superiority of the EHO method to several state-of-the-art metaheuristic algorithms has been demonstrated for many benchmark problems and in various application areas. A comprehensive review for the EHO-based algorithms and their applications are presented in this paper. Various aspects of the EHO variants for continuous optimization, combinatorial optimization, constrained optimization, and multi-objective optimization are reviewed. Future directions for research in the area of EHO are further discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
71. Necessary and Sufficient Second-Order Optimality Conditions on Hadamard Manifolds.
- Author
-
Ruiz-Garzón, Gabriel, Ruiz-Zapatero, Jaime, Osuna-Gómez, Rafaela, and Rufián-Lizana, Antonio
- Subjects
- *
MANIFOLDS (Mathematics) , *CONVEXITY spaces , *HIGGS bosons , *DIRECTIONAL derivatives , *CONSTRAINED optimization , *GEOMETRY - Abstract
This work is intended to lead a study of necessary and sufficient optimality conditions for scalar optimization problems on Hadamard manifolds. In the context of this geometry, we obtain and present new function types characterized by the property of having all their second-order stationary points be global minimums. In order to do so, we extend the concept convexity in Euclidean space to a more general notion of invexity on Hadamard manifolds. This is done employing notions of second-order directional derivatives, second-order pseudoinvexity functions, and the second-order Karush–Kuhn–Tucker-pseudoinvexity problem. Thus, we prove that every second-order stationary point is a global minimum if and only if the problem is either second-order pseudoinvex or second-order KKT-pseudoinvex depending on whether the problem regards unconstrained or constrained scalar optimization, respectively. This result has not been presented in the literature before. Finally, examples of these new characterizations are provided in the context of "Higgs Boson like" potentials, among others. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
72. Truss Sizing Optimization with a Diversity-Enhanced Cyclic Neighborhood Network Topology Particle Swarm Optimizer.
- Author
-
Kim, Tae-Hyoung and Byun, Jung-In
- Subjects
- *
TRUSSES , *PARTICLES , *TOPOLOGY - Abstract
This study presents a reliable particle swarm optimizer for sizing optimization of truss structures. This population-based stochastic optimization approach is based on the principle that each particle communicates its position and function value to a number of successively numbered neighboring particles via a fixed cyclic interaction structure. Therefore, such a neighborhood structure changes the movement pattern of the entire swarm, and allows each particle's movement not to be driven by one global best particle position, which enhances the diversification attitude. Further, by transforming the objective function, it is possible to steer the search towards feasible regions of design space. The efficiency of the proposed approach is demonstrated by solving four classical sizing optimization problems of truss structures. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
73. Least-Squares Solutions of Eighth-Order Boundary Value Problems Using the Theory of Functional Connections.
- Author
-
Johnston, Hunter, Leake, Carl, and Mortari, Daniele
- Subjects
- *
BOUNDARY value problems , *NONLINEAR differential equations , *DIFFERENTIAL equations , *ORTHOGONAL functions , *NONLINEAR equations , *ORDINARY differential equations , *CONSTRAINED optimization - Abstract
This paper shows how to obtain highly accurate solutions of eighth-order boundary-value problems of linear and nonlinear ordinary differential equations. The presented method is based on the Theory of Functional Connections, and is solved in two steps. First, the Theory of Functional Connections analytically embeds the differential equation constraints into a candidate function (called a constrained expression) containing a function that the user is free to choose. This expression always satisfies the constraints, no matter what the free function is. Second, the free-function is expanded as a linear combination of orthogonal basis functions with unknown coefficients. The constrained expression (and its derivatives) are then substituted into the eighth-order differential equation, transforming the problem into an unconstrained optimization problem where the coefficients in the linear combination of orthogonal basis functions are the optimization parameters. These parameters are then found by linear/nonlinear least-squares. The solution obtained from this method is a highly accurate analytical approximation of the true solution. Comparisons with alternative methods appearing in literature validate the proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
74. Inertial Method for Bilevel Variational Inequality Problems with Fixed Point and Minimizer Point Constraints.
- Author
-
Yimer, Seifu Endris, Kumam, Poom, Gebrie, Anteneh Getachew, and Wangkeeree, Rabian
- Subjects
- *
NONEXPANSIVE mappings , *CONSTRAINED optimization , *MATHEMATICAL equivalence , *POINT set theory - Abstract
In this paper, we introduce an iterative scheme with inertial effect using Mann iterative scheme and gradient-projection for solving the bilevel variational inequality problem over the intersection of the set of common fixed points of a finite number of nonexpansive mappings and the set of solution points of the constrained optimization problem. Under some mild conditions we obtain strong convergence of the proposed algorithm. Two examples of the proposed bilevel variational inequality problem are also shown through numerical results. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
75. On the Efficacy of Ensemble of Constraint Handling Techniques in Self-Adaptive Differential Evolution.
- Author
-
Javed, Hassan, Jan, Muhammad Asif, Tairan, Nasser, Mashwani, Wali Khan, Khanum, Rashida Adeeb, Sulaiman, Muhammad, Khan, Hidayat Ullah, and Shah, Habib
- Subjects
- *
EVOLUTIONARY algorithms , *DIFFERENTIAL evolution , *SELF-adaptive software , *MATHEMATICAL optimization , *SEARCH algorithms , *CONSTRAINED optimization , *ALGORITHMS - Abstract
Self-adaptive variants of evolutionary algorithms (EAs) tune their parameters on the go by learning from the search history. Adaptive differential evolution with optional external archive (JADE) and self-adaptive differential evolution (SaDE) are two well-known self-adaptive versions of differential evolution (DE). They are both unconstrained search and optimization algorithms. However, if some constraint handling techniques (CHTs) are incorporated in their frameworks, then they can be used to solve constrained optimization problems (COPs). In an early work, an ensemble of constraint handling techniques (ECHT) is probabilistically hybridized with the basic version of DE. The ECHT consists of four different CHTs: superiority of feasible solutions, self-adaptive penalty, ε -constraint handling technique and stochastic ranking. This paper employs ECHT in the selection schemes, where offspring competes with their parents for survival to the next generation, of JADE and SaDE. As a result, JADE-ECHT and SaDE-ECHT are developed, which are the constrained variants of JADE and SaDE. Both algorithms are tested on 24 COPs and the experimental results are collected and compared according to algorithms' evaluation criteria of CEC'06. Their comparison, in terms of feasibility rate (FR) and success rate (SR), shows that SaDE-ECHT surpasses JADE-ECHT in terms of FR, while JADE-ECHT outperforms SaDE-ECHT in terms of SR. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
76. Satisfying Bank Capital Requirements: A Robustness Approach in a Modified Roy Safety-First Framework.
- Author
-
Atta Mills, Ebenezer Fiifi Emire, Yu, Bo, and Zeng, Kailin
- Subjects
- *
BANK capital , *CAPITAL requirements , *CAPITAL , *CONSTRAINED optimization , *MARKET value , *CONVEX bodies - Abstract
This study considers an asset-liability optimization model based on constraint robustness with the chance constraint of capital to risk assets ratio in a safety-first framework under the condition that only moment information is known. This paper aims to extend the proposed single-objective capital to risk assets ratio chance constrained optimization model in the literature by considering the multi-objective constraint robustness approach in a modified safety-first framework. To solve the optimization model, we develop a deterministic convex counterpart of the capital to risk assets ratio robust probability constraint. In a consolidated risk measure of variance and safety-first framework, the proposed distributionally-robust capital to risk asset ratio chance-constrained optimization model guarantees banks will meet the capital requirements of Basel III with a likelihood of 95% irrespective of changes in the future market value of assets. Even under the worst-case scenario, i.e., when loans default, our proposed capital to risk asset ratio chance-constrained optimization model meets the minimum total requirements of Basel III. The practical implications of the findings of this study are that the model, when applied, will provide safety against extreme losses while maximizing returns and minimizing risk, which is prudent in this post-financial crisis regime. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
77. The General Least Square Deviation OWA Operator Problem.
- Author
-
Hong, Dug Hun and Han, Sangheon
- Subjects
- *
LEAST squares , *CONSTRAINED optimization , *FUZZY sets , *CONVEX functions , *INDUSTRIAL engineering , *DEVIATION (Statistics) , *FUZZY arithmetic - Abstract
A crucial issue in applying the ordered weighted averaging (OWA) operator for decision making is the determination of the associated weights. This paper proposes a general least convex deviation model for OWA operators which attempts to obtain the desired OWA weight vector under a given orness level to minimize the least convex deviation after monotone convex function transformation of absolute deviation. The model includes the least square deviation (LSD) OWA operators model suggested by Wang, Luo and Liu in Computers & Industrial Engineering, 2007, as a special class. We completely prove this constrained optimization problem analytically. Using this result, we also give solution of LSD model suggested by Wang, Luo and Liu as a function of n and α completely. We reconsider two numerical examples that Wang, Luo and Liu, 2007 and Sang and Liu, Fuzzy Sets and Systems, 2014, showed and consider another different type of the model to illustrate our results. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
78. SRIFA: Stochastic Ranking with Improved-Firefly-Algorithm for Constrained Optimization Engineering Design Problems.
- Author
-
Balande, Umesh and Shrimankar, Deepti
- Subjects
- *
PARTICLE swarm optimization , *CONSTRAINED optimization , *BIOLOGICALLY inspired computing , *ENGINEERING design , *EVOLUTIONARY algorithms , *METAHEURISTIC algorithms , *GLOBAL optimization - Abstract
Firefly-Algorithm (FA) is an eminent nature-inspired swarm-based technique for solving numerous real world global optimization problems. This paper presents an overview of the constraint handling techniques. It also includes a hybrid algorithm, namely the Stochastic Ranking with Improved Firefly Algorithm (SRIFA) for solving constrained real-world engineering optimization problems. The stochastic ranking approach is broadly used to maintain balance between penalty and fitness functions. FA is extensively used due to its faster convergence than other metaheuristic algorithms. The basic FA is modified by incorporating opposite-based learning and random-scale factor to improve the diversity and performance. Furthermore, SRIFA uses feasibility based rules to maintain balance between penalty and objective functions. SRIFA is experimented to optimize 24 CEC 2006 standard functions and five well-known engineering constrained-optimization design problems from the literature to evaluate and analyze the effectiveness of SRIFA. It can be seen that the overall computational results of SRIFA are better than those of the basic FA. Statistical outcomes of the SRIFA are significantly superior compared to the other evolutionary algorithms and engineering design problems in its performance, quality and efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
79. A New Descent Algorithm Using the Three-Step Discretization Method for Solving Unconstrained Optimization Problems.
- Author
-
Torabi, Mina and Hosseini, Mohammad-Mehdi
- Subjects
- *
ALGORITHMS , *DISCRETIZATION methods , *CONSTRAINED optimization , *PROBLEM solving , *INTELLIGENT agents , *GROUP theory - Abstract
In this paper, three-step Taylor expansion, which is equivalent to third-order Taylor expansion, is used as a mathematical base of the new descent method. At each iteration of this method, three steps are performed. Each step has a similar structure to the steepest descent method, except that the generalized search direction, step length, and next iterative point are applied. Compared with the steepest descent method, it is shown that the proposed algorithm has higher convergence speed and lower computational cost and storage. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.