Duality Theory: Biduality in Nonconvex Optimization Duality Theory: Biduality in Nonconvex Optimization
نویسنده
چکیده
It is known that in convex optimization, the Lagrangian associated with a constrained problem is usually a saddle function, which leads to the classical saddle Lagrange duality (i. e. the monoduality) theory. In nonconvex optimization, a so-called superLagrangian was introduced in [1], which leads to a nice biduality theory in convex Hamiltonian systems and in the so-called d.c. programming.
منابع مشابه
Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملCanonical Duality Theory: Connections between nonconvex mechanics and global optimization
This paper presents a comprehensive review and some new developments on canonical duality theory for nonconvex systems. Based on a tri-canonical form for quadratic minimization problems, an insightful relation between canonical dual transformations and nonlinear (or extended) Lagrange multiplier methods is presented. Connections between complementary variational principles in nonconvex mechanic...
متن کاملA Duality Theory with Zero Duality Gap for Nonlinear Programming
Duality is an important notion for constrained optimization which provides a theoretical foundation for a number of constraint decomposition schemes such as separable programming and for deriving lower bounds in space decomposition algorithms such as branch and bound. However, the conventional duality theory has the fundamental limit that it leads to duality gaps for nonconvex optimization prob...
متن کاملSolutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
Abstract This paper presents a canonical duality theory for solving a general nonconvex 1 quadratic minimization problem with nonconvex constraints. By using the canonical dual 2 transformation developed by the first author, the nonconvex primal problem can be con3 verted into a canonical dual problem with zero duality gap. A general analytical solution 4 form is obtained. Both global and local...
متن کاملSolutions and optimality criteria for nonconvex quadratic-exponential minimization problem
This paper presents a set of complete solutions and optimality conditions for a nonconvex quadratic-exponential optimization problem. By using the canonical duality theory developed by the first author, the nonconvex primal problem in n-dimensional space can be converted into an one-dimensional canonical dual problem with zero duality gap, which can be solved easily to obtain all dual solutions...
متن کامل