Abstract
A merit (gap) function is a map that returns zero at the solutions of problems and strictly positive values otherwise. Its minimization is equivalent to the original problem by definition, and it can estimate the distance between a given point and the solution set. Ideally, this function should have some properties, including the ease of computation, continuity, differentiability, boundedness of the level set, and error boundedness. In this work, we propose new merit functions for multiobjective optimization with lower semicontinuous objectives, convex objectives, and composite objectives, and we show that they have such desirable properties under reasonable assumptions.
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.
