Solving Large-Scale Inverse Problems in Elasticity Using Sequential Quadratic Programming (SQP).
Abstract not provided.
SEARCH · Engineering Papers
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Abstract not provided.
No abstract prepared.
In this study, we consider solving nonlinear optimization problems with a stochastic objective and deterministic equality constraints. We assume for the objective that its evaluation, gradient, and Hessian are inaccessible, while one can compute their stochastic estimates by, for example, subsampling. We propose a stochastic algorithm based on sequential quadratic programming (SQP) that uses a differentiable exact augmented Lagrangian as the merit function. To motivate our algorithm design, we first revisit and simplify an old SQP method Lucidi developed for solving deterministic problems, which serves as the skeleton of our stochastic algorithm. Based on the simplified deterministic algorithm, we then propose a non-adaptive SQP for dealing with stochastic objective, where the gradient and Hessian are replaced by stochastic estimates but the stepsizes are deterministic and prespecified. Finally, we incorporate a recent stochastic line search procedure Paquette and Scheinberg into the non-adaptive stochastic SQP to adaptively select the random stepsizes, which leads to an adaptive stochastic SQP. The global "almost sure" convergence for both non-adaptive and adaptive SQP methods is established. Numerical experiments on nonlinear problems in CUTEst test set demonstrate the superiority of the adaptive algorithm.
Abstract The conventional method to prepare bulk‐heterojunction organic photovoltaics (OPVs) is a one‐step method from the blend solution of donor and acceptor materials, known as blend‐casting (BC). Recently, an alternative method was demonstrated to achieve high efficiencies (13%) comparable to state‐of‐the‐art BC devices. This two‐step‐coating method, known as “sequential processing,” (SqP) involves sequential deposition of the donor and then the acceptor from two orthogonal solvents. However, the requirement of orthogonal solvents to process the donor and acceptor constrains the choice of materials and processing solvents. In this paper, an improved version of SqP method without the need for using orthogonal solvents is reported. The success is based on donor polymers with strong temperature‐dependent aggregation properties whose solution can be processed at a high temperature, but the resulting film becomes completely insoluble at room temperature, which allows for the processing of overlying acceptors from a wide range of nonorthogonal solvents. With this approach, efficient SqP OPVs is demonstrated based on a range of donor/acceptor materials and processing solvents, and, in every single case, SqP OPVs can outperform their BC counterparts. The results broaden the solvent choices and open a much larger window to optimize the processing parameters of SqP method.
Abstract The properties of molecularly doped films of conjugated polymers are explored as the crystallinity of the polymer is systematically varied. Solution sequential processing (SqP) was used to introduce 2,3,5,6‐tetrafluoro‐7,7,8,8‐tetracyanoquinodimethane (F 4 TCNQ) into poly(3‐hexylthiophene‐2,5‐diyl) (P3HT) while preserving the pristine polymer's degree of crystallinity. X‐ray data suggest that F 4 TCNQ anions reside primarily in the amorphous regions of the film as well as in the P3HT lamellae between the side chains, but do not π‐stack within the polymer crystallites. Optical spectroscopy shows that the polaron absorption redshifts with increasing polymer crystallinity and increases in cross section. Theoretical modeling suggests that the polaron spectrum is inhomogeneously broadened by the presence of the anions, which reside on average 6–8 Å from the polymer backbone. Electrical measurements show that the conductivity of P3HT films doped by F 4 TCNQ via SqP can be improved by increasing the polymer crystallinity. AC magnetic field Hall measurements show that the increased conductivity results from improved mobility of the carriers with increasing crystallinity, reaching over 0.1 cm 2 V −1 s −1 in the most crystalline P3HT samples. Temperature‐dependent conductivity measurements show that polaron mobility in SqP‐doped P3HT is still dominated by hopping transport, but that more crystalline samples are on the edge of a transition to diffusive transport at room temperature.
Design rules are presented for significantly expanding sequential processing (SqP) into previously inaccessible polymer:fullerene systems by tailoring binary solvent blends for fullerene deposition. Starting with a base solvent that has high fullerene solubility, 2-chlorophenol (2-CP), ellipsometry-based swelling experiments are used to investigate different co-solvents for the fullerene-casting solution. By tuning the Flory-Huggins χ parameter of the 2-CP/co-solvent blend, it is possible to optimally swell the polymer of interest for fullerene interdiffusion without dissolution of the polymer underlayer. In this way solar cell power conversion efficiencies are obtained for the PTB7 (poly[(4,8-bis[(2-ethylhexyl)oxy]benzo[1,2-b:4,5-b']dithiophene-2,6-diyl)(3-fluoro-2-[(2-ethylhexyl)carbonyl]thieno[3,4-b]thiophenediyl)]) and PC61BM (phenyl-C61-butyric acid methyl ester) materials combination that match those of blend-cast films. Both semicrystalline (e.g., P3HT (poly(3-hexylthiophene-2,5-diyl)) and entirely amorphous (e.g., PSDTTT (poly[(4,8-di(2-butyloxy)benzo[1,2-b:4,5-b']dithiophene-2,6-diyl)-alt-(2,5-bis(4,4'-bis(2-octyl)dithieno[3,2-b:2'3'-d]silole-2,6-diyl)thiazolo[5,4-d]thiazole)]) conjugated polymers can be processed into highly efficient photovoltaic devices using the solvent-blend SqP design rules. Grazing-incidence wide-angle x-ray diffraction experiments confirm that proper choice of the fullerene casting co-solvent yields well-ordered interdispersed bulk heterojunction (BHJ) morphologies without the need for subsequent thermal annealing or the use of trace solvent additives (e.g., diiodooctane). The results open SqP to polymer/fullerene systems that are currently incompatible with traditional methods of device fabrication, and make BHJ morphology control a more tractable problem.
Explore the source record for details and available documents.
Here, this paper integrates nonlinear-manifold reduced order models (NM-ROMs) with domain decomposition (DD). NM ROMs approximate the full order model (FOM) state in a nonlinear-manifold by training a shallow, sparse autoencoder using FOM snapshot data. These NM-ROMs can be advantageous over linear-subspace ROMs (LS-ROMs) for problems with slowly decaying Kolmogorov n-width. However, the number of NM-ROM parameters that need to be trained scales with the size of the FOM. Moreover, for “extreme-scale” problems, the storage of high-dimensional FOM snapshots alone can make ROM training expensive. To alleviate the training cost, this paper applies DD to the FOM, computes NM-ROMs on each subdomain, and couples them to obtain a global NM-ROM. This approach has several advantages: Subdomain NM-ROMs can be trained in parallel, involve fewer parameters to be trained than global NM-ROMs, require smaller subdomain FOM dimensional training data, and can be tailored to subdomain specific features of the FOM. The shallow, sparse architecture of the autoencoder used in each subdomain NM-ROM allows application of hyper-reduction (HR), reducing the complexity caused by nonlinearity and yielding computational speedup of the NM-ROM. This paper provides the first application of NM-ROM (with HR) to a DD problem. In particular, this paper details an algebraic DD reformulation of the FOM, training a NM-ROM with HR for each sub domain, and a sequential quadratic programming (SQP) solver to evaluate the coupled global NM-ROM. Theoretical convergence results for the SQP method and a priori and a posteriori error estimates for the DD NM-ROM with HR are provided. The proposed DD NM-ROM with HR approach is numerically compared to a DD LS-ROM with HR on the 2D steady-state Burgers’ equation, showing an order of magnitude improvement in accuracy of the proposed DD NM-ROM over the DD LS-ROM.