Global minimization of difference of quadratic and convex functions over box or binary constraints
- 24 May 2007
- journal article
- Published by Springer Nature in Optimization Letters
- Vol. 2 (2) , 223-238
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTSAsia-Pacific Journal of Operational Research, 2007
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraintsThe ANZIAM Journal, 2006
- Iterative Convex Quadratic Approximation for Global Optimization in Protein DockingComputational Optimization and Applications, 2005
- Sufficient Global Optimality Conditions for Bivalent Quadratic OptimizationJournal of Optimization Theory and Applications, 2004
- Computational Experience with a New Class of Convex Underestimators: Box-constrained NLP ProblemsJournal of Global Optimization, 2004
- A continuous approch for globally solving linearly constrained quadraticOptimization, 2001
- A note on diagonally dominant matricesLinear Algebra and its Applications, 2000
- Global Optimality Conditions for Quadratic Optimization Problems with Binary ConstraintsSIAM Journal on Optimization, 2000
- Necessary and Sufficient Global Optimality Conditions for Convex Maximization RevisitedJournal of Mathematical Analysis and Applications, 1998
- Quadratic 0/1 optimization and a decomposition approach for the placement of electronic circuitsMathematical Programming, 1994