On d.c. optimization problems
From MaRDI portal
Recommendations
- On modeling and global solutions for d.c. optimization problems by canonical duality theory
- Canonical duality theory and triality for solving general global optimization problems in complex systems
- Canonical duality for solving nonconvex and nonsmooth optimization problem
- Canonical duality for box constrained nonconvex and nonsmooth optimization problems
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
Cited in
(13)- DC formulations and algorithms for sparse optimization problems
- Beyond canonical dc-optimization: the single reverse polar problem
- Complete solutions and triality theory to a nonconvex optimization problem with double-well potential in \(\mathbb{R}^n \)
- Alternating DC algorithm for partial DC programming problems
- A revision of the rectangular algorithm for a class of DC optimization problems
- Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
- On local search in d.c. optimization problems
- DC Programming Approaches for BMI and QMI Feasibility Problems
- Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
- On a DC-optimization-problem from statistical factor analysis
- On unconstrained optimization problems solved using the canonical duality and triality theories
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Canonical duality for solving nonconvex and nonsmooth optimization problem
This page was built for publication: On d.c. optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696977)
