zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems. (English) Zbl 1087.65061
For solving nonconvex quadratic programming (QP) problems by the branch-and-reduce approach a new lower approximate linear function of the quadratic function over an $n$-rectangle is derived to calculate a lower bound on the global optimal value of the original problem over a rectangle which is necessary to develop the branch-and-bound algorithm. Thereafter a new simple rectangle partioning method is used and some ways for reducing and deleting subrectangles are described to accelerate the convergence of the proposed method.The convergence of the new branch-and-reduce algorithm to a global optimal solution of the original QP problems is proved. Executed numerical experiments show that the proposed algorithm is promising.

65K05Mathematical programming (numerical methods)
90C20Quadratic programming
90C57Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C26Nonconvex programming, global optimization
Full Text: DOI
[1] Reiner, H.; Pardlos, P. M.; Thoai, N. V.: Introduction to global optimization. (1995) · Zbl 0836.90134
[2] Bomze, I.; Danninger, G.: A finite algorithm for solving general quadratic problem. Journal of global optimization 4, 1-16 (1994) · Zbl 0809.90107
[3] Geoffrion, A.: Generalized benders’decompositions. Journal of optimization, theory and its applications 10, 237-260 (1972) · Zbl 0229.90024
[4] Barrientos, O.; Correa, R.: An algorithm for global minimization of linearly constrained quadratic functions. Journal of global optimization 16, 77-93 (2000) · Zbl 0958.90066
[5] B. Kalantrai, Large scale concave quadratic minimization and extensions, Ph.D. thesis, Computer Sci. Dept., University of Minnesota, 1984.
[6] Kough, P. F.: The indefinite quadratic programming problem. Operations research 27, No. 3, 516-533 (1979) · Zbl 0409.90070
[7] Muller, R. K.: A method for solving the indefinite quadratic programming A program. Management science 16, No. 5, 333-339 (1979)
[8] Murty, K. G.; Kabadi, S. N.: Some NP-complete in quadratic and nonlinear programming. Mathematical programming 39, 117-129 (1987) · Zbl 0637.90078
[9] Pardalos, P. M.; Glick, J. H.; Rosen, J. B.: Global minimization of indefinite quadratic problems. Computing 39, 281-291 (1987) · Zbl 0627.65072
[10] Pardalos, P. M.; Schnitger, G.: Checking local optimality in constrained quadratic programming is NP-hard. Orletters 7, 33-35 (1988) · Zbl 0644.90067
[11] Philkips, A. T.; Rosen, J. B.: A parallel algorithm for constrained concave quadratic global minimization. Mathematical programming 42, 421-488 (1998)
[12] Rosen, J. B.; Pardalos, P. M.: Global minimization of large scale constrained concave quadratic problems by separable programming. Mathematical programming 34, 163-174 (1986) · Zbl 0597.90066
[13] Rutenberg, D. P.; Shaftel, T. L.: Product design sub-assemblies for multiple markets. Management science 18, B220-B231 (1971)
[14] Filar, J. A.; Schultz, T. A.: Bilinear programming and structured stochastic games. Journal of optimization theory and applications 53, 85-104 (1987) · Zbl 0593.90091
[15] Lodiwick, W. A.: Preprocessing nonlinear functional constraints with applications to the pooling problem. ORSA journal of computing 4, 119-131 (1992) · Zbl 0770.90067
[16] Pardalos, P. M.; Rosen, J. B.: Constrained global optimization: algorithms and applications. Lecture notes in computer science 268 (1987) · Zbl 0638.90064
[17] Ryoo, H. S.; Sahinidis, N. V.: Global optimization of multiplicative programs. Journal of global optimization 26, 318-387 (2003) · Zbl 1052.90091
[18] H. Tuy, Global minimization of the difference of two convex functions, in: Select Topics in Operations Research and Mathematical Economics, Lecture Notes Econ. Math. Syst., vol. 226, 1983, pp. 98-118.
[19] Shetman, J. P.; Sahinidis, N. V.: A finite algorithm for global minimization of separable concave programs. State of the art in global optimization: computational methods and applications, 303-340 (1996)