Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Solution to nonconvex quadratic programming with both inequality and box constraints
Abstract This paper presents a canonical dual approach for solving nonconvex quadratic programming problems subjected to both linear inequality constraints and box constrains. It is proved that the constrained nonconvex primal problem can be reformulated as a concave maximization dual problem with zero duality gap, which can be solved under certain conditions. Both global and local extremimality conditions are presented by the triality theory. Several applications are illustrated.
Solution to nonconvex quadratic programming with both inequality and box constraints
Abstract This paper presents a canonical dual approach for solving nonconvex quadratic programming problems subjected to both linear inequality constraints and box constrains. It is proved that the constrained nonconvex primal problem can be reformulated as a concave maximization dual problem with zero duality gap, which can be solved under certain conditions. Both global and local extremimality conditions are presented by the triality theory. Several applications are illustrated.
Solution to nonconvex quadratic programming with both inequality and box constraints
Zhang, Xi (Autor:in) / Zhu, Jinghao (Autor:in) / Gao, David Y. (Autor:in)
2008
Aufsatz (Zeitschrift)
Englisch
Solution to nonconvex quadratic programming with both inequality and box constraints
British Library Conference Proceedings | 2009
|Solution to nonconvex quadratic programming with both inequality and box constraints
Springer Verlag | 2008
|Soft inequality constraints in gradient method and fast gradient method for quadratic programming
Online Contents | 2018
|Soft inequality constraints in gradient method and fast gradient method for quadratic programming
Springer Verlag | 2018
|Characterizations of the solution set for nonconvex semi-infinite programming problems
British Library Online Contents | 2016
|