Methods based on Gaussian stochastic process (GSP) models and expected improvement (EI) functions have been promising for box-constrained expensive optimization problems. These include robust design problems with environmental variables having set-type constraints. However, the methods that combine GSP and EI sub-optimizations suffer from the following problem, which limits their computational performance. Efficient global optimization (EGO) methods often repeat the same or nearly the same experimental points. We present a novel EGO-type constraint-handling method that maintains a so-called tabu list to avoid past points. Our method includes two types of penalties for the key “infill” optimization, which selects the next test runs. We benchmark our tabu EGO algorithm with five alternative approaches, including DIRECT methods using nine test problems and two engineering examples. The engineering examples are based on additive manufacturing process parameter optimization informed using point-based thermal simulations and robust-type quality constraints. Our test problems span unconstrained, simply constrained, and robust constrained problems. The comparative results imply that tabu EGO offers very promising computational performance for all types of black-box optimization in terms of convergence speed and the quality of the final solution.
We present a deterministic global optimization method for nonlinear programming formulations constrained by stiff systems of ordinary differential equation (ODE) initial value problems (IVPs). The examples arise from dynamic optimization problems exhibiting both fast and slow transient phenomena commonly encountered in model‐based systems engineering applications. The proposed approach utilizes unconditionally stable implicit integration methods to reformulate the ODE‐constrained problem into a nonconvex nonlinear program (NLP) with implicit functions embedded. This problem is then solved to global optimality in finite time using a spatial branch‐and‐bound framework utilizing convex/concave relaxations of implicit functions constructed by a method which fully exploits problem sparsity. The algorithms were implemented in the Julia programming language within the EAGO.jl package and demonstrated on five illustrative examples with varying complexity relevant in process systems engineering. The developed methods enable the guaranteed global solution of dynamic optimization problems with stiff ODE–IVPs embedded.
more » « less- PAR ID:
- 10372713
- Publisher / Repository:
- Wiley Blackwell (John Wiley & Sons)
- Date Published:
- Journal Name:
- AIChE Journal
- Volume:
- 65
- Issue:
- 12
- ISSN:
- 0001-1541
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
more » « less
Abstract -
more » « less
We introduce a general differentiable solver for time-dependent deformation problems with contact and friction. Our approach uses a finite element discretization with a high-order time integrator coupled with the recently proposed incremental potential contact method for handling contact and friction forces to solve ODE- and PDE-constrained optimization problems on scenes with complex geometry. It supports static and dynamic problems and differentiation with respect to all physical parameters involved in the physical problem description, which include shape, material parameters, friction parameters, and initial conditions. Our analytically derived adjoint formulation is efficient, with a small overhead (typically less than 10% for nonlinear problems) over the forward simulation, and shares many similarities with the forward problem, allowing the reuse of large parts of existing forward simulator code.
We implement our approach on top of the open-source PolyFEM library and demonstrate the applicability of our solver to shape design, initial condition optimization, and material estimation on both simulated results and physical validations.
-
more » « less
Abstract This article presents an approach for the topology optimization of frame structures composed of nonlinear Timoshenko beam finite elements (FEs) under time‐varying excitation. Material nonlinearity is considered with a nonlinear Timoshenko beam FE model that accounts for distributed plasticity and axial–shear–moment interactions through appropriate hysteretic interpolation functions and a yield/capacity function, respectively. Hysteretic variables for curvature, shear, and axial deformations represent the nonlinearities and evolve according to first‐order nonlinear ordinary differential equations (ODEs). Owing to the first‐order representation, the governing dynamic equilibrium equations, and hysteretic evolution equations can thus be concisely presented as a combined system of first‐order nonlinear ODEs that can be solved using a general ODE solver. This avoids divergence due to an ill‐conditioned stiffness matrix that can commonly occur with Newmark–Newton solution schemes that rely upon linearization. The approach is illustrated for a volume minimization design problem, subject to dynamic excitation where an approximation for the maximum displacement at specified nodes is constrained to a given limit, that is, a drift ratio. The maximum displacement is approximated using the p‐norm, thus facilitating the derivation of the analytical sensitivities for gradient‐based optimization. The proposed approach is demonstrated through several numerical examples for the design of structural frames subjected to sinusoidal base excitation.
-
null (Ed.)A method is developed for transforming chance constrained optimization problems to a form numerically solvable. The transformation is accomplished by reformulating the chance constraints as nonlinear constraints using a method that combines the previously developed Split-Bernstein approximation and kernel density estimator (KDE) methods. The Split-Bernstein approximation in a particular form is a biased kernel density estimator. The bias of this kernel leads to a nonlinear approximation that does not violate the bounds of the original chance constraint. The method of applying biased KDEs to reformulate chance constraints as nonlinear constraints transforms the chance constrained optimization problem to a deterministic optimization problems that retains key properties of the chance constrained optimization problem and can be solved numerically. This method can be applied to chance constrained optimal control problems. As a result, the Split-Bernstein and Gaussian kernels are applied to a chance constrained optimal control problem and the results are compared.more » « less
-
Recently, a broad class of linear delayed and ODE-PDEs systems was shown to have an equivalent representation using Partial Integral Equations (PIEs). In this paper, we use this PIE representation, combined with algorithms for convex optimization of Partial Integral (PI) operators to bound the H2-norm for input-output systems of this class. Specifically, the methods proposed here apply to delayed and ODE-PDE systems (including delayed PDE systems) in one or two spatial variables where the disturbance does not enter through the boundary. For such systems, we define a notion of H2-norm using an initial state-to-output framework and show that this notion reduces to more traditional concepts under the assumption of existence of a strongly continuous semigroup. Next, we consider input-output systems for which there exists a PIE representation and for such systems show that computing a minimal upper bound on the H2-norm of delayed and PDE systems can be equivalently formulated as a convex optimization problem subject to linear PI operator inequalities (LPIs). We convert, then, these optimization problems to Semi-Definite Programming (SDP) problems using the PIETOOLS toolbox. Finally, we apply the results to several numerical examples – focusing on time-delay systems (TDS) for which comparable H2 approximation results are available in the literature. The numerical results demonstrate the accuracy of the computed upper bound on the H2-norm.more » « less
