Canonical duality for box constrained nonconvex and nonsmooth optimization problems

DOI10.1155/2015/354263zbMath1394.90554OpenAlexW1570966183WikidataQ59118129 ScholiaQ59118129MaRDI QIDQ1665441

Huicheng Liu, Jing Liu

Publication date: 27 August 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2015/354263

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• A new reformulation-linearization technique for bilinear programming problems
• Coupled deformations of elastic curves and surfaces
• A trust region algorithm for minimization of locally Lipschitzian functions
• Lagrange-type functions in constrained non-convex optimization.
• Computational experience with a new class of convex underestimators: Box-constrained NLP problems
• Canonical duality theory and solutions to constrained nonconvex quadratic programming
• Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
• Dual approach to minimization on the set of Pareto-optimal solutions
• Deterministic global optimization. Theory, methods and applications
• Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
• Conditions for convergence of trust region algorithms for nonsmooth optimization
• Legendre Duality in Nonconvex Optimization and Calculus of Variations
• Perfect duality theory and complete solutions to a class of global optimization problems*
• Direct methods in the calculus of variations
• Extended Lagrange and penalty functions in optimization

This page was built for publication: Canonical duality for box constrained nonconvex and nonsmooth optimization problems