메뉴 건너뛰기




Volumn 125, Issue 1, 2010, Pages 139-162

Global minimization using an Augmented Lagrangian method with variable lower-level constraints

Author keywords

Algorithms; Augmented Lagrangians; Deterministic global optimization; Nonlinear programming; Numerical experiments

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; NONLINEAR PROGRAMMING; QUADRATIC PROGRAMMING;

EID: 77956393153     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-009-0264-y     Document Type: Article
Times cited : (112)

References (55)
  • 2
    • 0032552250 scopus 로고    scopus 로고
    • A global optimization method, αbB, for general twice-differentiable constrained NLPs. I. Theoretical Advances
    • 10.1016/S0098-1354(98)00027-1
    • C.S. Adjiman S. Dallwig C.A. Floudas A. Neumaier 1998 A global optimization method, αBB, for general twice-differentiable constrained NLPs. I. Theoretical Advances Comput. Chem. Eng. 22 1137 1158 10.1016/S0098-1354(98)00027-1
    • (1998) Comput. Chem. Eng. , vol.22 , pp. 1137-1158
    • Adjiman, C.S.1    Dallwig, S.2    Floudas, C.A.3    Neumaier, A.4
  • 3
    • 0032552252 scopus 로고    scopus 로고
    • A global optimization method, αbB, for general twice-differentiable constrained NLPs. II. Implementation and computational results
    • 10.1016/S0098-1354(98)00218-X
    • C.S. Adjiman I.P. Androulakis C.A. Floudas 1998 A global optimization method, αBB, for general twice-differentiable constrained NLPs. II. Implementation and computational results Comput. Chem. Eng. 22 1159 1179 10.1016/S0098-1354(98)00218-X
    • (1998) Comput. Chem. Eng. , vol.22 , pp. 1159-1179
    • Adjiman, C.S.1    Androulakis, I.P.2    Floudas, C.A.3
  • 4
    • 0034345414 scopus 로고    scopus 로고
    • On finitely terminating Branch-and-Bound algorithms for some global optimization problems
    • 0994.65068 10.1137/S105262349935178X 1777079
    • F.A. Al-Khayyal H.D. Sherali 2000 On finitely terminating Branch-and-Bound algorithms for some global optimization problems SIAM J. Optim. 10 1049 1057 0994.65068 10.1137/S105262349935178X 1777079
    • (2000) SIAM J. Optim. , vol.10 , pp. 1049-1057
    • Al-Khayyal, F.A.1    Sherali, H.D.2
  • 5
    • 17644381324 scopus 로고    scopus 로고
    • On the relation between the Constant Positive Linear Dependence condition and quasinormality constraint qualification
    • 1125.90058 10.1007/s10957-004-1861-9 2136506
    • R. Andreani J.M. Martínez M.L. Schuverdt 2005 On the relation between the Constant Positive Linear Dependence condition and quasinormality constraint qualification J. Optim. Theory Appl. 125 473 485 1125.90058 10.1007/s10957-004-1861-9 2136506
    • (2005) J. Optim. Theory Appl. , vol.125 , pp. 473-485
    • Andreani, R.1    Martínez, J.M.2    Schuverdt, M.L.3
  • 6
    • 45849133389 scopus 로고    scopus 로고
    • On Augmented Lagrangian methods with general lower-level constraints
    • 1151.49027 10.1137/060654797 2373302
    • R. Andreani E.G. Birgin J.M. Martínez M.L. Schuverdt 2007 On Augmented Lagrangian methods with general lower-level constraints SIAM J. Optim. 18 1286 1309 1151.49027 10.1137/060654797 2373302
    • (2007) SIAM J. Optim. , vol.18 , pp. 1286-1309
    • Andreani, R.1    Birgin, E.G.2    Martínez, J.M.3    Schuverdt, M.L.4
  • 7
    • 34347264176 scopus 로고    scopus 로고
    • Augmented Lagrangian methods under the Constant Positive Linear Dependence constraint qualification
    • 1163.90041 10.1007/s10107-006-0077-1 2322882
    • R. Andreani E.G. Birgin J.M. Martínez M.L. Schuverdt 2008 Augmented Lagrangian methods under the Constant Positive Linear Dependence constraint qualification Math. Program. 111 5 32 1163.90041 10.1007/s10107-006- 0077-1 2322882
    • (2008) Math. Program. , vol.111 , pp. 5-32
    • Andreani, R.1    Birgin, E.G.2    Martínez, J.M.3    Schuverdt, M.L.4
  • 9
    • 0001327501 scopus 로고
    • αbB: A global optimization method for general constrained nonconvex problems
    • 0846.90087 10.1007/BF01099647 1365800
    • I.P. Androulakis C.D. Maranas C.A. Floudas 1995 αBB: A global optimization method for general constrained nonconvex problems J. Glob. Optim. 7 337 363 0846.90087 10.1007/BF01099647 1365800
    • (1995) J. Glob. Optim. , vol.7 , pp. 337-363
    • Androulakis, I.P.1    Maranas, C.D.2    Floudas, C.A.3
  • 12
    • 18844418678 scopus 로고    scopus 로고
    • Numerical comparison of Augmented Lagrangian algorithms for nonconvex problems
    • 1101.90066 10.1007/s10589-005-1066-7 2143503
    • E.G. Birgin R. Castillo J.M. Martínez 2005 Numerical comparison of Augmented Lagrangian algorithms for nonconvex problems Comput. Optim. Appl. 31 31 56 1101.90066 10.1007/s10589-005-1066-7 2143503
    • (2005) Comput. Optim. Appl. , vol.31 , pp. 31-56
    • Birgin, E.G.1    Castillo, R.2    Martínez, J.M.3
  • 13
    • 77249083301 scopus 로고    scopus 로고
    • Global minimization using an Augmented Lagrangian method with variable lower-level constraints
    • Birgin, E.G., Floudas, C.A., Martínez, J.M.: Global minimization using an Augmented Lagrangian method with variable lower-level constraints. Technical Report MCDO121206 (see http://www.ime.usp.br/~egbirgin/ ). Department of Applied Mathematics, UNICAMP, Brazil (2006)
    • Technical Report MCDO121206 (See
    • Birgin, E.G.1
  • 14
    • 0036794059 scopus 로고    scopus 로고
    • Large-scale active-set box-constrained optimization method with spectral projected gradients
    • 1031.90012 10.1023/A:1019928808826 1931362
    • E.G. Birgin J.M. Martínez 2002 Large-scale active-set box-constrained optimization method with spectral projected gradients Comput. Optim. Appl. 23 101 125 1031.90012 10.1023/A:1019928808826 1931362
    • (2002) Comput. Optim. Appl. , vol.23 , pp. 101-125
    • Birgin, E.G.1    Martínez, J.M.2
  • 16
    • 28244496090 scopus 로고    scopus 로고
    • Benchmarking optimization software with performance profiles
    • 1049.90004 10.1007/s101070100263 1875515
    • E.D. Dolan J.J. Moré 2002 Benchmarking optimization software with performance profiles Math. Program. 91 201 213 1049.90004 10.1007/s101070100263 1875515
    • (2002) Math. Program. , vol.91 , pp. 201-213
    • Dolan, E.D.1    Moré, J.J.2
  • 18
  • 19
    • 0025625478 scopus 로고
    • A global optimization algorithm (GOP) for certain classes of nonconvex NLPs. I. Theory
    • 10.1016/0098-1354(90)80020-C
    • C.A. Floudas V. Visweeswaran 1990 A global optimization algorithm (GOP) for certain classes of nonconvex NLPs. I. Theory Comput. Chem. Eng. 14 1397 1417 10.1016/0098-1354(90)80020-C
    • (1990) Comput. Chem. Eng. , vol.14 , pp. 1397-1417
    • Floudas, C.A.1    Visweeswaran, V.2
  • 21
    • 0344960138 scopus 로고    scopus 로고
    • Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
    • 0983.74053 10.1023/A:1026537630859
    • D.Y. Gao 2000 Canonical dual transformation method and generalized triality theory in nonsmooth global optimization J. Glob. Optim. 17 127 160 0983.74053 10.1023/A:1026537630859
    • (2000) J. Glob. Optim. , vol.17 , pp. 127-160
    • Gao, D.Y.1
  • 22
    • 0344550323 scopus 로고    scopus 로고
    • Perfect duality theory and complete solutions to a class of global optimization problems, generalized triality theory in nonsmooth global optimization
    • 1040.49036 10.1080/02331930310001611501 2039234
    • D.Y. Gao 2003 Perfect duality theory and complete solutions to a class of global optimization problems, generalized triality theory in nonsmooth global optimization Optimization 52 467 493 1040.49036 10.1080/02331930310001611501 2039234
    • (2003) Optimization , vol.52 , pp. 467-493
    • Gao, D.Y.1
  • 23
    • 9244233832 scopus 로고    scopus 로고
    • Canonical duality theory and solutions to constrained nonconvex quadratic programming
    • 10.1023/B:JOGO.0000048034.94449.e3
    • D.Y. Gao 2004 Canonical duality theory and solutions to constrained nonconvex quadratic programming J. Glob. Optim. 29 337 399 10.1023/B:JOGO. 0000048034.94449.e3
    • (2004) J. Glob. Optim. , vol.29 , pp. 337-399
    • Gao, D.Y.1
  • 24
    • 33646896526 scopus 로고    scopus 로고
    • Complete solutions and extremality criteria to polynomial optimization problems
    • 1104.90038 10.1007/s10898-005-3068-5
    • D.Y. Gao 2006 Complete solutions and extremality criteria to polynomial optimization problems J. Glob. Optim. 35 131 143 1104.90038 10.1007/s10898-005- 3068-5
    • (2006) J. Glob. Optim. , vol.35 , pp. 131-143
    • Gao, D.Y.1
  • 25
    • 42649126195 scopus 로고    scopus 로고
    • Solutions and optimality to box constrained nonconvex minimization problems
    • D.Y. Gao 2007 Solutions and optimality to box constrained nonconvex minimization problems J. Ind. Manage. Optim. 3 1 12
    • (2007) J. Ind. Manage. Optim. , vol.3 , pp. 1-12
    • Gao, D.Y.1
  • 26
    • 0014604308 scopus 로고
    • Multiplier and gradient methods
    • 0174.20705 10.1007/BF00927673 271809
    • M.R. Hestenes 1969 Multiplier and gradient methods J. Optim. Theory Appl. 4 303 320 0174.20705 10.1007/BF00927673 271809
    • (1969) J. Optim. Theory Appl. , vol.4 , pp. 303-320
    • Hestenes, M.R.1
  • 28
    • 0028754553 scopus 로고
    • Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library
    • 0888.65057 10.1145/198429.198433
    • R.B. Kearfott M. Dawande K. Du C. Hu 1994 Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library ACM Trans. Math. Softw. 20 447 459 0888.65057 10.1145/198429.198433
    • (1994) ACM Trans. Math. Softw. , vol.20 , pp. 447-459
    • Kearfott, R.B.1    Dawande, M.2    Du, K.3    Hu, C.4
  • 29
    • 85040393756 scopus 로고    scopus 로고
    • Reduction constraints for the global optimization of NLPs
    • 1057.90043 10.1111/j.1475-3995.2004.00438.x 2037419
    • L. Liberti 2004 Reduction constraints for the global optimization of NLPs Int. Trans. Oper. Res. 11 33 41 1057.90043 10.1111/j.1475-3995.2004.00438.x 2037419
    • (2004) Int. Trans. Oper. Res. , vol.11 , pp. 33-41
    • Liberti, L.1
  • 30
    • 33747721378 scopus 로고    scopus 로고
    • An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms
    • 1131.90045 10.1007/s10898-006-9005-4 2260243
    • L. Liberti C.C. Pantelides 2006 An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms J. Glob. Optim. 36 161 189 1131.90045 10.1007/s10898-006-9005-4 2260243
    • (2006) J. Glob. Optim. , vol.36 , pp. 161-189
    • Liberti, L.1    Pantelides, C.C.2
  • 31
    • 52149102318 scopus 로고    scopus 로고
    • On the convergence of Augmented Lagrangian methods for constrained global optimization
    • 1162.90019 10.1137/060667086 2373298
    • H.Z. Luo X.L. Sun D. Li 2007 On the convergence of Augmented Lagrangian methods for constrained global optimization SIAM J. Optim. 18 1209 1230 1162.90019 10.1137/060667086 2373298
    • (2007) SIAM J. Optim. , vol.18 , pp. 1209-1230
    • Luo, H.Z.1    Sun, X.L.2    Li, D.3
  • 32
    • 0001203963 scopus 로고
    • Global minimum potencial energy conformations for small molecules
    • 0797.90114 10.1007/BF01096720 1265118
    • C.D. Maranas C.A. Floudas 1994 Global minimum potencial energy conformations for small molecules J. Glob. Optim. 4 135 170 0797.90114 10.1007/BF01096720 1265118
    • (1994) J. Glob. Optim. , vol.4 , pp. 135-170
    • Maranas, C.D.1    Floudas, C.A.2
  • 33
    • 25144488748 scopus 로고    scopus 로고
    • Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: Spline αbB underestimators
    • 1080.90059 10.1007/s10898-004-2704-9 2176134
    • C.A. Meyer C.A. Floudas 2005 Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline αBB underestimators J. Glob. Optim. 32 221 258 1080.90059 10.1007/s10898-004-2704-9 2176134
    • (2005) J. Glob. Optim. , vol.32 , pp. 221-258
    • Meyer, C.A.1    Floudas, C.A.2
  • 35
    • 2942655185 scopus 로고    scopus 로고
    • Complete search in continuous global optimization and constraints satisfaction
    • 10.1017/CBO9780511569975.004 2249148
    • A. Neumaier 2004 Complete search in continuous global optimization and constraints satisfaction Acta Numerica 13 271 369 10.1017/CBO9780511569975.004 2249148
    • (2004) Acta Numerica , vol.13 , pp. 271-369
    • Neumaier, A.1
  • 36
    • 21144454169 scopus 로고    scopus 로고
    • A comparison of complete global optimization solvers
    • 1099.90001 10.1007/s10107-005-0585-4 2146383
    • A. Neumaier O. Shcherbina W. Huyer T. Vinkó 2005 A comparison of complete global optimization solvers Math. Program. 103 335 356 1099.90001 10.1007/s10107-005-0585-4 2146383
    • (2005) Math. Program. , vol.103 , pp. 335-356
    • Neumaier, A.1    Shcherbina, O.2    Huyer, W.3    Vinkó, T.4
  • 37
    • 0036459440 scopus 로고    scopus 로고
    • An interior point algorithm for global optimal solutions and KKT points
    • 1109.90340 10.1080/10556780108805820 1892586
    • G. Pacelli M.C. Recchioni 2001 An interior point algorithm for global optimal solutions and KKT points Optim. Methods Softw. 15 225 256 1109.90340 10.1080/10556780108805820 1892586
    • (2001) Optim. Methods Softw. , vol.15 , pp. 225-256
    • Pacelli, G.1    Recchioni, M.C.2
  • 38
    • 0002380692 scopus 로고
    • A method for nonlinear constraints in minimization problems
    • R. Fletcher (eds). Academic Press New York
    • Powell M.J.D.: A method for nonlinear constraints in minimization problems. In: Fletcher, R.(eds) Optimization, pp. 283-298. Academic Press, New York (1969)
    • (1969) Optimization , pp. 283-298
    • Powell, M.J.D.1
  • 40
    • 0016059769 scopus 로고
    • Augmented Lagrange multiplier functions and duality in nonconvex programming
    • 0257.90046 10.1137/0312021 384163
    • R.T. Rockafellar 1974 Augmented Lagrange multiplier functions and duality in nonconvex programming SIAM J. Control Optim. 12 268 285 0257.90046 10.1137/0312021 384163
    • (1974) SIAM J. Control Optim. , vol.12 , pp. 268-285
    • Rockafellar, R.T.1
  • 41
    • 0000635160 scopus 로고    scopus 로고
    • A branch-and-reduce approach to global optimization
    • 0856.90103 10.1007/BF00138689 1376501
    • H.S. Ryoo N.V. Sahinidis 1996 A branch-and-reduce approach to global optimization J. Glob. Optim. 8 107 138 0856.90103 10.1007/BF00138689 1376501
    • (1996) J. Glob. Optim. , vol.8 , pp. 107-138
    • Ryoo, H.S.1    Sahinidis, N.V.2
  • 42
    • 0000318768 scopus 로고    scopus 로고
    • BARON: A general purpose global optimization software package
    • 0856.90104 10.1007/BF00138693 1376505
    • N.V. Sahinidis 1996 BARON: a general purpose global optimization software package J. Glob. Optim. 8 201 205 0856.90104 10.1007/BF00138693 1376505
    • (1996) J. Glob. Optim. , vol.8 , pp. 201-205
    • Sahinidis, N.V.1
  • 46
    • 25444530947 scopus 로고    scopus 로고
    • A global optimization RLT-based approach for solving the hard clustering problem
    • 1123.62045 10.1007/s10898-004-2706-7 2176137
    • H.D. Sherali J. Desai 2005 A global optimization RLT-based approach for solving the hard clustering problem J. Glob. Optim. 32 281 306 1123.62045 10.1007/s10898-004-2706-7 2176137
    • (2005) J. Glob. Optim. , vol.32 , pp. 281-306
    • Sherali, H.D.1    Desai, J.2
  • 47
    • 28044432120 scopus 로고    scopus 로고
    • A global optimization RLT-based approach for solving the fuzzy clustering problem
    • 1097.90072 10.1007/s10898-004-7390-0 2190762
    • H.D. Sherali J. Desai 2005 A global optimization RLT-based approach for solving the fuzzy clustering problem J. Glob. Optim. 33 597 615 1097.90072 10.1007/s10898-004-7390-0 2190762
    • (2005) J. Glob. Optim. , vol.33 , pp. 597-615
    • Sherali, H.D.1    Desai, J.2
  • 48
    • 0001642333 scopus 로고
    • A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
    • 0787.90088 10.1007/BF00121304 1266898
    • H.D. Sherali C.H. Tuncbilek 1992 A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique J. Glob. Optim. 2 101 112 0787.90088 10.1007/BF00121304 1266898
    • (1992) J. Glob. Optim. , vol.2 , pp. 101-112
    • Sherali, H.D.1    Tuncbilek, C.H.2
  • 49
    • 0009656296 scopus 로고    scopus 로고
    • New reformulation-linearization/convexification relaxations for univariate and multivariate polynomial programming problems
    • 0885.90105 10.1016/S0167-6377(97)00013-8 1471663
    • H.D. Sherali C.H. Tuncbilek 1997 New reformulation-linearization/ convexification relaxations for univariate and multivariate polynomial programming problems Oper. Res. Lett. 21 1 10 0885.90105 10.1016/S0167-6377(97) 00013-8 1471663
    • (1997) Oper. Res. Lett. , vol.21 , pp. 1-10
    • Sherali, H.D.1    Tuncbilek, C.H.2
  • 50
    • 0041711004 scopus 로고    scopus 로고
    • Global optimization of nonconvex factorable programming problems
    • 0985.90073 10.1007/PL00011409 1814550
    • H.D. Sherali H. Wang 2001 Global optimization of nonconvex factorable programming problems Math. Program. 89 459 478 0985.90073 10.1007/PL00011409 1814550
    • (2001) Math. Program. , vol.89 , pp. 459-478
    • Sherali, H.D.1    Wang, H.2
  • 53
    • 0025596333 scopus 로고
    • A global optimization algorithm (GOP) for certain classes of nonconvex NLPs. II. Application of theory and test problems
    • 10.1016/0098-1354(90)80021-3
    • V. Visweeswaran C.A. Floudas 1990 A global optimization algorithm (GOP) for certain classes of nonconvex NLPs. II. Application of theory and test problems Comput. Chem. Eng. 14 1419 1434 10.1016/0098-1354(90)80021-3
    • (1990) Comput. Chem. Eng. , vol.14 , pp. 1419-1434
    • Visweeswaran, V.1    Floudas, C.A.2
  • 54
    • 0018060909 scopus 로고
    • Assuring a global optimum by the use of an upper bound on the lower (dual) bound
    • 10.1016/0098-1354(78)80012-X
    • A.W. Westerberg J.V. Shah 1978 Assuring a global optimum by the use of an upper bound on the lower (dual) bound Comput. Chem. Eng. 2 83 92 10.1016/0098-1354(78)80012-X
    • (1978) Comput. Chem. Eng. , vol.2 , pp. 83-92
    • Westerberg, A.W.1    Shah, J.V.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.