Global solutions to a class of CEC benchmark constrained optimization problems

DOI10.1007/s11590-014-0784-0zbMath1345.90072arXiv1210.3765OpenAlexW1987039528MaRDI QIDQ279808

David Yang Gao, Xiaojun Zhou, Chun Hua Yang

Publication date: 29 April 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.3765

zbMATH Keywords

global optimizationconstrained optimizationcanonical duality theoryCEC benchmark

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems

Uses Software

• SeDuMi
• YALMIP

Cites Work

• Unnamed Item
• Nonlinear system identification and control using state transition algorithm
• Canonical dual approach to solving the maximum cut problem
• Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
• Recursive identification for EIV ARMAX systems
• Solutions to quadratic minimization problems with box and integer constraints
• On the stability of a dual weak vector variational inequality problem
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
• Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state-of-the-art
• Canonical duality theory and solutions to constrained nonconvex quadratic programming
• A polyhedral branch-and-cut approach to global optimization
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• Manifestations of the Schur complement
• Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• State transition algorithm
• Geometric nonlinearity: potential energy, complementary energy, and the gap function
• KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems
• Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Nonlinear Programming

This page was built for publication: Global solutions to a class of CEC benchmark constrained optimization problems