Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm

We propose an algorithm for constrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed Bernstein branch and prune algorithm is based on the Bernstein polynomial approach. We introduce several new features in this proposed algorithm to ma...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization Vol. 49; no. 2; pp. 185 - 212
Main Authors: Nataraj, P. S. V., Arounassalame, M.
Format: Journal Article
Language:English
Published: Boston Springer US 01.02.2011
Springer Nature B.V
Subjects:
ISSN:0925-5001, 1573-2916
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We propose an algorithm for constrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed Bernstein branch and prune algorithm is based on the Bernstein polynomial approach. We introduce several new features in this proposed algorithm to make the algorithm more efficient. We first present the Bernstein box consistency and Bernstein hull consistency algorithms to prune the search regions. We then give Bernstein contraction algorithm to avoid the computation of Bernstein coefficients after the pruning operation. We also include a new Bernstein cut-off test based on the vertex property of the Bernstein coefficients. The performance of the proposed algorithm is numerically tested on 13 benchmark problems. The results of the tests show the proposed algorithm to be overall considerably superior to existing method in terms of the chosen performance metrics.
AbstractList We propose an algorithm for constrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed Bernstein branch and prune algorithm is based on the Bernstein polynomial approach. We introduce several new features in this proposed algorithm to make the algorithm more efficient. We first present the Bernstein box consistency and Bernstein hull consistency algorithms to prune the search regions. We then give Bernstein contraction algorithm to avoid the computation of Bernstein coefficients after the pruning operation. We also include a new Bernstein cut-off test based on the vertex property of the Bernstein coefficients. The performance of the proposed algorithm is numerically tested on 13 benchmark problems. The results of the tests show the proposed algorithm to be overall considerably superior to existing method in terms of the chosen performance metrics.[PUBLICATION ABSTRACT]
We propose an algorithm for constrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed Bernstein branch and prune algorithm is based on the Bernstein polynomial approach. We introduce several new features in this proposed algorithm to make the algorithm more efficient. We first present the Bernstein box consistency and Bernstein hull consistency algorithms to prune the search regions. We then give Bernstein contraction algorithm to avoid the computation of Bernstein coefficients after the pruning operation. We also include a new Bernstein cut-off test based on the vertex property of the Bernstein coefficients. The performance of the proposed algorithm is numerically tested on 13 benchmark problems. The results of the tests show the proposed algorithm to be overall considerably superior to existing method in terms of the chosen performance metrics.
Author Nataraj, P. S. V.
Arounassalame, M.
Author_xml – sequence: 1
  givenname: P. S. V.
  surname: Nataraj
  fullname: Nataraj, P. S. V.
  email: nataraj@sc.iitb.ac.in, nataraj@ee.iitb.ac.in
  organization: Systems and Control Engineering, Indian Institute of Technology Bombay
– sequence: 2
  givenname: M.
  surname: Arounassalame
  fullname: Arounassalame, M.
  organization: Systems and Control Engineering, Indian Institute of Technology Bombay
BookMark eNp9kMtKxDAUhoOM4Dj6AO6C--pJOm2TpQ7eYMCNrkOapp0MbVKTVBif3owjCIKuzuL837l8p2hmndUIXRC4IgDVdSDAOMsAeMaXrMjgCM1JUeUZ5aScoTlwWmQFADlBpyFsIQVZQeeoXTkbopfG6gZ3vatlj90YzWA-ZDTOYtfiYeqjeZfeyKjx6PqddYORfcBTMLbDt9qnEdpYXHtp1QZL2-DRT1Zj2XfOm7gZztBxmwh9_l0X6PX-7mX1mK2fH55WN-tM5aSIGed5DRw0B5m-yDkAg6aEsl4WFSUtgxZqUhKV-ozVLVVENSxXSoKsdM1UvkCXh7mjd2-TDlFs3eRtWikYpXlFWFqxQNUhpLwLwetWKBO_vt2L6AUBsXcqDk5FUiX2TgUkkvwiR28G6Xf_MvTAhJS1nfY_J_0NfQLfgI0H
CitedBy_id crossref_primary_10_1109_TRO_2020_3036617
crossref_primary_10_1007_s13198_017_0673_x
crossref_primary_10_1007_s11633_012_0619_3
crossref_primary_10_1007_s10898_012_0024_z
crossref_primary_10_1007_s41066_018_0134_1
crossref_primary_10_1007_s13198_019_00922_6
crossref_primary_10_1007_s10898_015_0358_4
crossref_primary_10_1016_j_amc_2017_07_026
crossref_primary_10_1007_s11786_014_0198_5
crossref_primary_10_1016_j_cam_2020_113377
crossref_primary_10_1007_s13198_017_0639_z
crossref_primary_10_1080_0305215X_2018_1521399
crossref_primary_10_1016_j_jprocont_2011_12_006
crossref_primary_10_1016_j_amc_2014_01_114
crossref_primary_10_1016_j_cagd_2012_03_001
crossref_primary_10_1016_j_amc_2018_08_049
crossref_primary_10_1007_s40314_015_0224_5
Cites_doi 10.1007/978-1-4757-3040-1
10.1007/BF01097060
10.1007/978-94-017-1247-7_7
10.1023/A:1014750702474
10.1109/9.661615
10.1007/s10898-004-5906-2
10.1016/S0377-2217(96)00310-4
10.1007/3-540-53032-0
10.1007/978-1-4615-2025-2
10.1007/978-1-4757-2495-0
10.1145/1132973.1132980
10.1023/B:REOM.0000003995.08805.2a
10.1016/j.cam.2005.08.037
10.1016/0098-1354(94)E0032-I
10.1007/978-1-4471-0249-6
10.1007/s11633-007-0342-7
ContentType Journal Article
Copyright Springer Science+Business Media, LLC. 2009
Springer Science+Business Media, LLC. 2011
Copyright_xml – notice: Springer Science+Business Media, LLC. 2009
– notice: Springer Science+Business Media, LLC. 2011
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
88I
8AL
8AO
8FD
8FE
8FG
8FK
8FL
8G5
ABJCF
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
GUQSH
HCIFZ
JQ2
K60
K6~
K7-
L.-
L.0
L6V
L7M
L~C
L~D
M0C
M0N
M2O
M2P
M7S
MBDVC
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
Q9U
DOI 10.1007/s10898-009-9485-0
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection (ProQuest)
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Science Database (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
Research Library (Alumni)
ProQuest MSED
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest Technology Collection
ProQuest One
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
ProQuest Research Library
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Research Library
Science Database
Engineering Database
Research Library (Corporate)
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
ProQuest Central Basic
DatabaseTitle CrossRef
ProQuest Business Collection (Alumni Edition)
Research Library Prep
Computer Science Database
ProQuest Central Student
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest One Applied & Life Sciences
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
Engineering Database
ProQuest Science Journals (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest Business Collection
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest One Academic (New)
ABI/INFORM Global (Corporate)
ProQuest One Business
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Central (Alumni Edition)
ProQuest One Community College
Research Library (Alumni Edition)
ProQuest Pharma Collection
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Engineering Collection
ABI/INFORM Professional Standard
ProQuest Central Korea
ProQuest Research Library
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Science Journals
ProQuest Computing (Alumni Edition)
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
Materials Science & Engineering Collection
ProQuest One Business (Alumni)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList ProQuest Business Collection (Alumni Edition)

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Mathematics
Sciences (General)
Computer Science
EISSN 1573-2916
EndPage 212
ExternalDocumentID 2229678971
10_1007_s10898_009_9485_0
Genre Feature
GroupedDBID -52
-57
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29K
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
78A
7WY
88I
8AO
8FE
8FG
8FL
8G5
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYOK
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTAH
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACGOD
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AI.
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYQZM
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
D-I
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GUQSH
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IAO
IHE
IJ-
IKXTQ
ITC
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M0C
M0N
M2O
M2P
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9M
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SBE
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VH1
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7X
Z7Z
Z81
Z83
Z86
Z88
Z8M
Z8N
Z8T
Z8U
Z8W
Z92
ZMTXR
ZWQNP
ZY4
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L.0
L7M
L~C
L~D
MBDVC
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c315t-993b090e90a948390080d606b45721f80f0b161c90a88bf2c1cd83cca0a7eb8c3
IEDL.DBID RSV
ISICitedReferencesCount 20
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000286917900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0925-5001
IngestDate Tue Nov 04 19:08:45 EST 2025
Sat Nov 29 01:59:28 EST 2025
Tue Nov 18 21:36:17 EST 2025
Fri Feb 21 02:42:32 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Pruning
Constrained global optimization
Subdivision
Bernstein polynomials
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c315t-993b090e90a948390080d606b45721f80f0b161c90a88bf2c1cd83cca0a7eb8c3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 822371899
PQPubID 29930
PageCount 28
ParticipantIDs proquest_journals_822371899
crossref_citationtrail_10_1007_s10898_009_9485_0
crossref_primary_10_1007_s10898_009_9485_0
springer_journals_10_1007_s10898_009_9485_0
PublicationCentury 2000
PublicationDate 20110200
2011-2-00
20110201
PublicationDateYYYYMMDD 2011-02-01
PublicationDate_xml – month: 2
  year: 2011
  text: 20110200
PublicationDecade 2010
PublicationPlace Boston
PublicationPlace_xml – name: Boston
– name: Dordrecht
PublicationSubtitle An International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering
PublicationTitle Journal of global optimization
PublicationTitleAbbrev J Glob Optim
PublicationYear 2011
Publisher Springer US
Springer Nature B.V
Publisher_xml – name: Springer US
– name: Springer Nature B.V
References GranvilliersL.BenhamouF.Algorithm 852: real paver: an interval solver using constraint satisfaction techniquesACM Trans. Math. Softw.200632113815610.1145/1132973.1132980
Hedar, A-R., Ahmed, A.: Studies on Metaheuristics for continuous global optimization problems. Ph.D. dissertation, Kyoto University, Kyoto, Japan (2004)
RatzD.CsendesT.On the selection of subdivision directions in interval Branch-and-Bound methods for global optimizationJ. Global Optim.19957218320710.1007/BF01097060
JaulinL.KiefferM.DidritO.Applied Interval Analysis2001LondonSpringer
Floudas, C.A., Pardalos, P.M.: A Collection of Test Problems for Constrained Global optimization algorithms. Springer, London (1990)
LebbahY.MichelC.RueherM.An efficient and safe framework for solving optimization problemsJ. Comput. Appl. Math.200719937237710.1016/j.cam.2005.08.037
HansenE.WalsterG.W.Global Optimization Using Interval Analysis2004New YorkMarcel Dekker Inc
VaidyanathanR.Ed-halwagiM.Global optimization of nonconvex nonlinear programs via interval analysisComput. Chem. Eng.1994181088989710.1016/0098-1354(94)E0032-I
GranvilliersL.On the combination of interval constraint solversReliab. Comput.2001746748310.1023/A:1014750702474
Stahl. V.: Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. Ph.D. dissertation, University of linz (2005)
Shaswathi Ray, S.: A new approach to range computation of polynomials using the Bernstein form. Ph.D. dissertation, Indian Institute of Technology Bombay, Mumbai, India (2006)
Rump, S.M.: INTLAB-Interval Laboratory, Developments in Reliable Computing. Kluwer, Dordrecht, pp. 77–104 (1999)
MATLAB Reference Guide.: MATLAB version 6.1, The Mathworks Inc., Natick, MA (2001)
Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.: Revising hull and box consistency. In: Proceedings of the sixteenth international conference on logic programming (ICLP’99), The MIT Press, Las Cruces, USA, pp. 230–244 (1999)
Henrion, D., Lasserre J.B.: GloptiPoly: global optimization with polynomials with MATLAB and SeDuMi, version 2.3.0 (2006)
VenkataramanR.Applied Optimization with MATLAB Programming2001LondonWiley
NatarajP.S.V.KotechaK.An improved interval global optimization algorithm using higher order inclusion function formsJ. Global Optim.2005321356310.1007/s10898-004-5906-2
NatarajP.S.V.ArounassalameM.A new subdivision algorithm for bernstein polynomial approach to global optimizationInt. J. Automat. Comput.20074434235210.1007/s11633-007-0342-7
LiH.L.ChangC.T.An approximate approach of global optimization for polynomial programming problemsEur J Oper Res199810762563210.1016/S0377-2217(96)00310-4
GarloffJ.The Bernstein algorithmInterval Comput.19932154168
KearfottR.B.Rigorous Global Search: Continuous problems1996DordrechtKluwer
GarloffJ.MunroN.Solving strict polynomial inequalities by Bernstein expansion. The use of symbolic methods in control system analysis and designIEE Control Engineering Series, vol. 561999BerlinSpringer339352
ZettlerM.GarloffJ.Robustness analysis of polynomials with polynomial parameter dependency using bernstein expansionIEEE Trans. Autom. Contr.199843542543110.1109/9.661615
FloudasC.A.PardalosP.M.Handbook of Test problems in Local and Global Optimization1999The NetherlandsKluwer
GarloffJ.NickelKConvergent bounds for range of multivariate polynomials. Interval mathematicsLecture Notes in Computer Science, vol. 2121985BerlinSpringer3756
Global Library, Avaiable from http://www.gamsworld.org/global/globallib.
RatschekH.RokneJ.Computer Methods for the Range of Functions1984ChichesterEllis Horwood Limited Publishers
HorstR.PardalosP.M.Handbook of Global Optimization1995The NetherlandsKluwer
Malan, S., Milanese, M., Tarangna, M., Garloff, J.: B3 algorithm for robust performances analysis in presence of mixed parametric and dynamic perturbations. In: Proceedings of 31st Conference on Decision and Control, Tucson, Arizona, pp. 128–133 (1992)
NatarajP.S.V.KotechaK.Global optimization with higher order inclusion function forms part 1: a combined Taylor–Bernstein formReliab. Comput.2004101274410.1023/B:REOM.0000003995.08805.2a
L. Jaulin (9485_CR14) 2001
H.L. Li (9485_CR17) 1998; 107
L. Granvilliers (9485_CR10) 2006; 32
J. Garloff (9485_CR6) 1993; 2
9485_CR8
L. Granvilliers (9485_CR9) 2001; 7
9485_CR26
9485_CR27
R. Vaidyanathan (9485_CR28) 1994; 18
J. Garloff (9485_CR7) 1999
P.S.V. Nataraj (9485_CR21) 2004; 10
9485_CR25
P.S.V. Nataraj (9485_CR22) 2007; 4
R. Horst (9485_CR13) 1995
R. Venkataraman (9485_CR29) 2001
R.B. Kearfott (9485_CR15) 1996
D. Ratz (9485_CR24) 1995; 7
E. Hansen (9485_CR11) 2004
J. Garloff (9485_CR5) 1985
M. Zettler (9485_CR30) 1998; 43
9485_CR3
P.S.V. Nataraj (9485_CR20) 2005; 32
9485_CR2
H. Ratschek (9485_CR23) 1984
C.A. Floudas (9485_CR4) 1999
9485_CR12
Y. Lebbah (9485_CR16) 2007; 199
9485_CR1
9485_CR19
9485_CR18
References_xml – reference: FloudasC.A.PardalosP.M.Handbook of Test problems in Local and Global Optimization1999The NetherlandsKluwer
– reference: Global Library, Avaiable from http://www.gamsworld.org/global/globallib.
– reference: KearfottR.B.Rigorous Global Search: Continuous problems1996DordrechtKluwer
– reference: Hedar, A-R., Ahmed, A.: Studies on Metaheuristics for continuous global optimization problems. Ph.D. dissertation, Kyoto University, Kyoto, Japan (2004)
– reference: NatarajP.S.V.ArounassalameM.A new subdivision algorithm for bernstein polynomial approach to global optimizationInt. J. Automat. Comput.20074434235210.1007/s11633-007-0342-7
– reference: Stahl. V.: Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. Ph.D. dissertation, University of linz (2005)
– reference: Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.: Revising hull and box consistency. In: Proceedings of the sixteenth international conference on logic programming (ICLP’99), The MIT Press, Las Cruces, USA, pp. 230–244 (1999)
– reference: GarloffJ.NickelKConvergent bounds for range of multivariate polynomials. Interval mathematicsLecture Notes in Computer Science, vol. 2121985BerlinSpringer3756
– reference: HorstR.PardalosP.M.Handbook of Global Optimization1995The NetherlandsKluwer
– reference: VenkataramanR.Applied Optimization with MATLAB Programming2001LondonWiley
– reference: Henrion, D., Lasserre J.B.: GloptiPoly: global optimization with polynomials with MATLAB and SeDuMi, version 2.3.0 (2006)
– reference: LebbahY.MichelC.RueherM.An efficient and safe framework for solving optimization problemsJ. Comput. Appl. Math.200719937237710.1016/j.cam.2005.08.037
– reference: Floudas, C.A., Pardalos, P.M.: A Collection of Test Problems for Constrained Global optimization algorithms. Springer, London (1990)
– reference: GarloffJ.MunroN.Solving strict polynomial inequalities by Bernstein expansion. The use of symbolic methods in control system analysis and designIEE Control Engineering Series, vol. 561999BerlinSpringer339352
– reference: HansenE.WalsterG.W.Global Optimization Using Interval Analysis2004New YorkMarcel Dekker Inc
– reference: RatschekH.RokneJ.Computer Methods for the Range of Functions1984ChichesterEllis Horwood Limited Publishers
– reference: GranvilliersL.BenhamouF.Algorithm 852: real paver: an interval solver using constraint satisfaction techniquesACM Trans. Math. Softw.200632113815610.1145/1132973.1132980
– reference: ZettlerM.GarloffJ.Robustness analysis of polynomials with polynomial parameter dependency using bernstein expansionIEEE Trans. Autom. Contr.199843542543110.1109/9.661615
– reference: MATLAB Reference Guide.: MATLAB version 6.1, The Mathworks Inc., Natick, MA (2001)
– reference: NatarajP.S.V.KotechaK.An improved interval global optimization algorithm using higher order inclusion function formsJ. Global Optim.2005321356310.1007/s10898-004-5906-2
– reference: GranvilliersL.On the combination of interval constraint solversReliab. Comput.2001746748310.1023/A:1014750702474
– reference: Malan, S., Milanese, M., Tarangna, M., Garloff, J.: B3 algorithm for robust performances analysis in presence of mixed parametric and dynamic perturbations. In: Proceedings of 31st Conference on Decision and Control, Tucson, Arizona, pp. 128–133 (1992)
– reference: RatzD.CsendesT.On the selection of subdivision directions in interval Branch-and-Bound methods for global optimizationJ. Global Optim.19957218320710.1007/BF01097060
– reference: Rump, S.M.: INTLAB-Interval Laboratory, Developments in Reliable Computing. Kluwer, Dordrecht, pp. 77–104 (1999)
– reference: JaulinL.KiefferM.DidritO.Applied Interval Analysis2001LondonSpringer
– reference: NatarajP.S.V.KotechaK.Global optimization with higher order inclusion function forms part 1: a combined Taylor–Bernstein formReliab. Comput.2004101274410.1023/B:REOM.0000003995.08805.2a
– reference: LiH.L.ChangC.T.An approximate approach of global optimization for polynomial programming problemsEur J Oper Res199810762563210.1016/S0377-2217(96)00310-4
– reference: GarloffJ.The Bernstein algorithmInterval Comput.19932154168
– reference: Shaswathi Ray, S.: A new approach to range computation of polynomials using the Bernstein form. Ph.D. dissertation, Indian Institute of Technology Bombay, Mumbai, India (2006)
– reference: VaidyanathanR.Ed-halwagiM.Global optimization of nonconvex nonlinear programs via interval analysisComput. Chem. Eng.1994181088989710.1016/0098-1354(94)E0032-I
– volume-title: Handbook of Test problems in Local and Global Optimization
  year: 1999
  ident: 9485_CR4
  doi: 10.1007/978-1-4757-3040-1
– ident: 9485_CR27
– volume: 7
  start-page: 183
  issue: 2
  year: 1995
  ident: 9485_CR24
  publication-title: J. Global Optim.
  doi: 10.1007/BF01097060
– ident: 9485_CR1
– volume-title: Applied Optimization with MATLAB Programming
  year: 2001
  ident: 9485_CR29
– start-page: 339
  volume-title: IEE Control Engineering Series, vol. 56
  year: 1999
  ident: 9485_CR7
– start-page: 37
  volume-title: Lecture Notes in Computer Science, vol. 212
  year: 1985
  ident: 9485_CR5
– volume-title: Computer Methods for the Range of Functions
  year: 1984
  ident: 9485_CR23
– ident: 9485_CR25
  doi: 10.1007/978-94-017-1247-7_7
– volume: 7
  start-page: 467
  year: 2001
  ident: 9485_CR9
  publication-title: Reliab. Comput.
  doi: 10.1023/A:1014750702474
– volume: 43
  start-page: 425
  issue: 5
  year: 1998
  ident: 9485_CR30
  publication-title: IEEE Trans. Autom. Contr.
  doi: 10.1109/9.661615
– volume: 32
  start-page: 35
  issue: 1
  year: 2005
  ident: 9485_CR20
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-004-5906-2
– volume: 107
  start-page: 625
  year: 1998
  ident: 9485_CR17
  publication-title: Eur J Oper Res
  doi: 10.1016/S0377-2217(96)00310-4
– volume-title: Global Optimization Using Interval Analysis
  year: 2004
  ident: 9485_CR11
– ident: 9485_CR3
  doi: 10.1007/3-540-53032-0
– volume-title: Handbook of Global Optimization
  year: 1995
  ident: 9485_CR13
  doi: 10.1007/978-1-4615-2025-2
– ident: 9485_CR19
– volume-title: Rigorous Global Search: Continuous problems
  year: 1996
  ident: 9485_CR15
  doi: 10.1007/978-1-4757-2495-0
– ident: 9485_CR26
– volume: 32
  start-page: 138
  issue: 1
  year: 2006
  ident: 9485_CR10
  publication-title: ACM Trans. Math. Softw.
  doi: 10.1145/1132973.1132980
– ident: 9485_CR2
– volume: 10
  start-page: 27
  issue: 1
  year: 2004
  ident: 9485_CR21
  publication-title: Reliab. Comput.
  doi: 10.1023/B:REOM.0000003995.08805.2a
– volume: 199
  start-page: 372
  year: 2007
  ident: 9485_CR16
  publication-title: J. Comput. Appl. Math.
  doi: 10.1016/j.cam.2005.08.037
– volume: 18
  start-page: 889
  issue: 10
  year: 1994
  ident: 9485_CR28
  publication-title: Comput. Chem. Eng.
  doi: 10.1016/0098-1354(94)E0032-I
– ident: 9485_CR8
– volume-title: Applied Interval Analysis
  year: 2001
  ident: 9485_CR14
  doi: 10.1007/978-1-4471-0249-6
– ident: 9485_CR12
– ident: 9485_CR18
– volume: 4
  start-page: 342
  issue: 4
  year: 2007
  ident: 9485_CR22
  publication-title: Int. J. Automat. Comput.
  doi: 10.1007/s11633-007-0342-7
– volume: 2
  start-page: 154
  year: 1993
  ident: 9485_CR6
  publication-title: Interval Comput.
SSID ssj0009852
Score 2.0285172
Snippet We propose an algorithm for constrained global optimization to tackle non-convex nonlinear multivariate polynomial programming problems. The proposed Bernstein...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 185
SubjectTerms Algorithms
Computer Science
Mathematical programming
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Polynomials
Propagation
Real Functions
Studies
SummonAdditionalLinks – databaseName: Science Database
  dbid: M2P
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LT8MwDLZgcIADb8QYoBw48FBEtrZrckKAmLiAOIDErWrSFCZt7dhL4t9jt-kGSHDhnNZKa8f5nNifAY5TkYQIvJs80NJyPwg016GNcbmrQLaNsUKLotlE-PAgX17Uo8vNGbm0ysonFo46yQ2dkV_gRuahH1XqcvDOqWkUXa66DhqLsITApkkZXfetxznnriwa7gjVCniA7ri61Cwr5yTVlgnFiR6Fi-_b0hxr_rgeLXadzvo_57sBaw5usqvSPjZhwWZbsPqFhHALNt3yHrETx0F9ug0pNfIs2kfYhJWkISxH79J3ZZssT1mRizjFWBvhKhvkvQ-qcEZrZpRL_8qu7RBF2G7GNDXveGNxlrDBcJJZFvdeca7jt_4OPHdun27uuGvJwI3XDMYc0YwWSlglYvxvniLAmWAMpP0AQ8lUilRoxJAGx6XUacs0TSI9tBIRh1ZL4-1CLcszuwdMhyFqyE-IHtH3Q0-lbRJBIZBnfWvqICqNRMbxldN396I50zIpMUIlRqTESNThbPbKoCTr-OvhRqW4yK3bUTTTWh3OK83PR3-Vtf-nrAaslCfRlARzALXxcGIPYdlMx93R8Kiw2U841PHB
  priority: 102
  providerName: ProQuest
Title Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm
URI https://link.springer.com/article/10.1007/s10898-009-9485-0
https://www.proquest.com/docview/822371899
Volume 49
WOSCitedRecordID wos000286917900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: 7WY
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM global
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M0C
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: K7-
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Engineering Database
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M7S
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest advanced technologies & aerospace journals
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: P5Z
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: BENPR
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Research Library
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M2O
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/pqrl
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Science Database
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: M2P
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/sciencejournals
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLink Journals
  customDbUrl:
  eissn: 1573-2916
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0009852
  issn: 0925-5001
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dT9swED9tsIftYYxu0zq2yg97ACZLbhNj-3Eg0CREV_G9vUSx40ClklRJQdp_v7vUoQyNSfBykhXnFPt8vrvY9zuAL7nIFDrefS6t9jyW0nKrfIrqbqTecs4LK5piE2o41OfnZhTyuOv2tnt7JNns1HeS3TSlgwnDCdGEY5y-jNZOU72Gw6PTBdKubsrsCDOQXOIm3B5l_ovF38Zo4WHeOxRtbM3eypO-8g28Dq4l-zZfC6vwzBcdWGnLNrCgxR14dQeDEFsHt8CtdQdWQ6-arQdA6o23kFNVz6aWhM_YHEGElbjVXIUcTlbmrLmYeIOBN_qubFpOflO6My5tRhfrL9i2r5CFHxfMUiWPS5YWGZtW14Vn6eSirMazy6t3cLK3e7zznYf6DNxFfTnj6NpYYYQ3IsWxRoa8zwwDIhtLjCtzLXJh0aF0-Fxrmw9c32U6wiUjUuWtdtF7WCrKwn8AZpVCwcUZYSXGsYpMvkUsKB6KfOxdF0QrqMQF8HIa9yRZwC7TxCc48QlNfCK6sHn7ynSO3PG_zmut9JOgxHWCvlOEptuYLnxthb14-iCvj4_qvQYv57-p6YbMJ1iaVdf-M7xwN7NxXfXguTr72YPl7d3h6BBb-4ojPRA7RAc_Gjoiqo6QjuSvXqMMfwBECfrj
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9tAEB5RWolyAAJUDY-yh1Zqi1Zs_Ih3D6hqCwhEGuVAJW7Gu15DpMROExPEj-I_MuMHaSs1Nw492x5p19_Mzu7OfB_A-0TEASbeLe5rabnn-5rrwEbo7sqXbWOs0KIQmwi6XXl5qXoL8FD3wlBZZR0Ti0AdZ4bOyA9wIXMxjir1ZfSLk2gUXa7WCholKs7t_R3u2CaHZ0f4ez84zsnxxfdTXokKcOO2_JzjeqyFElaJSHmYHVDKFGMWrz0fN0OJFInQmAUZfC6lThzTMrF0cZwiCqyWxkW7L-ClR8RiVCno9GYcv7IQ-BHK8bmP4b--RC079ST1sgnFiY6Fiz-XwVlu-9d1bLHKnaz-Z_OzBitVOs2-lvhvwIJN12H5N5LFdWhU4WvCPlYc2582ICGh0kIew8asJEVhGUbPYdWWyrKEFbWW0wg9NLdslA3uqYMbvZVRr8A1-2bHaML2U6ZJnOSGRWnMRuPb1LJocI1zk98MN-Hns4z-DSymWWrfAtNBgIjwYqJ_9LzAVUmbTNAWz7WeNU0QNQJCU_Gx07gH4YxJmkATImhCAk0omvD56ZNRSUYy7-XtGihhFZcm4RNKmrBfI2329J-2tuba2oOl04sfnbBz1j3fhtflqTsV_OzAYj6-tbvwykzz_mT8rvAXBlfPDcBHfV9NHQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB7xEoIDlJdYKNSHVmqLLLybmNiHqiqPVRFotQcqoV5C7DiAtCTLbgDx0_h3zOTBlkpw48A5yUh2vnnZM98AfE5EHGDg3eTSKMd9KQ03gYtQ3bVUO9Y6YUQxbCLodNTpqe6OwUPdC0NllbVNLAx1nFk6I99GR-ahHdV6O6mqIrr77Z_9a04DpOiitZ6mUSLkyN3fYfY2_HG4j7_6S6vVPjjZ-82rAQPcek2Zc_TNRmjhtIi0j5EChU8xRvTGl5gYJUokwmBEZPG5UiZp2aaNlYdrFlHgjLIeyh2HyQBTTKom7Mq_I75fVQz7EboluURXUF-oll17ivrahOZEzcLFc5c4inP_u5otPF57_h3v1QeYq8Js9qvUiwUYc-kizP5DvrgIC5VZG7KvFff2tyVIaIBpMTbDxawkS2EZWtWrql2VZQkrajBvI9Tc3LF-1runzm7UYkY9BOds1w1QhLtMmaGhJRcsSmPWH9ykjkW9c9yb_OJqGf68yepXYCLNUrcKzAQBosOPiRbS9wNPJzskglI_z_nONkDUaAhtxdNO6-6FI4ZpAlCIAAoJQKFowPenT_olSclrL6_XoAkrezUMnxDTgK0adaOnL8pae1XWJ5hG3IXHh52jdZgpD-OpDugjTOSDG7cBU_Y2vxwONgvVYXD21vh7BMrVVgk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Constrained+global+optimization+of+multivariate+polynomials+using+Bernstein+branch+and+prune+algorithm&rft.jtitle=Journal+of+global+optimization&rft.au=Nataraj%2C+P.+S.+V.&rft.au=Arounassalame%2C+M.&rft.date=2011-02-01&rft.issn=0925-5001&rft.eissn=1573-2916&rft.volume=49&rft.issue=2&rft.spage=185&rft.epage=212&rft_id=info:doi/10.1007%2Fs10898-009-9485-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10898_009_9485_0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0925-5001&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0925-5001&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0925-5001&client=summon