Design and analysis of a faster King-Werner-type derivative free method

We introduce a new faster King-Werner-type derivative-free method for solving nonlinear equations. The local as well as semi-local convergence analysis is presented under weak center Lipschitz and Lipschitz conditions. The convergence order as well as the convergence radii are also provided. The radii are compared to the corresponding ones from similar methods. Numerical examples further validate the theoretical results.

Derivation of the Optimal Solution for the Economic Production Quantity Model with Planned Shortages without Derivatives

In this paper, we study a reformulation of the Economic Production Quantity (EPQ) problem. We study a more general version of the problem first and derive the conditions for an optimal solution, as well as the optimal solution itself, all without using derivatives. Then, we apply the approach to the reformulated EPQ problem. This version of the EPQ problem has been tackled by a number of researchers, wherein they have derived the conditions for the optimal solution and proposed algebraic derivations. However, their derivations for the conditions, as well as the optimal solution, have been shown to be questionable. Other than being questionable, the existing approaches are so complicated that they defeat the purpose of simplifying the optimization by using a derivative-free approach. We propose a correct and more succinct, much less complicated approach to derive the conditions and the optimal solution without using derivatives.

Some Real-Life Applications of a Newly Designed Algorithm for Nonlinear Equations and Its Dynamics via Computer Tools

In this article, we design a novel fourth-order and derivative free root-finding algorithm. We construct this algorithm by applying the finite difference scheme on the well-known Ostrowski’s method. The convergence analysis shows that the newly designed algorithm possesses fourth-order convergence. To demonstrate the applicability of the designed algorithm, we consider five real-life engineering problems in the form of nonlinear scalar functions and then solve them via computer tools. The numerical results show that the new algorithm outperforms the other fourth-order comparable algorithms in the literature in terms of performance, applicability, and efficiency. Finally, we present the dynamics of the designed algorithm via computer tools by examining certain complex polynomials that depict the convergence and other graphical features of the designed algorithm.

An Algorithm Derivative-Free to Improve the Steffensen-Type Methods

Solving equations of the form H(x)=0 is one of the most faced problem in mathematics and in other science fields such as chemistry or physics. This kind of equations cannot be solved without the use of iterative methods. The Steffensen-type methods, defined using divided differences are derivative free, are usually considered to solve these problems when H is a non-differentiable operator due to its accuracy and efficiency. However, in general, the accessibility of these iterative methods is small. The main interest of this paper is to improve the accessibility of Steffensen-type methods, this is the set of starting points that converge to the roots applying those methods. So, by means of using a predictor–corrector iterative process we can improve this accessibility. For this, we use a predictor iterative process, using symmetric divided differences, with good accessibility and then, as corrector method, we consider the Center-Steffensen method with quadratic convergence. In addition, the dynamical studies presented show, in an experimental way, that this iterative process also improves the region of accessibility of Steffensen-type methods. Moreover, we analyze the semilocal convergence of the predictor–corrector iterative process proposed in two cases: when H is differentiable and H is non-differentiable. Summing up, we present an effective alternative for Newton’s method to non-differentiable operators, where this method cannot be applied. The theoretical results are illustrated with numerical experiments.

Optimization, 3D-Numerical Validations and Preliminary Experimental Tests of a Wound Rotor Synchronous Machine

In this paper, a complete methodology to design a modular brushless wound rotor synchronous machine is proposed. From a schedule of conditions and a chosen structure (with 7 phases, 7 slots and 6 poles), a non-linear and non-convex optimization problem is defined and solved using NOMAD (a derivative free local optimization code): the external volume is minimized under some constraints, which are the average torque equal to 5 Nm, the torque ripple less than 5%, the efficiency greater than 94%, and the surface temperature less than 85 °C. The constraints have to be computed using 2D-finite element simulations in order to reduce the CPU-time consumption for each NOMAD iteration. Moreover, a relaxation of this optimization problem makes it possible to provide an efficient starting point for NOMAD. Thus, a good optimal design is obtained, and it is then validated by using 3D electromagnetic and thermic numerical methods. These numerical verifications show that, inside the end-winding, the leakage flux is high. This yields a lot of iron losses in this machine. Moreover, the surface and coil temperature differences between the 2D and 3D numerical approaches are discussed. Finally, the machine prototype is built following the optimal dimensions and a POKI-POKITM assembly technology. Preliminary experimental tests are carried out, and the results are devoted to the comparison of measured and predicted 3D numerical results.

An Efficient Bi-Objective Optimization Workflow Using the Distributed Quasi-Newton Method and Its Application to Well-Location Optimization

Summary Although it is possible to apply traditional optimization algorithms to determine the Pareto front of a multiobjective optimization problem, the computational cost is extremely high when the objective function evaluation requires solving a complex reservoir simulation problem and optimization cannot benefit from adjoint-based gradients. This paper proposes a novel workflow to solve bi-objective optimization problems using the distributed quasi-Newton (DQN) method, which is a well-parallelized and derivative-free optimization (DFO) method. Numerical tests confirm that the DQN method performs efficiently and robustly. The efficiency of the DQN optimizer stems from a distributed computing mechanism that effectively shares the available information discovered in prior iterations. Rather than performing multiple quasi-Newton optimization tasks in isolation, simulation results are shared among distinct DQN optimization tasks or threads. In this paper, the DQN method is applied to the optimization of a weighted average of two objectives, using different weighting factors for different optimization threads. In each iteration, the DQN optimizer generates an ensemble of search points (or simulation cases) in parallel, and a set of nondominated points is updated accordingly. Different DQN optimization threads, which use the same set of simulation results but different weighting factors in their objective functions, converge to different optima of the weighted average objective function. The nondominated points found in the last iteration form a set of Pareto-optimal solutions. Robustness as well as efficiency of the DQN optimizer originates from reliance on a large, shared set of intermediate search points. On the one hand, this set of searching points is (much) smaller than the combined sets needed if all optimizations with different weighting factors would be executed separately; on the other hand, the size of this set produces a high fault tolerance, which means even if some simulations fail at a given iteration, the DQN method’s distributed-parallelinformation-sharing protocol is designed and implemented such that the optimization process can still proceed to the next iteration. The proposed DQN optimization method is first validated on synthetic examples with analytical objective functions. Then, it is tested on well-location optimization (WLO) problems by maximizing the oil production and minimizing the water production. Furthermore, the proposed method is benchmarked against a bi-objective implementation of the mesh adaptive direct search (MADS) method, and the numerical results reinforce the auspicious computational attributes of DQN observed for the test problems. To the best of our knowledge, this is the first time that a well-parallelized and derivative-free DQN optimization method has been developed and tested on bi-objective optimization problems. The methodology proposed can help improve efficiency and robustness in solving complicated bi-objective optimization problems by taking advantage of model-based search algorithms with an effective information-sharing mechanism. NOTE: This paper is published as part of the 2021 SPE Reservoir Simulation Conference Special Issue.

A method with inertial extrapolation step for convex constrained monotone equations

In recent times, various algorithms have been incorporated with the inertial extrapolation step to speed up the convergence of the sequence generated by these algorithms. As far as we know, very few results exist regarding algorithms of the inertial derivative-free projection method for solving convex constrained monotone nonlinear equations. In this article, the convergence analysis of a derivative-free iterative algorithm (Liu and Feng in Numer. Algorithms 82(1):245–262, 2019) with an inertial extrapolation step for solving large scale convex constrained monotone nonlinear equations is studied. The proposed method generates a sufficient descent direction at each iteration. Under some mild assumptions, the global convergence of the sequence generated by the proposed method is established. Furthermore, some experimental results are presented to support the theoretical analysis of the proposed method.