Search NASA⌕ Search

SEARCH · Search NASA

Results for “infeasibility certificate”

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.

4 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

A framework is proposed for solving general convex quadratic programs (CQPs) from an infeasible starting point by invoking an existing feasible-start algorithm tailored for inequality-constrained CQPs. The central tool is an exact penalty function scheme equipped with a penalty-parameter updating rule. The feasible-start algorithm merely has to satisfy certain general requirements, and so is the updating rule. Under mild assumptions, the framework is proved to converge on CQPs with both inequality and equality constraints and, at a negligible additional cost per iteration, produces an infeasibility certificate, together with a feasible point for an (approximately) ℓ 1 -least relaxed feasible problem, when the given problem does not have a feasible solution. The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more inequality constraints than variables (“imbalanced”). Numerical comparison with popular codes (OSQP, qpOASES, MOSEK) is reported on both randomly generated problems and support-vector machine classifier training problems. The results show that the former typically outperforms the latter on imbalanced problems. Finally, application of the proposed infeasible-start framework to other feasible-start algorithms is briefly considered, and is tested on a simplex iteration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

OPF-Learn: An Open-Source Framework for Creating Representative AC Optimal Power Flow Datasets: Preprint

Increasing levels of renewable generation motivate a growing interest in data-driven approaches for AC optimal power flow (AC OPF) to manage uncertainty. However, a lack of disciplined dataset creation and benchmarking prohibits useful comparison between approaches in the literature. To instigate confidence, models must be able to reliably predict solutions across a wide range of operating conditions. This paper develops the OPF-Learn package for Julia and Python which uses a computationally efficient approach to create representative datasets that span a wide spectrum of the AC OPF feasible region. Load profiles are uniformly sampled from a convex set that contains the AC OPF feasible set. For each infeasible point found, the convex set is reduced using infeasibility certificates, found by utilizing properties of a relaxed formulation. The framework is shown to generate datasets which are more representative of the entire feasible space versus traditional techniques seen in the literature, improving machine learning model performance.

dataset↗
NASA NTRS2014

Towards Run-time Assurance of Advanced Propulsion Algorithms

This paper covers the motivation and rationale for investigating the application of run-time assurance methods as a potential means of providing safety assurance for advanced propulsion control systems. Certification is becoming increasingly infeasible for such systems using current verification practices. Run-time assurance systems hold the promise of certifying these advanced systems by continuously monitoring the state of the feedback system during operation and reverting to a simpler, certified system if anomalous behavior is detected. The discussion will also cover initial efforts underway to apply a run-time assurance framework to NASA's model-based engine control approach. Preliminary experimental results are presented and discussed.

run time assurance↗
NASA NTRS2012

Robust, Practical Adaptive Control for Launch Vehicles

A modern mechanization of a classical adaptive control concept is presented with an application to launch vehicle attitude control systems. Due to a rigorous flight certification environment, many adaptive control concepts are infeasible when applied to high-risk aerospace systems; methods of stability analysis are either intractable for high complexity models or cannot be reconciled in light of classical requirements. Furthermore, many adaptive techniques appearing in the literature are not suitable for application to conditionally stable systems with complex flexible-body dynamics, as is often the case with launch vehicles. The present technique is a multiplicative forward loop gain adaptive law similar to that used for the NASA X-15 flight research vehicle. In digital implementation with several novel features, it is well-suited to application on aerodynamically unstable launch vehicles with thrust vector control via augmentation of the baseline attitude/attitude-rate feedback control scheme. The approach is compatible with standard design features of autopilots for launch vehicles, including phase stabilization of lateral bending and slosh via linear filters. In addition, the method of assessing flight control stability via classical gain and phase margins is not affected under reasonable assumptions. The algorithm s ability to recover from certain unstable operating regimes can in fact be understood in terms of frequency-domain criteria. Finally, simulation results are presented that confirm the ability of the algorithm to improve performance and robustness in realistic failure scenarios.

Orr, Jeb. S.↗