SEARCH · Engineering Papers
Results for “SQP”
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.
A unified funnel restoration SQP algorithm
We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of basic algorithmic ingredients that unifies a broad range of nonlinear optimization solvers. This framework has been implemented in the open-source solver Uno, a Swiss Army knife-like C++ optimization framework that unifies many nonlinearly constrained nonconvex optimization solvers. We illustrate the framework with a sequential quadratic programming (SQP) algorithm that maintains an acceptable upper bound on the constraint violation, called a funnel, that is monotonically decreased to control the feasibility of the iterates. Infeasible quadratic subproblems are handled by a feasibility restoration strategy. Globalization is controlled by a line search or a trust-region method. We prove global convergence of the trust-region funnel SQP method, building on known results from filter methods. We implement the algorithm in Uno, and we provide extensive test results for the trust-region line-search funnel SQP on small CUTEst instances.
Numerical study of a matrix-free trust-region SQP method for equality constrained optimization
This is a companion publication to the paper 'A Matrix-Free Trust-Region SQP Algorithm for Equality Constrained Optimization' in which we develop and analyze a trust-region sequential quadratic programming (SQP) method that supports the matrix-free (iterative, in-exact) solution of linear systems. In this report, we document the numerical behavior of the algorithm applied to a variety of equality constrained optimization problems, with constraints given by partial differential equations (PDEs).
A Tchebycheff-based multi-objective combined with a PSO–SQP dynamic real-time optimization framework for cycling energy systems
The aim in this work is to develop an optimization framework to address cycling of baseload energy systems due to the penetration of renewables into the grid. The developed strategy corresponds to a multi-objective and dynamic real-time optimization (MOO-DRTO) framework applied to a postcombustion MEA-based CO 2 capture process from a baseload coal-fired power plant under cycling conditions. A Tchebycheff-based method is used for the multi-objective optimization (MOO) component. Also, a hybrid approach consisting of Particle Swarm Optimization (PSO) and Sequential Quadratic Programming (SQP) is implemented for the first time in process systems engineering to solve the dynamic real-time optimization (DRTO) component. The objectives considered in the MOO-DRTO framework are economic and environmental. The proposed MOO-DRTO strategy is successfully implemented and 24-h optimal output trajectories for the carbon capture system under cycling are generated. Also, the optimal compromise is chosen from the Pareto front according to a set of selected weights for the objectives with minimal interaction between the framework and decision maker. The results indicated that the developed framework has potential to be extended to plant-wide optimization applications under cycling.
ALESQP: An Augmented Lagrangian Equality-Constrained SQP Method for Optimization with General Constraints
Here we present a new algorithm for infinite-dimensional optimization with general constraints, called ALESQP. In short, ALESQP is an augmented Lagrangian method that penalizes inequality constraints and solves equality-constrained nonlinear optimization subproblems at every iteration. The subproblems are solved using a matrix-free trust-region sequential quadratic programming (SQP) method that takes advantage of iterative, i.e., inexact linear solvers, and is suitable for large-scale applications. A key feature of ALESQP is a constraint decomposition strategy that allows it to exploit problem-specific variable scalings and inner products. We analyze convergence of ALESQP under different assumptions. We show that strong accumulation points are stationary. Consequently, in finite dimensions ALESQP converges to a stationary point. In infinite dimensions we establish that weak accumulation points are feasible in many practical situations. Under additional assumptions we show that weak accumulation points are stationary. We present several infinite-dimensional examples where ALESQP shows remarkable discretization-independent performance in all of its iterative components, requiring a modest number of iterations to meet constraint tolerances at the level of machine precision. Also, we demonstrate a fully matrix-free solution of an infinite-dimensional problem with nonlinear inequality constraints.
SQP Optimization of a Planar Parallel Mechanism: Maximization of Effective Working Zone
For the example of a planar 3-RRR mechanism of parallel structure, geometric optimization of the mechanism by the SQP method so as to maximize the theoretical and effective working zone is considered, in the case where passage through singular positions is possible.
International Training Course on Implementing State Systems of Accounting for and Control (SSAC) of Nuclear Material for States with Small Quantity Protocols (SQP): Course Overview and Objectives [Slides]
This course is hosted by Los Alamos National Laboratory on behalf of the U.S. National Nuclear Security Administration (NNSA) in collaboration with the IAEA to support Member States in managing small quantities of nuclear and radioactive materials in a manner that is compliant with their international obligations.
An Augmented Lagrangian Equality-constrained SQP (ALESQP) Method for Function-space Optimization with General Constraints.
Abstract not provided.
Efficient Handling of Inequality Constraints in a Matrix-Free Trust-Region SQP Algorithm.
Abstract Not Provided
Preconditioning of Matrix-Free Full-Space Trust-Region SQP Algorithms for Nonlinear PDE Optimization.
Abstract Not Provided
Solving Large-Scale Inverse Problems in Elasticity Using Sequential Quadratic Programming (SQP).
Abstract Not Provided
Solving Large-Scale Inverse Problems in Elasticity Using Sequential Quadratic Programming (SQP).
Abstract not provided.
A matrix-free trust-region SQP method for equality constrained optimization.
Abstract not provided.
Solving massive-scale inverse problems using matrix-fre dequential quadratic programming (SQP) methods.
Abstract not provided.
A Sequential Quadratic Programming (SQP) Algorithm and the Modied Error in Constitutive Equation (MECE) Principle for Parameter Estimation.
Abstract not provided.
Prioritizing Safeguards Implementation in Small Quantities Protocol (SQP) States
Explore the source record for details and available documents.
Inexact parallel-in-time solvers and SQP methods for PDE-constrained optimization.
Abstract not provided.