On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications
- Authors: Ruan, Ning , Gao, David
- Date: 2018
- Type: Text , Journal article
- Relation: Fixed Point Theory and Applications Vol. 2018, no. 1 (2018), p. 1-19
- Full Text:
- Reviewed:
- Description: This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e., the general fixed point problem is first reformulated as a nonconvex optimization problem, its well-posedness is discussed based on the objectivity principle in continuum physics; then the canonical duality theory is applied for solving this challenging problem to obtain not only all fixed points, but also their stability properties. Applications are illustrated by problems governed by nonconvex polynomial, exponential, and logarithmic operators. This paper shows that within the framework of the canonical duality theory, there is no difference between the fixed point problems and nonconvex analysis/optimization in multidisciplinary studies.
On modeling and global solutions for d.c. optimization problems by canonical duality theory
- Authors: Jin, Zhong , Gao, David
- Date: 2017
- Type: Text , Journal article
- Relation: Applied Mathematics and Computation Vol. 296, no. (2017), p. 168-181
- Full Text:
- Reviewed:
- Description: This paper presents a canonical d.c. (difference of canonical and convex functions) programming problem, which can be used to model general global optimization problems in complex systems. It shows that by using the canonical duality theory, a large class of nonconvex minimization problems can be equivalently converted to a unified concave maximization problem over a convex domain, which can be solved easily under certain conditions. Additionally, a detailed proof for triality theory is provided, which can be used to identify local extremal solutions. Applications are illustrated and open problems are presented.
- Description: This paper presents a canonical d.c. (difference of canonical and convex functions) programming problem, which can be used to model general global optimization problems in complex systems. It shows that by using the canonical duality theory, a large class of nonconvex minimization problems can be equivalently converted to a unified concave maximization problem over a convex domain, which can be solved easily under certain conditions. Additionally, a detailed proof for triality theory is provided, which can be used to identify local extremal solutions. Applications are illustrated and open problems are presented. © 2016 Elsevier Inc.