Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap

• Autores: Flores-Bazan, Fabian, Echegaray, William, Flores-Bazan, Fernando, Ocana, Eladio
• Formato: artículo
• Fecha de Publicación: 2017
• Institución: Consejo Nacional de Ciencia Tecnología e Innovación
• Repositorio: CONCYTEC-Institucional
• Lenguaje: inglés
• OAI Identifier: oai:repositorio.concytec.gob.pe:20.500.12390/2872
• Enlace del recurso: https://hdl.handle.net/20.500.12390/2872; https://doi.org/10.1007/s10898-017-0542-9
• Nivel de acceso: acceso abierto
• Materia: Management Science and Operations Research; Applied Mathematics; Control and Optimization; Computer Science Applications; http://purl.org/pe-repo/ocde/ford#1.01.02

Primal or dual strong-duality (or min-sup, inf-max duality) in nonconvex optimization is revisited in view of recent literature on the subject, establishing, in particular, new characterizations for the second case. This gives rise to a new class of quasiconvex problems having zero duality gap or closedness of images of vector mappings associated to those problems. Such conditions are described for the classes of linear fractional functions and that of quadratic ones. In addition, some applications to nonconvex quadratic optimization problems under a single inequality or equality constraint, are presented, providing new results for the fulfillment of zero duality gap or dual strong-duality.