Canonical duality for box constrained nonconvex and nonsmooth optimization problems
Summary: This paper presents an application of the canonical duality theory for box constrained nonconvex and nonsmooth optimization problems. By use of the canonical dual transformation method, which is developed recently, these very difficult constrained optimization problems in \(\mathbb R^n\) can be converted into the canonical dual problems, which can be solved by deterministic methods. The global and local extrema can be identified by the triality theory. Some examples are listed to illustrate the applications of the theory presented in the paper.
- Canonical duality for solving nonconvex and nonsmooth optimization problem
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- A new reformulation-linearization technique for bilinear programming problems
- A trust region algorithm for minimization of locally Lipschitzian functions
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Conditions for convergence of trust region algorithms for nonsmooth optimization
- Coupled deformations of elastic curves and surfaces
- Deterministic global optimization. Theory, methods and applications
- Direct methods in the calculus of variations
- Dual approach to minimization on the set of Pareto-optimal solutions
- Extended Lagrange and penalty functions in optimization
- scientific article; zbMATH DE number 1210852 (Why is no real title available?)
- Lagrange-type functions in constrained non-convex optimization.
- Legendre Duality in Nonconvex Optimization and Calculus of Variations
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Canonical duality theory for solving non-monotone variational inequality problems
- Canonical duality theory for solving nonconvex/discrete constrained global optimization problems
- On d.c. optimization problems
- On canonical duality theory and constrained optimization problems
- Application of canonical duality theory to global optimization with polynomials
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
- Canonical duality for solving general nonconvex constrained problems
- On constrained optimization problems solved using the canonical duality theory
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Global optimization over a box via canonical dual function
- Complete solutions to general box-constrained global optimization problems
- Canonical duality for solving nonconvex and nonsmooth optimization problem
This page was built for publication: Canonical duality for box constrained nonconvex and nonsmooth optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665441)
