Abstract
Based on the triangle sandwich and block sandwich methods, two approximation methods for non-convex curves are considered in this paper. Numerical algorithms corresponding to these methods are developed and quadratic convergence properties of two methods in the original space are established. Application is given to the approximation of an efficient frontier of a bi-criteria optimization problem.
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.
