Various optimization problems in engineering and management are formulated as nonlinear programming problems. Because of the nonconvexity nature of this kind of problems, no efficient approach is available to derive the global optimum of the problems. How to locate a global optimal solution of a nonlinear programming problem is an important issue in optimization theory. In the last few decades, piecewise linearization methods have been widely applied to convert a nonlinear programming problem into a linear programming problem or a mixed-integer convex programming problem for obtaining an approximated global optimal solution. In the transformation process, extra binary variables, continuous variables, and constraints are introduced to reformulate the original problem. These extra variables and constraints mainly determine the solution efficiency of the converted problem. This study therefore provides a review of piecewise linearization methods and analyzes the computational efficiency of various piecewise linearization methods.
Systems with hidden attractors have been the hot research topic of recent years because of their striking features. Fractional-order systems with hidden attractors are newly introduced and barely investigated. In this paper, a new 4D fractional-order chaotic system with hidden attractors is proposed. The abundant and complex hidden dynamical behaviors are studied by nonlinear theory, numerical simulation, and circuit realization. As the main mode of electrical behavior in many neuroendocrine cells, bursting oscillations (BOs) exist in this system. This complicated phenomenon is seldom found in the chaotic systems, especially in the fractional-order chaotic systems without equilibrium points. With the view of practical application, the spectral entropy (SE) algorithm is chosen to estimate the complexity of this fractional-order system for selecting more appropriate parameters. Interestingly, there is a state variable correlated with offset boosting that can adjust the amplitude of the variable conveniently. In addition, the circuit of this fractional-order chaotic system is designed and verified by analog as well as hardware circuit. All the results are very consistent with those of numerical simulation.
The mathematical model for optimal design of a speed reducer is a generalized geometric programming problem that is non-convex and not easy be globally solved. This paper applies a deterministic approach including convexification strategies and piecewise linearization techniques to globally solve speed reducer design problems. A practical speed reducer design problem is solved to demonstrate that this study obtains a better solution than other methods.
In this study, a control algorithm is proposed to enhance the braking performance for an Autonomous Emergency Braking (AEB) system by improving the method for calculating the brake-application time when the vehicle is on an incline. The conventional AEB system in an algorithm-applied vehicle is limited because the gradient is not considered. With such systems, only a flat road environment is considered in terms of the road settings. To improve the braking performance on an incline, an AEB algorithm considering the road gradient is developed. A new calculation method for the brakeapplication time is proposed on the basis of the maximum deceleration that a vehicle can obtain on a road, and this is done by analyzing the force exerted on a vehicle that is on anincline. We confirmed that the AEB algorithm proposed in this paper improves the braking performance compared to the conventional AEB algorithm.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.