Search NASA⌕ Search

SEARCH · Search NASA

Results for “gradient projection”

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.

At least 19 records

Panel flutter optimization by gradient projection

A gradient projection optimal control algorithm incorporating conjugate gradient directions of search is described and applied to several minimum weight panel design problems subject to a flutter speed constraint. New numerical solutions are obtained for both simply-supported and clamped homogeneous panels of infinite span for various levels of inplane loading and minimum thickness. The minimum thickness inequality constraint is enforced by a simple transformation of variables.

Pierson, B. L.↗

Accelerated gradient projection

Accelerated gradient projection algorithm for nonlinear constraints, examining terminal phase convergence and compatibility with Davidon process

Kelley, H. J.↗

Programming the gradient projection algorithm

The gradient projection method of numerical optimization which is applied to problems having linear constraints but nonlinear objective functions is described and analyzed. The algorithm is found to be efficient and thorough for small systems, but requires the addition of auxiliary methods and programming for large scale systems with severe nonlinearities. In order to verify the theoretical results a digital computer is used to simulate the algorithm.

Hargrove, A.↗

Efficient gradient projection optimization for manipulators with multiple degrees of redundancy

An efficient gradient projection optimization scheme is presented for manipulators with multiple degrees of redundancy. This is an extension of the gradient projection scheme presented by Dubey et al. (1989) for manipulators with one degree of redundancy. The feasibility and effectiveness of this scheme are tested through simulations of the seven-degree-of-freedom NASA Laboratory Telerobotic Manipulator (LTM). Only the position of the LTM end effector is controlled, which requires only three degrees of freedom. The remaining joints, except for the wrist roll joint, which does not contribute to the end-effector linear velocity, provide three degrees of redundacy.

Zghal, H.↗

Solution of nonlinear multivariable constrained systems using a gradient projection digital algorithm that is insensitive to the initial state

Optimal digital control of nonlinear multivariable constrained systems was studied. The optimal controller in the form of an algorithm was improved and refined by reducing running time and storage requirements. A particularly difficult system of nine nonlinear state variable equations was chosen as a test problem for analyzing and improving the controller. Lengthy analysis, modeling, computing and optimization were accomplished. A remote interactive teletype terminal was installed. Analysis requiring computer usage of short duration was accomplished using Tuskegee's VAX 11/750 system.

Hargrove, A.↗

Curvilinear projection developments

Gradient projection is a powerful algorithm for minimization of a function subject to constraints. Constraint nonlinearities hamper projection computations. The constraints must then be restored before another projection cycle. The restoration steps taken in the process of following nonlinear constraint surfaces can be used as a guide to the construction of a curve which more nearly follows the constraints than does the straight line in the projected gradient direction. This scheme, termed 'curvilinear projection', was explored in earlier research. The study presently reported carries out some computational experiments using a related version of the technique. Some other details of projection computations which turn out to be practically important are taken up: rules for updating the variable metric in projection when early termination of the one-dimensional search on constraint violation occurs, and active-constraint logic for screening inequalities that makes use of the Kuhn-Tucker necessary conditions.

Kelley, H. J.↗

Conjugate gradient based projection - A new explicit methodology for frictional contact

With special attention towards the applicability to parallel computation or vectorization, a new and effective explicit approach for linear complementary formulations involving a conjugate gradient based projection methodology is proposed in this study for contact problems with Coulomb friction. The overall objectives are focussed towards providing an explicit methodology of computation for the complete contact problem with friction. In this regard, the primary idea for solving the linear complementary formulations stems from an established search direction which is projected to a feasible region determined by the non-negative constraint condition; this direction is then applied to the Fletcher-Reeves conjugate gradient method resulting in a powerful explicit methodology which possesses high accuracy, excellent convergence characteristics, fast computational speed and is relatively simple to implement for contact problems involving Coulomb friction.

Tamma, Kumar K.↗

Second derivatives of the flutter velocity and the optimization of aircraft structures.

Equations for the second partial derivatives of the eigenvalues of the flutter equation along with the equations for finding the second partial derivatives of the flutter velocity of an aircraft structure with respect to the structural parameters are derived. These partial derivatives are used to develop expressions for the step size in a projected gradient search along a constant mass hyperlane. A projected gradient search along with a gradient mass and a gradient velocity search is used to minimize the mass of a box beam which supports a lifting surface.

Rudisill, C. S.↗

Distributed-Memory Parallel JointNMF

Joint Nonnegative Matrix Factorization (JointNMF) is a hybrid method for mining information from datasets that contain both feature and connection information. We propose distributed-memory parallelizations of three algorithms for solving the JointNMF problem based on Alternating Nonnegative Least Squares, Projected Gradient Descent, and Projected Gauss-Newton. We extend well-known communication-avoiding algorithms using a single processor grid case to our coupled case on two processor grids. We demonstrate the scalability of the algorithms on up to 960 cores (40 nodes) with 60% parallel efficiency. The more sophisticated Alternating Nonnegative Least Squares (ANLS) and Gauss-Newton variants outperform the first-order gradient descent method in reducing the objective on large-scale problems. We perform a topic modelling task on a large corpus of academic papers that consists of over 37 million paper abstracts and nearly a billion citation relationships, demonstrating the utility and scalability of the methods.

Eswar, Srinivas↗

Four-body trajectory optimization

A comprehensive optimization program has been developed for computing fuel-optimal trajectories between the earth and a point in the sun-earth-moon system. It presents methods for generating fuel optimal two-impulse trajectories which may originate at the earth or a point in space and fuel optimal three-impulse trajectories between two points in space. The extrapolation of the state vector and the computation of the state transition matrix are accomplished by the Stumpff-Weiss method. The cost and constraint gradients are computed analytically in terms of the terminal state and the state transition matrix. The 4-body Lambert problem is solved by using the Newton-Raphson method. An accelerated gradient projection method is used to optimize a 2-impulse trajectory with terminal constraint. The Davidon's Variance Method is used both in the accelerated gradient projection method and the outer loop of a 3-impulse trajectory optimization problem.

Pu, C. L.↗

Distributed Minimization of the Power Generation Cost in Prosumer-Based Distribution Networks: Preprint

Traditionally, electrical power was generated in big power plants. The cost of producing energy was related to the cost of fuel, e.g., carbon or gas, and by the cost of maintaining the power plants. With the advent of distributed energy resources, power can be produced directly at the edge of the electrical network by a new type of agents: the prosumers. Prosumers are entities that both consume and generate power, e.g., by means of photovoltaic panels. The cost of the power produced by prosumers is no longer related to fuel consumption since energy coming from distributed generators is essentially free. Rather, the cost is related to the remuneration that is due to the prosumers for the services they provide. The proposed control strategy minimizes the active power generation cost in the aforementioned scenario. The control scheme requires that the prosumers measure their voltage and then adjust the amount of injected power, according to a continuous time feedback control law that is indeed a projected gradient descent strategy. Simulations are provided in order to illustrate the algorithm behavior.

distributed control↗

Protection Against Graph-Based False Data Injection Attacks on Power Systems

Graph signal processing (GSP) has emerged as a powerful tool for practical network applications, including power system monitoring. By representing power system voltages as smooth graph signals, recent research has focused on developing GSP-based methods for state estimation, attack detection, and topology identification. Included, efficient methods have been developed for detecting false data injection (FDI) attacks, which until now were perceived as non-smooth with respect to the graph Laplacian matrix. Consequently, these methods may not be effective against smooth FDI attacks. In this paper, we propose a graph FDI (GFDI) attack that minimizes the Laplacian-based graph total variation (TV) under practical constraints. In addition, we develop a low-complexity algorithm that solves the non-convex GDFI attack optimization problem using ell_1-norm relaxation, the projected gradient descent (PGD) algorithm, and the alternating direction method of multipliers (ADMM). We then propose a protection scheme that identifies the minimal set of measurements necessary to constrain the GFDI output to high graph TV, thereby enabling its detection by existing GSP-based detectors. Our numerical simulations on the IEEE-57 bus test case reveal the potential threat posed by well-designed GSP-based FDI attacks. Moreover, we demonstrate that integrating the proposed protection design with GSP-based detection can lead to significant hardware cost savings compared to previous designs of protection methods against FDI attacks.

Morgenstern, Gal↗

The Effects of Compounded Model Size Reductions on Adversarial Robustness

Recent advances in Edge AI and Tiny Machine Learning (TinyML) have enabled the deployment of machine learning models on resource-constrained environments. However, deploying these models on edge devices, such as micro-controllers, requires significant model footprint reduction through a variety of techniques such as quantization, pruning, and clustering. While these optimization methods offer considerable advantages, they potentially introduce AI-related security vulnerabilities, particularly concerning model robustness with respect to adversarial AI attacks. Prior research has extensively examined the impact of quantization on adversarial robustness; however, the effects of alternative reduction techniques and their combinations remain understudied. This paper investigates the impact of model size reduction techniques on adversarial robustness, when applied individually and combined. We utilized Fast Gradient Sign Method (FGSM) and Projected Gradient Descent (PGD) attacks to generate adversarial perturbations for both training and testing data, and then evaluated the models' accuracy under adversarial training conditions. Our findings revealed that reduction techniques generally diminished robustness; although, combining techniques was not found to make robustness any worse than when applied individually. Moreover, specific techniques can potentially enhance resistance to small size perturbations. This research provides insights into the trade-offs between model size reduction and security, establishing a foundation for future investigations into improving adversarial training techniques and methodologies for maintaining robustness while preserving memory footprint benefits.

Austria, Phillipe [ORNL] (ORCID:0000000236223973)↗

Nonlinear, real-time optimization for actuator management in tokamaks

Experiments in DIII-D have been carried out to test a novel actuator management approach in tokamaks. Here, the actuator management scheme is posed as a nonlinear-optimization problem in which the actuator commands are calculated in real time according to the changing control priorities, plasma state, and actuator availability. Such optimization problem is solved using the augmented Lagrangian method, combined with a gradient projection method and a conjugate-gradient iteration algorithm. The algorithmic approach followed in this work does not depend on the particular control objectives or actuators considered, which facilitates its integration with other independently-designed control components within a plasma-control system. In addition, the actuator-management algorithm is able to handle the optimization problem in a computationally efficient manner, making it suitable for real-time implementations. Initial DIII-D results in the steady-state high-q min scenario have demonstrated the capabilities of the actuator manager to perform both simultaneous multiple mission and repurposing sharing, which will be required in ITER.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗