Results 141 to 150 of about 605 (168)
Some of the next articles are maybe not open access.
Global optimization of a class of nonconvex quadratically constrained quadratic programming problems
Acta Mathematica Sinica, English Series, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
RLT-Based Global Optimization Algorithms for Nonconvex Polynomial Programming Problems
1999Thus far, we have considered the generation of tight relaxations leading to the convex hull representation for linear and nonlinear (polynomial) discrete mixed-integer programming problems using the Reformulation-Linearization Technique (RLT). It turns out that because of its natural facility to enforce relationships between different polynomial terms,
Hanif D. Sherali, Warren P. Adams
openaire +1 more source
Journal of Global Optimization
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dillard Robertson +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dillard Robertson +2 more
openaire +1 more source
IEEE Transactions on Cybernetics
A swarm-exploring neurodynamic network (SENN) based on a two-timescale model is proposed in this study for solving nonconvex nonlinear programming problems. First, by using a convergent-differential neural network (CDNN) as a local quadratic programming (QP) solver and combining it with a two-timescale model design method, a two-timescale convergent ...
Yamei Luo +5 more
openaire +2 more sources
A swarm-exploring neurodynamic network (SENN) based on a two-timescale model is proposed in this study for solving nonconvex nonlinear programming problems. First, by using a convergent-differential neural network (CDNN) as a local quadratic programming (QP) solver and combining it with a two-timescale model design method, a two-timescale convergent ...
Yamei Luo +5 more
openaire +2 more sources
INFORMS Journal on Computing
We learn optimal instance-specific heuristics for the global minimization of nonconvex quadratically constrained quadratic programs (QCQPs). Specifically, we consider partitioning-based convex mixed-integer programming relaxations for nonconvex QCQPs and propose the novel problem of strong partitioning to optimally partition variable domains without ...
Rohit Kannan +2 more
openaire +1 more source
We learn optimal instance-specific heuristics for the global minimization of nonconvex quadratically constrained quadratic programs (QCQPs). Specifically, we consider partitioning-based convex mixed-integer programming relaxations for nonconvex QCQPs and propose the novel problem of strong partitioning to optimally partition variable domains without ...
Rohit Kannan +2 more
openaire +1 more source
Distributed Global Optimization for a Class of Nonconvex Optimization With Coupled Constraints
IEEE Transactions on Automatic Control, 2022Dewei Li, Yugeng Xi, Haibin Shao
exaly
2014
The primary objective of this thesis is to develop and implement a global optimization algorithm to solve a class of nonconvex programming problems, and to test it using a collection of engineering design problem applications.The class of problems we consider involves the optimization of a general nonconvex factorable objective function over a feasible
openaire +1 more source
The primary objective of this thesis is to develop and implement a global optimization algorithm to solve a class of nonconvex programming problems, and to test it using a collection of engineering design problem applications.The class of problems we consider involves the optimization of a general nonconvex factorable objective function over a feasible
openaire +1 more source
Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
Applied Numerical Mathematics, 2022Qingjie Hu
exaly