Abstract
By using the theory of Euclidean Jordan algebras, based on a new class of smoothing functions, the Qi-Sun-Zhou’s smoothing Newton algorithm is extended to solve linear programming over symmetric cones (SCLP). The algorithm is globally convergent under suitable assumptions.
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.