Abstract
The main goal of this paper is to define a dual problem for a special non-convex, global optimization problem and to show that a duality gap may not occur. The proof is based on the convergence of a cutting plane algorithm. The results can be applied. to a dual characterization of the strong unicity constant in linear Chebyshev approximation and the algorithm can be used to compute this constant.
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 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.
