Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer_journal/on-global-optimization-with-indefinite-quadratics-0dLGK9V3Zk
References (51)
-
C. Adjiman, S. Dallwig, C. Floudas, A. Neumaier (1998)
A global optimization method, αBB, for general twice-differentiable constrained NLPs — I. Theoretical advancesComputers & Chemical Engineering, 22
-
F. Ghassemi, V. Krishnamurthy (2008)
A cooperative game-theoretic measurement allocation algorithm for localization in unattended ground sensor networks2008 11th International Conference on Information Fusion
-
K. Anstreicher, S. Burer (2005)
D.C. Versus Copositive Bounds for Standard QPJournal of Global Optimization, 33
-
K. Anstreicher, M. Fampa, Jon Lee, J. Williams (2001)
Maximum-entropy remote samplingDiscret. Appl. Math., 108
-
R. Fletcher (2000)
Stable reduced Hessian updates for indefinite quadratic programmingMathematical Programming, 87
-
I. Bomze, Mirjam Dür, E. Klerk, Kees Roos, A. Quist, T. Terlaky (2000)
On Copositive Programming and Standard Quadratic Optimization ProblemsJournal of Global Optimization, 18
-
Jon Lee, J. Williams (2003)
A linear integer programming bound for maximum-entropy samplingMathematical Programming, 94
-
P. Belotti, Jon Lee, Leo Liberti, F. Margot, A. Wächter (2009)
Branching and bounds tighteningtechniques for non-convex MINLPOptimization Methods and Software, 24
-
Hoai Thi, T. Dinh (2005)
The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 133
-
Jon Lee (2007)
In situ column generation for a cutting-stock problemComput. Oper. Res., 34
-
Mohit Tawarmalani, N. Sahinidis (2005)
A polyhedral branch-and-cut approach to global optimizationMathematical Programming, 103
-
A. Frieze, J. Yadegar (1983)
On the quadratic assignment problemDiscret. Appl. Math., 5
-
LTH An, PD Tao, LD Muu (1998)
A combined d.c. optimization—ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems. Semidefinite programming and interior-point approaches for combinatorial optimization problems (Toronto, ON, 1996)J Comb Optim, 2
-
(1998)
University of Dundee Numerical Analysis Report NA-181 -
A. Atkinson, P. Hackl, W. Müller (2001)
mODa 6 : advances in model-oriented design and analysis : proceedings of the 6th International Workshop on Model-Oriented Design and Analysis held in Puchberg/Schneeberg, Austria, June 25-29, 2001 -
T. Dinh, Hoai Thi (1996)
Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheresOper. Res. Lett., 19
-
P. Calamai, L. Vicente, J. Júdice (1993)
A new technique for generating quadratic programming test problemsMathematical Programming, 61
-
(2000)
Semidefinite programming in experimental design -
R.: N-fold integer programming -
A. Billionnet, S. Elloumi, Amélie Lambert (2014)
A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxationJournal of Combinatorial Optimization, 28
-
Xiaojin Zheng, Xiaoling Sun, Duan Li (2011)
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representationsJournal of Global Optimization, 50
-
Jieqiu Chen, S. Burer (2011)
Globally solving nonconvex quadratic programming problems via completely positive programmingMathematical Programming Computation, 4
-
Alan Hoffman, Jon Lee, J. Williams (2000)
New upper bounds for maximum-entropy sampling -
S. Bradley, Arnoldo Hax, T. Magnanti (1977)
Applied Mathematical Programming -
S. Burer, Jon Lee (2007)
Solving maximum-entropy sampling problems using factored masksMathematical Programming, 109
-
(2010)
50 Years of Integer Programming 1958-2008: The Early Years and State-of-the-Art Surveys -
C. Ko, Jon Lee, M. Queyranne (1995)
An Exact Algorithm for Maximum Entropy SamplingOper. Res., 43
-
Anureet Saxena, Pierre Bonami, Jon Lee (2010)
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulationsMathematical Programming, 124
-
S. Burer, D. Vandenbussche (2008)
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxationsMathematical Programming, 113
-
Pierre Bonami, L. Biegler, Andrew Conn, Gérard Cornuéjols, I. Grossmann, Carl Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas Sawaya, A. Wächter (2005)
Ibm Research Report an Algorithmic Framework for Convex Mixed Integer Nonlinear Programs an Algorithmic Framework for Convex Mixed Integer Nonlinear Programs -
Claudia Ambrosio, Jon Lee, A. Wächter, Claudia 'ambrosio, Andreas Achter
Ibm Research Report an Algorithmic Framework for Minlp with Separable Non-convexity an Algorithmic Framework for Minlp with Separable Non-convexity -
K. Anstreicher, Jon Lee (2004)
A Masked Spectral Bound for Maximum-Entropy Sampling -
(1998)
Discussion on: ‘A state-space-model approach to optimal spatial sampling design based on entropy -
K. Anstreicher, M. Fampa, Jon Lee, J. Williams (1996)
Continuous Relaxations for Constrained Maximum-Entropy Sampling -
Anureet Saxena, Pierre Bonami, Jon Lee (2011)
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulationsMathematical Programming, 130
-
S. Burer, Anureet Saxena (2012)
The MILP Road to MIQCP -
I. Bomze, M. Locatelli (2004)
Undominated d.c. Decompositions of Quadratic Functions and Applications to Branch-and-Bound ApproachesComputational Optimization and Applications, 28
-
F. Alizadeh (1995)
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial OptimizationSIAM J. Optim., 5
-
Jon Lee (2001)
Maximum entropy sampling -
C. Adjiman, I. Androulakis, C. Floudas (1998)
A global optimization method, αBB, for general twice-differentiable constrained NLPs—II. Implementation and computational resultsComputers & Chemical Engineering, 22
-
Hoai Thi, T. Dinh, L. Muu (1998)
A Combined D.C. Optimization—Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming ProblemsJournal of Combinatorial Optimization, 2
-
CS Adjiman, S Dallwig, CA Floudas, A Neumaier (1998)
A global optimization method, $$\alpha $$ α BB, for general twice-differentiable constrained NLPs—II. Implementation and computational resultsComput Chem Eng, 22
-
coin-or.org/Couenne -
F. Rendl, G. Rinaldi, Angelika Wiegele (2009)
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxationsMathematical Programming, 121
-
R. Horst, N. Thoai (1999)
DC Programming: OverviewJournal of Optimization Theory and Applications, 103
-
A. Bucchianico, H. Läuter, H. Wynn (2004)
MODA 7 - advances in model-oriented design and analysis : proceedings of the 7th international workshop on Model-oriented design and analysis, held in Heeze, The Netherlands, June 14-18, 2004 -
K. Anstreicher, M. Fampa, Jon Lee, J. Williams (1999)
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problemsMathematical Programming, 85
-
C. Floudas (2009)
Mixed Integer Nonlinear Programming -
Hanbiao Wang, K. Yao, G. Pottie, D. Estrin (2004)
Entropy-based sensor selection heuristic for target localizationThird International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004
-
Pierre Bonami, Jon Lee, S. Leyffer, A. Wächter (2013)
On branching rules for convex mixed-integer nonlinear optimizationACM J. Exp. Algorithmics, 18
-
Jon Lee (1998)
Constrained Maximum-Entropy SamplingOper. Res., 46
- Publisher
- Springer Journals
- Copyright
- Copyright © 2016 by EURO - The Association of European Operational Research Societies
- Subject
- Business and Management; Operations Research/Decision Theory; Operations Management; Operations Research, Management Science; Optimization
- ISSN
- 2192-4406
- eISSN
- 2192-4414
- DOI
- 10.1007/s13675-016-0079-6
- Publisher site
- See Article on Publisher Site
Abstract
We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function. Our solution approach consists of applying a spatial branch-and-bound algorithm, exploiting convexity as much as possible, not only convexity in the constraints, but also extracted from the indefinite-quadratic. A preprocessing stage is proposed to split the indefinite-quadratic into a difference of convex quadratic functions, leading to a more efficient spatial branch-and-bound focused on the isolated non-convexity. We investigate several natural possibilities for splitting an indefinite quadratic at the preprocessing stage, and prove the equivalence of some of them. Through computational experiments with our new solver iquad, we analyze how the splitting strategies affect the performance of our algorithm, and find guidelines for choosing amongst them.
Journal
EURO Journal on Computational Optimization – Springer Journals
Published: Dec 21, 2016