vix.ing · top · new · best · stats · spec

On unconstrained optimization problems solved using CDT and triality theory

2018/10/21 by Constantin Zălinescu, Zalinescu, C.
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #FOS: Mathematics #Matrix Theory and Algorithms #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.1810.09009

openalex publication_date 2018/10/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

DY Gao solely or together with some of his collaborators applied his Canonical duality theory (CDT) for solving a class of unconstrained optimization problems, getting the so-called "triality theorems". Unfortunately, the "double-min duality" from these results published before 2010 revealed to be false, even if in 2003 DY Gao announced that "certain additional conditions" are needed for getting it. After 2010 DY Gao together with some of his collaborators published several papers in which they added additional conditions for getting "double-min" and "double-max" dualities in the triality theorems. The aim of this paper is to treat rigorously this kind of problems and to discuss several results concerning the "triality theory" obtained up to now.

Citations

Related