Abstract
This work is concerned with differentiable constrained vector optimization problems. It focus on the intrinsic connection between positive linearly dependent gradient sets and the distinct notions of regularity that come to play in this context. The main aspect of this contribution is the development of regularity conditions, based on the positive linear dependence or independence of gradient sets, for problems with general nonlinear constraints, without any convexity hypothesis. Being easy to verify, these conditions might be useful to define termination criteria in the development of algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.