AMG with Filtering An Efficient Preconditioner for Large Scale Contact Mechanics Interior Point Optimization
Explore the source record for details and available documents.
Mathematics and Computing↗
SEARCH · Search NASA
Results for “interior point optimization”
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.
Quantum Interior Point Methods for Semidefinite Optimization
We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction and is not guaranteed to explore only feasible points; the second scheme uses a nullspace representation of the Newton linear system to ensure feasibility even with inexact search directions. The second is a novel scheme that might seem impractical in the classical world, but it is well-suited for a hybrid quantum-classical setting. We show that both schemes converge to an optimal solution of the semidefinite optimization problem under standard assumptions. By comparing the theoretical performance of classical and quantum interior point methods with respect to various input parameters, we show that our second scheme obtains a speedup over classical algorithms in terms of the dimension of the problem n , but has worse dependence on other numerical parameters.
Augustino, Brandon↗
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↗
A superlinear interior points algorithm for engineering design optimization
We present a quasi-Newton interior points algorithm for nonlinear constrained optimization. It is based on a general approach consisting of the iterative solution in the primal and dual spaces of the equalities in Karush-Kuhn-Tucker optimality conditions. This is done in such a way to have primal and dual feasibility at each iteration, which ensures satisfaction of those optimality conditions at the limit points. This approach is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix, instead of quadratic programming subproblems. It is also particularly appropriate for engineering design optimization inasmuch at each iteration a feasible design is obtained. The present algorithm uses a quasi-Newton approximation of the second derivative of the Lagrangian function in order to have superlinear asymptotic convergence. We discuss theoretical aspects of the algorithm and its computer implementation.
Herskovits, J.↗
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↗
Load alleviation maneuvers for a launch vehicle
This paper addresses the design of a forward-looking autopilot that is capable of employing a priori knowledge of wind gusts ahead of the flight path to reduce the bending loads experienced by a launch vehicle. The analysis presented in the present paper is only preliminary, employing a very simple vehicle dynamical model and restricting itself to wind gusts of the form of isolated spikes. The main result of the present study is that LQR based feedback laws are inappropriate to handle spike-type wind perturbations with large amplitude and narrow base. The best performance is achieved with an interior-point penalty optimal control formulation which can be well approximated by a simple feedback control law. Reduction of the maximum bending loads by nearly 50 percent is demonstrated.
Seywald, Hans↗
Load alleviation maneuvers for a launch vehicle
This paper addresses the design of a forward-looking autopilot that is capable of employing a priori knowledge of wind gusts ahead of the flight path to reduce the bending loads experienced by a launch vehicle. The analysis presented in the present paper is only preliminary, employing a very simple vehicle dynamical model and restricting itself to wind gusts of the form of isolated spikes. The main result of the present study is that linear quadratic regulator (LQR) based feedback laws are inappropriate to handle spike-type wind perturbations with large amplitude and narrow base. The best performance is achieved with an interior-point penalty optimal control formulation which can be well approximated by a simple feedback control law. Reduction of the maximum bending loads by nearly 50% is demonstrated.
Seywald, Hans↗
Symmetric Random Butterfly Transform (SRBT) Based Preconditioner
Summary of work using Symmetric Random Butterfly Transformation (SRBT) in conjunction with Incomplete LDL T factorization as a preconditioner for FGMRES solver as a way of solving linear systems arising from interior point methods applied to power system problems. These linear systems have proven difficult to parallelize and this represents a possible route forward.
interior point optimization↗
Implementation of a Point Algorithm for Real-Time Convex Optimization
The primal-dual interior-point algorithm implemented in G-OPT is a relatively new and efficient way of solving convex optimization problems. Given a prescribed level of accuracy, the convergence to the optimal solution is guaranteed in a predetermined, finite number of iterations. G-OPT Version 1.0 is a flight software implementation written in C. Onboard application of the software enables autonomous, real-time guidance and control that explicitly incorporates mission constraints such as control authority (e.g. maximum thrust limits), hazard avoidance, and fuel limitations. This software can be used in planetary landing missions (Mars pinpoint landing and lunar landing), as well as in proximity operations around small celestial bodies (moons, asteroids, and comets). It also can be used in any spacecraft mission for thrust allocation in six-degrees-of-freedom control.
Acikmese, Behcet↗
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↗
Discussion of the General Electric proposal to develop a computer program to select thermal coatings for passive temperature control of satellites
The General Electric Company, Missiles and Space Division, submitted/a proposal to NASA for the development of an IBM 7094 computer program which would select the exterior surface coatings for passively controlling spacecraft temperatures. G. E. claims that the "trial and error" procedures currently used can be accomplished more rationally and can therefore be programmed for a digital computer. In the ASME paper, 63-HT-41, which was presented at the ASME-AIChE Heat Transfer Conference at Boston in August, 1963, Costello, Harper, and Cline, described the procedures that have been used at G. E. to develop a coating selection program subject to the following restrictions: 1. Steady-state conditions prevail, 2. Heat transfer occurs by radiation only, 3. Temperatures are optimized at only one interior point in the spacecraft, an d 4. Only the solar absorptance of the external coatings is varied to optimize temperature. The emittance must remain constant at initially specified values. General Electric proposes to develop a generalized program in three steps: 1. The program would vary both solar absorptance and hemispherical emittance to obtain the optimum coating patterns; 2. Temperatures would be optimized at more than one interior point; and 3. The equations would be modified to account for both conduction and radiation heat transfer. In the development of the general program, the scope would be restricted to steady-state heat transfer. Since the thermal designs of most spacecraft are based primarily on nearly equilibrium conditions, the proposed program could have wide application. An obvious extension of the proposed program would be to account for transient temperatures.
IBM 7090 COMPUTER↗
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↗
An Infeasible Interior-Point Arc-Search Algorithm for Spacecraft Trajectory Optimization
Explore the source record for details and available documents.
optimization, trajectory design↗
Riemannian Optimization Applied to AC Optimal Power Flow: Preprint
The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.
manifold optimization↗
ACCESS 3. Approximation concepts code for efficient structural synthesis: User's guide
A user's guide is presented for ACCESS-3, a research oriented program which combines dual methods and a collection of approximation concepts to achieve excellent efficiency in structural synthesis. The finite element method is used for structural analysis and dual algorithms of mathematical programming are applied in the design optimization procedure. This program retains all of the ACCESS-2 capabilities and the data preparation formats are fully compatible. Four distinct optimizer options were added: interior point penalty function method (NEWSUMT); second order primal projection method (PRIMAL2); second order Newton-type dual method (DUAL2); and first order gradient projection-type dual method (DUAL1). A pure discrete and mixed continuous-discrete design variable capability, and zero order approximation of the stress constraints are also included.
Fleury, C.↗
Lagrange duality theory for convex control problems
The Lagrange dual to a control problem is studied. The principal result based on the Hahn-Banach theorem proves that the dual problem has an optimal solution if there exists an interior point for the constraint set. A complementary slackness condition holds, if the primal problem has an optimal solution. A necessary and sufficient condition for the optimality of solutions to the primal and the dual problem is also presented.
Hager, W. W.↗
Riemannian Optimization Applied to AC Optimal Power Flow
The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.
AC optimal power flow↗
Exploiting Power Flow Manifold to Solve AC Optimal Power Flow
AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.
AC optimal power flow↗