Abstract
An iterative method for finding equilibrium points in the case of a smooth convex-concave function and a convex feasible set is proposed. This set is defined by smooth concave functions. The method is based on combining and extending ideas contained in feasible direction methods and relaxation methods for optimization problems and convex inequalities
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.
