Iterative determination of parameters for an exact penalty function
Abstract
As an approach to solving nonlinear programs, the paper discusses a class of functions known to be exact penalty functions for a proper choice of the parameters. The goal is to iteratively determine the correct parameter values. A basic algorithm has been developed. The author proved that this algorithm converges for concave programs, and in the limited computational tests performed to date it has always converged for nonconcave programs also. Suggestions for continuing the work are given
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.NPS Report Number
NPS55Hh71121ARelated items
Showing items related by title, author, creator and subject.
-
Observability Options Against an Adversarial Swarm - a Quantitative Analysis
Kaminer, Issac; Park, Hyeongjun; Kang, Wei; Gong, Qi (2018-04-17);In this presentation we address the problem of detecting internal cooperating strategies of an adversarial swarm by estimating a set of parameters that define a particular swarm cooperating strategy. This is a nonstandard ... -
Observability Options Against an Adversarial Swarm - a Quantitative Analysis [video]
Kaminer, Issac; Park, Hyeongjun; Kang, Wei; Gong, Qi (2018-04-17);In this presentation we address the problem of detecting internal cooperating strategies of an adversarial swarm by estimating a set of parameters that define a particular swarm cooperating strategy. This is a nonstandard ... -
Method and apparatus for state space trajectory control of uncertain dynamical systems
Ross, Isaac Michael; Karpenko, Mark; Proulx, Ronald Joseph (United States Patent Office, 2017-12-26);Methods, systems and computer readable media are presented for computing a guidance control policy to transition an uncertain dynamical system from an initial state to a final state, in which a set of points are computed ...