Canonical dual least square method for solving general nonlinear systems of quadratic equations.

Saved in:
Bibliographic Details
Title: Canonical dual least square method for solving general nonlinear systems of quadratic equations.
Authors: Ruan, N.1, Gao, David1 gao@vt.edu, Jiao, Y.2
Source: Computational Optimization & Applications. Oct2010, Vol. 47 Issue 2, p335-347. 13p. 3 Graphs.
Subjects: Contact transformations, Least squares, Nonlinear systems, Quadratic equations, Nonconvex programming, Duality theory (Mathematics)
Abstract: This paper presents a canonical dual approach for solving general nonlinear algebraic systems. By using least square method, the nonlinear system of m-quadratic equations in n-dimensional space is first formulated as a nonconvex optimization problem. We then proved that, by the canonical duality theory developed by the second author, this nonconvex problem is equivalent to a concave maximization problem in ℝ, which can be solved easily by well-developed convex optimization techniques. Both existence and uniqueness of global optimal solutions are discussed, and several illustrative examples are presented. [ABSTRACT FROM AUTHOR]
Copyright of Computational Optimization & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:This paper presents a canonical dual approach for solving general nonlinear algebraic systems. By using least square method, the nonlinear system of m-quadratic equations in n-dimensional space is first formulated as a nonconvex optimization problem. We then proved that, by the canonical duality theory developed by the second author, this nonconvex problem is equivalent to a concave maximization problem in ℝ, which can be solved easily by well-developed convex optimization techniques. Both existence and uniqueness of global optimal solutions are discussed, and several illustrative examples are presented. [ABSTRACT FROM AUTHOR]
ISSN:09266003
DOI:10.1007/s10589-008-9222-5