Abstract

In this paper different classes of unconstrained and constrained minimization problems with max-min objective and/or constraint functions are studied. First we consider simple problems with the max-min objective function, where the explicit description of all local minimizers is given. Then we discuss the application of the cutting angle and discrete gradient methods as well as a special penalization method for solving constrained problems. We report the results of preliminary numerical experiments.

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 call

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.