[图书][B] Relaxation and decomposition methods for mixed integer nonlinear programming
I Nowak - 2005 - books.google.com
Nonlinearoptimizationproblemscontainingb… are called mixed integer nonlinear programs
(MINLP). Such problems arise in many? elds, such as process industry, engineering design …
(MINLP). Such problems arise in many? elds, such as process industry, engineering design …
Enhancing RLT relaxations via a new class of semidefinite cuts
HD Sherali, BMP Fraticelli - Journal of Global Optimization, 2002 - Springer
In this paper, we propose a mechanism to tighten Reformulation-Linearization Technique
(RLT) based relaxations for solving nonconvex programming problems by importing …
(RLT) based relaxations for solving nonconvex programming problems by importing …
[HTML][HTML] A clique algorithm for standard quadratic programming
A Scozzari, F Tardella - Discrete Applied Mathematics, 2008 - Elsevier
A standard Quadratic Programming problem (StQP) consists in minimizing a (nonconvex)
quadratic form over the standard simplex. For solving a StQP we present an exact and a …
quadratic form over the standard simplex. For solving a StQP we present an exact and a …
Dual bounds and optimality cuts for all-quadratic programs with convex constraints
I Nowak - Journal of Global Optimization, 2000 - Springer
A central problem of branch-and-bound methods for global optimization is that often a lower
bound do not match with the optimal value of the corresponding subproblem even if the …
bound do not match with the optimal value of the corresponding subproblem even if the …
A two-phase sequential algorithm for global optimization of the standard quadratic programming problem
J Júdice, V Sessa, M Fukushima - Journal of Global Optimization, 2024 - Springer
We introduce a new sequential algorithm for the Standard Quadratic Programming Problem
(StQP), which exploits a formulation of StQP as a Linear Program with Linear …
(StQP), which exploits a formulation of StQP as a Linear Program with Linear …
LP-based tractable subcones of the semidefinite plus nonnegative cone
A Tanaka, A Yoshise - Annals of operations research, 2018 - Springer
The authors in a previous paper devised certain subcones of the semidefinite plus
nonnegative cone and showed that satisfaction of the requirements for membership of those …
nonnegative cone and showed that satisfaction of the requirements for membership of those …
Indefinite knapsack separable quadratic programming: methods and applications
J Jeong - 2014 - trace.tennessee.edu
Quadratic programming (QP) has received significant consideration due to an extensive list
of applications. Although polynomial time algorithms for the convex case have been …
of applications. Although polynomial time algorithms for the convex case have been …
[PDF][PDF] TRACE: Tennessee Research and Creative Exchange
J Jeong - academia.edu
Quadratic programming (QP) has received significant consideration due to an extensive list
of applications. Although polynomial time algorithms for the convex case have been …
of applications. Although polynomial time algorithms for the convex case have been …
[PDF][PDF] A NECESSARY AND SUFFICIENT CONDITION FOR A POINT TO BE A GLOBAL MAXIMIZER OF A CONSTRAINED OPTIMIZATION
SUN Churen - Journal of Systems Science and Complexity, 2005 - academia.edu
It is difficult to judge whether a given point is a global maximizer of an unconstrained
optimization problem. This paper deals with this problem by considering global information …
optimization problem. This paper deals with this problem by considering global information …