A Sequential-Quadratic-Programming-Filter Algorithm with a Modified Stochastic Gradient for Robust Life-Cycle Optimization Problems with Nonlinear State Constraints

SPE Journal ◽  
2020 ◽  
Vol 25 (04) ◽  
pp. 1938-1963 ◽  
Author(s):  
Zhe Liu ◽  
Albert C. Reynolds

Summary Solving a large-scale optimization problem with nonlinear state constraints is challenging when adjoint gradients are not available for computing the derivatives needed in the basic optimization algorithm used. Here, we present a methodology for the solution of an optimization problem with nonlinear and linear constraints, where the true gradients that cannot be computed analytically are approximated by ensemble-based stochastic gradients using an improved stochastic simplex approximate gradient (StoSAG). Our discussion is focused on the application of our procedure to waterflooding optimization where the optimization variables are the well controls and the cost function is the life-cycle net present value (NPV) of production. The optimization algorithm used for solving the constrained-optimization problem is sequential quadratic programming (SQP) with constraints enforced using the filter method. We introduce modifications to StoSAG that improve its fidelity [i.e., the improvements give a more accurate approximation to the true gradient (assumed here to equal the gradient computed with the adjoint method) than the approximation obtained using the original StoSAG algorithm]. The modifications to StoSAG vastly improve the performance of the optimization algorithm; in fact, we show that if the basic StoSAG is applied without the improvements, then the SQP might yield a highly suboptimal result for optimization problems with nonlinear state constraints. For robust optimization, each constraint should be satisfied for every reservoir model, which is highly computationally intensive. However, the computationally viable alternative of letting the reservoir simulation enforce the nonlinear state constraints using its internal heuristics yields significantly inferior results. Thus, we develop an alternative procedure for handling nonlinear state constraints, which avoids explicit enforcement of nonlinear constraints for each reservoir model yet yields results where any constraint violation for any model is extremely small.

2015 ◽  
Vol 1113 ◽  
pp. 370-375 ◽  
Author(s):  
Nur Amirah Mohd Ali ◽  
Norashid Aziz

In this work, two types of optimization problems which are crucially related to batch reactor operation are considered. First problem is to maximize the conversion and second problem is to minimize the batch time. Both problems are solved using sequential quadratic programming (SQP) available in Aspen Plus. The manipulated variables i.e. reactor temperature and amount of palm oil are optimized simultaneously based on the specified objective function and equality constraint. Effect of intervals for both optimization problems are also evaluated in this paper. The results show that in maximizing conversion, the number of intervals did not significantly affect the amount of conversion. Meanwhile in minimizing batch time, the introduction of intervals was positively reduced the reactor temperature but negatively minimize the batch time.


2012 ◽  
Vol 195-196 ◽  
pp. 52-55
Author(s):  
Jian Hua Wang ◽  
Yun De Shen ◽  
Dong Ji Xuan ◽  
Tai Hong Cheng ◽  
Zhen Zhe Li

Not only the price of a steam cleaner but also the performance of it should be considered to improve the competitive power of the products. In this study, a steam duct was optimized by changing the length of guide line for compensating the drawback of the unbalanced mass flow rate of steam from each outlet. For evaluating the mass flow rate of each outlet, a commercial CFD(computational fluid dynamics) code was used. In the process of the optimization, SQP(sequential quadratic programming) optimization algorithm was applied. The numerical method in this study can be widely used to develop a high performance domestic steam cleaner.


2012 ◽  
Vol 134 (10) ◽  
Author(s):  
Jianhua Zhou ◽  
Shuo Cheng ◽  
Mian Li

Uncertainty plays a critical role in engineering design as even a small amount of uncertainty could make an optimal design solution infeasible. The goal of robust optimization is to find a solution that is both optimal and insensitive to uncertainty that may exist in parameters and design variables. In this paper, a novel approach, sequential quadratic programming for robust optimization (SQP-RO), is proposed to solve single-objective continuous nonlinear optimization problems with interval uncertainty in parameters and design variables. This new SQP-RO is developed based on a classic SQP procedure with additional calculations for constraints on objective robustness, feasibility robustness, or both. The obtained solution is locally optimal and robust. Eight numerical and engineering examples with different levels of complexity are utilized to demonstrate the applicability and efficiency of the proposed SQP-RO with the comparison to its deterministic SQP counterpart and RO approaches using genetic algorithms. The objective and/or feasibility robustness are verified via Monte Carlo simulations.


Acta Numerica ◽  
1995 ◽  
Vol 4 ◽  
pp. 1-51 ◽  
Author(s):  
Paul T. Boggs ◽  
Jon W. Tolle

Since its popularization in the late 1970s, Sequential Quadratic Programming (SQP) has arguably become the most successful method for solving nonlinearly constrained optimization problems. As with most optimization methods, SQP is not a single algorithm, but rather a conceptual method from which numerous specific algorithms have evolved. Backed by a solid theoretical and computational foundation, both commercial and public-domain SQP algorithms have been developed and used to solve a remarkably large set of important practical problems. Recently large-scale versions have been devised and tested with promising results.


2021 ◽  
Author(s):  
Sayed Abdullah Sadat ◽  
mostafa Sahraei-Ardakani

After decades of research, efficient computation of AC Optimal Power Flow (ACOPF) still remains a challenge. ACOPF is a nonlinear nonconvex problem, and operators would need to solve ACOPF for large networks in almost real-time. Sequential Quadratic Programming (SQP) is one of the powerful second-order methods for solving large-scale nonlinear optimization problems and is a suitable approach for solving ACOPF with large-scale real-world transmission networks. However, SQP, in its general form, is still unable to solve large-scale problems within industry time limits. This paper presents a customized Sequential Quadratic Programming (CSQP) algorithm, taking advantage of physical properties of the ACOPF problem and the choice of the best performing ACOPF formulation. The numerical experiments suggest that CSQP outperforms commercial and noncommercial nonlinear solvers and solves test cases within the industry time limits. A wide range of test cases, ranging from 500-bus systems to 30,000-bus systems, are used to verify the test results.


2021 ◽  
Author(s):  
Sayed Abdullah Sadat ◽  
mostafa Sahraei-Ardakani

After decades of research, efficient computation of AC Optimal Power Flow (ACOPF) still remains a challenge. ACOPF is a nonlinear nonconvex problem, and operators would need to solve ACOPF for large networks in almost real-time. Sequential Quadratic Programming (SQP) is one of the powerful second-order methods for solving large-scale nonlinear optimization problems and is a suitable approach for solving ACOPF with large-scale real-world transmission networks. However, SQP, in its general form, is still unable to solve large-scale problems within industry time limits. This paper presents a customized Sequential Quadratic Programming (CSQP) algorithm, taking advantage of physical properties of the ACOPF problem and the choice of the best performing ACOPF formulation. The numerical experiments suggest that CSQP outperforms commercial and noncommercial nonlinear solvers and solves test cases within the industry time limits. A wide range of test cases, ranging from 500-bus systems to 30,000-bus systems, are used to verify the test results.


2018 ◽  
Vol 28 ◽  
pp. 18-32
Author(s):  
Hugo Miguel Silva ◽  
José Filipe Bizarro de Meireles

In this work, novel types of internally reinforced hollow-box beams were structurally optimized using a Finite Element Updating code built in MATLAB. In total, 24 different beams were optimized under bending loads. A new objective function was defined in order to consider the balance between mass and deflection on relevant nodal points. New formulae were developed in order to assess the efficiency of the code and of the structures. The efficiency of the code is determined by comparing the Finite Element results of the optimized solutions using ANSYS with the initial solutions. It was concluded that the optimization algorithm, built in Sequential Quadratic Programming (SQP) allowed to improve the effective mechanical behavior under bending in 8500%.Therefore, the developed algorithm is effective in optimizing the novel FEM models under the studied conditions.


Author(s):  
Renjing Gao ◽  
Yi Tang ◽  
Qi Wang ◽  
Shutian Liu

Abstract This paper presents a gradient-based optimization method for interference suppression of linear arrays by controlling the electrical parameters of each array element, including the amplitude-only and phase-only. Gradient-based optimization algorithm (GOA), as an efficient optimization algorithm, is applied to the optimization problem of the anti-interference arrays that is generally solved by the evolutionary algorithms. The goal of this method is to maximize the main beam gain while minimizing the peak sidelobe level (PSLL) together with the null constraint. To control the nulls precisely and synthesize the radiation pattern accurately, the full-wave method of moments is used to consider the mutual coupling among the array elements rigorously. The searching efficiency is improved greatly because the gradient (sensitivity) information is used in the algorithm for solving the optimization problem. The sensitivities of the design objective and the constraint function with respect to the design variables are analytically derived and the optimization problems are solved by using GOA. The results of the GOA can produce the desired null at the specific positions, minimize the PSLL, and greatly shorten the computation time compared with the often-used non-gradient method such as genetic algorithm and cuckoo search algorithm.


Sign in / Sign up

Export Citation Format

Share Document