Canonical primal-dual method for solving nonconvex minimization problems
From MaRDI portal
Abstract: A new primal-dual algorithm is presented for solving a class of non-convex minimization problems. This algorithm is based on canonical duality theory such that the original non-convex minimization problem is first reformulated as a convex-concave saddle point optimization problem, which is then solved by a quadratically perturbed primal-dual method. %It is proved that the popular SDP method is indeed a special case of the canonical duality theory. Numerical examples are illustrated. Comparing with the existing results, the proposed algorithm can achieve better performance.
Recommendations
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem
- Canonical duality for solving general nonconvex constrained problems
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Canonical duality theory for solving nonconvex/discrete constrained global optimization problems
Cited in
(3)
This page was built for publication: Canonical primal-dual method for solving nonconvex minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696978)
