Canonical duality for box constrained nonconvex and nonsmooth optimization problems
From MaRDI portal
(Redirected from Publication:1665441)
Recommendations
- 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
Cites work
- scientific article; zbMATH DE number 1210852 (Why is no real title available?)
- 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
- 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*
Cited in
(13)- Canonical duality for solving nonconvex and nonsmooth optimization problem
- On constrained optimization problems solved using the canonical duality theory
- On canonical duality theory and constrained optimization problems
- Canonical duality theory for solving nonconvex/discrete constrained global optimization problems
- Canonical duality for solving general nonconvex constrained problems
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Application of canonical duality theory to global optimization with polynomials
- Global optimization over a box via canonical dual function
- On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program
- Robust canonical duality theory for solving nonconvex programming problems under data uncertainty
- On d.c. optimization problems
- Complete solutions to general box-constrained global optimization problems
- Canonical duality theory for solving non-monotone variational inequality problems
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)
