Abstract
In this paper a study is made of the use of weighting vectors to generate solutions to problems where the gradient vectors are known to be in a given set. A measure of closeness of weighting vectors and of objective function vectors generated, is developed, and, in the latter case, using various semi-norms, surrogate optimization problems are developed to assess this closeness at any stage of, for example, an interactive method. The semi-norms are then related to the underlying value function gradients to give conditions for terminating the procedure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
