Abstract
The conditional gradient method is generalized to nonconvex sets of constraints representing the set-theoretic intersection of a convex smooth surface and a convex compact set. Necessary optimality conditions are studied, and the convergence of the method is analyzed.
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 callMore From: Журнал вычислительной математики и математической физики
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.
