scientific article; zbMATH DE number 1057696
From MaRDI portal
Publication:4352739
zbMath0886.90130MaRDI QIDQ4352739
Gerardo Toraldo, Panos M. Pardalos, Pasquale L. De Angelis
Publication date: 26 October 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound, Multi-standard quadratic optimization: Interior point methods and cone programming reformulation, Optimality conditions and optimization methods for quartic polynomial optimization, Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems, Weak monotonicity of Lehmer and Gini means, Skyport location problem for urban air mobility system, Convex programming with single separable constraint and bounded variables, A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps, Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints, A computational comparison of some branch and bound methods for indefinite quadratic programs, Valid inequalities for quadratic optimisation with domain constraints, Optimal portfolio deleveraging under market impact and margin restrictions, Simple solution methods for separable mixed linear and quadratic knapsack problem, Relaxing the optimality conditions of box QP, Global optimality conditions for some classes of optimization problems, A polyhedral study of nonconvex quadratic programs with box constraints, Unified global optimality conditions for smooth minimization problems with mixed variables, A new algorithm for the general quadratic programming problems with box constraints, Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming, A binarisation heuristic for non-convex quadratic programming with box constraints, New optimality conditions for quadratic optimization problems with binary constraints, Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
