This paper proposes two unconstrained algorithms, the Steepest Decent (SD)algorithm and the Conjugate Gradient (CG) algorithm, based on a superexcellent cost function. At thesame time, two constrained algorithms which...This paper proposes two unconstrained algorithms, the Steepest Decent (SD)algorithm and the Conjugate Gradient (CG) algorithm, based on a superexcellent cost function. At thesame time, two constrained algorithms which include the Constrained Steepest Decent (CSD) algorithmand the Constrained Conjugate Gradient algorithm (CCG) are deduced subject to a new constraincondition. They are both implemented in unitary transform domain. The computational complexities ofthe constrained algorithms are compared to those of the unconstrained algorithms. Resultingsimulations show their performance comparisons.展开更多
文摘This paper proposes two unconstrained algorithms, the Steepest Decent (SD)algorithm and the Conjugate Gradient (CG) algorithm, based on a superexcellent cost function. At thesame time, two constrained algorithms which include the Constrained Steepest Decent (CSD) algorithmand the Constrained Conjugate Gradient algorithm (CCG) are deduced subject to a new constraincondition. They are both implemented in unitary transform domain. The computational complexities ofthe constrained algorithms are compared to those of the unconstrained algorithms. Resultingsimulations show their performance comparisons.
