Search NASA⌕ Search

SEARCH · Search NASA

Results for “interior-point method”

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.

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

A Scalable Interior‐Point Gauss–Newton Method for PDE‐Constrained Optimization With Bound Constraints

Here, we present a scalable approach to solve a class of partial differential equation (PDE)‐constrained optimization problems with bound constraints. This approach utilizes a robust full‐space interior‐point (IP)‐Gauss–Newton optimization method. To cope with the poorly‐conditioned IP‐Gauss–Newton saddle‐point linear systems that need to be solved approximately, once per optimization step, we propose two spectrally related preconditioners. These preconditioners leverage the limited informativeness of data in regularized PDE‐constrained optimization problems. A block Gauss–Seidel preconditioner is proposed for the GMRES‐based solution of the IP‐Gauss–Newton linear systems. It is shown, for a large‐class of PDE‐ and bound‐constrained optimization problems, that the spectrum of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix is asymptotically independent of discretization and is not impacted by the ill‐conditioning that notoriously plagues interior‐point methods. We exploit symmetry of the IP‐Gauss–Newton linear systems and propose a regularization and log‐barrier Hessian preconditioner for the preconditioned conjugate gradient (PCG)‐based solution of the equivalent IP‐Gauss–Newton–Schur complement linear systems. The eigenvalues of the block Gauss–Seidel preconditioned IP‐Gauss–Newton matrix, that are not equal to one, are identical to the eigenvalues of the regularization and log‐barrier Hessian preconditioned Schur complement matrix. The scalability of the approach is demonstrated on two example problems. The numerical solution of these optimization problems is shown to require a discretization independent number of IP‐Gauss–Newton linear solves. Furthermore, the linear systems are solved in a discretization and IP ill‐conditioning independent number of preconditioned Krylov subspace iterations. The parallel scalability of the preconditioner, achieved via algebraic multigrid component solvers when applicable, and the aforementioned algorithmic scalability permits a parallel scalable means to compute solutions of a large class of PDE‐ and bound‐constrained problems.

PDE-constrained optimization↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

Spacecraft Modeling, Attitude Determination, and Control: Quaternion-Based Approach

Spacecraft attitude determination and control is an important part of a spacecraft to achieve its designed mission. As of today, many spacecrafts have been successfully launched, and most of them have performed well as they were designed. Many research papers have been published to address the attitude determination and control design problems. Several text books are available for students to learn the technology and for engineers to use as references. The most popular spacecraft models for attitude determination algorithms and control design methods are the Euler angle models and the quaternion models . The Euler angle models have been proved very efficient as the linearized models are controllable, and all standard linear control system design methods are directly applicable. The drawbacks related to the Euler angle methods are (a) the designs based on linearized models may not globally stabilize the original nonlinear spacecraft, i.e., the design may not work when the attitude of the spacecraft is far away from the point where the linearization is performed; (b) the models depend on the rotational sequences, this can be error prone if several teams work on the same project and they use different rotational sequences; (c) for any rotational sequence, there is a singular point where the model is not applicable; and (d) since most attitude determination methods use quaternion to represent the spacecraft attitude, there is a need to transform quaternion into Euler angles. On the other hand, for quaternion models, people have found controllers that can globally stabilize nonlinear spacecraft systems; the models do not depend on rotational sequences and they have no singular point; and the quaternion is provided by attitude determination system and ready to use. The main problem with the quaternion model based control system design is that the linearized quaternion model is not controllable. Therefore, most published design methods heavily rely on Lyapunov functions for the nonlinear spacecraft system. But there is no systematic way to obtain a desired Lyapunov functions. Moreover, the Lyapunov function based designs focus on the closed-loop system stability but pay little attention to the closed-loop system performance. In a series of papers, the author proposed some reduced quaternion models which lead to some controllable linearized spacecraft models. Therefore, all standard linear system theory can be directly applied to analyze and design the spacecraft control systems. We showed that, in some cases, the designed control system is not only optimal for the linearized system, but also globally stabilize the original nonlinear system . Clearly, the reduced quaternion models do not depend on rotational sequences. Due to the special structure of the linearized spacecraft model, some most important design methods, such as LQR design and robust pole assignment design are very simple, enjoy the analytical solutions for some problems, have direct connection to the performance measures, such as settling time, rising time , and percentage of overshoot . All these features are attractive for high quality control system designs. The idea mentioned above is then extended to more spacecraft control problems using specific actuators such as magnetic torque bars and control momentum gyroscopes. These types of actuators may not provide exactly desired torques. Most existing methods use different conversions to get approximate solutions, meaning that these actuators may generate a torque close to but not equal to the desired one. Using the reduced quaternion models that incorporate the actuators into the system model, the control inputs are not torques but the operational parameters. The main benefit of this idea is that the control actions are not approximate but accurate. As all actuators have their operational limit, design with input constraints are also considered in this book by using recently developed interior-point optimization techniques. This book grows up from my research on the spacecraft attitude determination and control design methods in more than a decade which is focused on using reduced quaternion models because of their merits stated above. The book provides all necessary background materials on orbital dynamics, rotations and quaternion, frequently used reference frames, transformations between reference frames, space environment and disturbance torques, ephemeris astronomical vector calculations and measurement instruments, spacecraft control actuators and their models, so that the readers will get a global picture and can apply all these information into the spacecraft system modeling, attitude determination, and spacecraft control system designs, which is the main purpose of this book. This book is different from existing books in that we focus on quaternion based spacecraft control system designs and we consider only attitude control system design related problems, from spacecraft modeling, to attitude determination and estimation, to control system design method selection, to control algorithm development, and to the simulation of the control system designs. Moreover, this book addresses different attitude control tasks in the spacecraft life cycle, including spacecraft maneuver, orbit raising, attitude control, and rendezvous. Finally, this book emphasizes the state space design methods rather than the classical frequency design methods.

Attitude determination and control↗

Homotopy Solver

This software implements parallel versions of an interior-point solver, based on the publicly available ipopt solver. Here we have full control over the linear solver and our algorithm is fully parallel thus enabling scalability to large-scale optimization problems. This package also has a parallel implementation of a homotopy solver developed under the scalable methods for contact LDRD project 23-ERD-017. This solver is an mfem-based implementation of algorithm described in ``A filter trust-region Newton continuation method for nonlinear complementarity problems''. Cosmin G. Petra, Nai-Yuan Chiang, Jingyi Wang, Tucker Hartland, and Michael Puso (submitted), LLNL-JRNL-869761.

Hartland, Tucker [Lawrence Livermore National Labo↗