A review of recent advances in global optimization
The DOI matches its Crossref record; 364 of the 369 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As a consequence, there is a need for proper non-convex (global) optimization methods [105,106].”
From Reverse engineering and identification in systems biology: strategies, perspectives and challenges (2014) · cites this paper as [106]
Citations
Cites
Storn, R., & Price, K. (1997) · Journal of Global Optimization · doi:10.1023/a:1008202821328 · Cited by 29,569 · cited 1×
“Moloi and Ali (2005) proposed an algorithm for minimizing potential energy functions that is based on the differential evolution algorithm by Storn and Price (1997), and tested it on two different types of potentials.”
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
A plant-wide industrial process control problem
Downs, J. J., & Vogel, E. F. (1993) · Computers & Chemical Engineering · doi:10.1016/0098-1354(93)80018-i · Cited by 3,348 · cited 9×
“Dua et al. (2002) proposed novel approaches for multiparametric mixed-integer quadratic models through the decomposition into a multiparametric quadratic MIQP model for the upper bound and a potentially nonconvex MINLP model for the lower bound, suggested ways of addressing the nonconvexity in the MINLP, and generated…”
MethodInfluentialGreedy Randomized Adaptive Search Procedures
Feo, T. A., & Resende, M. G. C. (1995) · Journal of Global Optimization · doi:10.1007/bf01096763 · Cited by 2,778
Greedy Randomized Adaptive Search Procedures
Resende, M. G. C., & Ribeiro, C. C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_8 · Cited by 2,310
A Taxonomy of Global Optimization Methods Based on Response Surfaces
Jones, D. R. (2001) · Journal of Global Optimization · doi:10.1023/a:1012771025575 · Cited by 2,159 · cited 1×
“Jones (2001) provided a comparative overview of the various response surface approaches, with regard to their use in global optimization.”
BackgroundGlobal Optimization Using Interval Analysis
(2003) · CRC Press eBooks · doi:10.1201/9780203026922 · Cited by 1,674
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
Handbook of Global Optimization
(1995) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4615-2025-2 · Cited by 1,628
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Price, K. V., Storn, R., & Lampinen, J. (2005) · Cited by 1,406
A polyhedral branch-and-cut approach to global optimization
Tawarmalani, M., & Sahinidis, N. V. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0581-8 · Cited by 1,225 · cited 1×
“Tawarmalani and Sahinidis (2005) introduced a polyhedral branch-and-cut approach in global optimization.”
BackgroundIntroduction to Global Optimization
Horst, R., Pardalos, P. M., & Thoai, N. V. (2000) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4615-0015-5 · Cited by 1,217
Global Optimization of Clusters, Crystals, and Biomolecules
Wales, D. J., & Scheraga, H. A. (1999) · Science · doi:10.1126/science.285.5432.1368 · Cited by 1,114 · cited 1×
“Wales and Scheraga (1999) described the progress in finding the global minima of potential energy functions.”
BackgroundA probabilistic heuristic for a computationally difficult set covering problem
Feo, T. A., & Resende, M. G. C. (1989) · Operations Research Letters · doi:10.1016/0167-6377(89)90002-3 · Cited by 1,065 · cited 1×
“Hirsch et al. (2007) extended the GRASP algorithm (Feo and Resende 1989, 1995) of discrete optimization to continuous problems, and applied this stochastic heuristic to two hard global optimization problems.”
MethodNonlinear and Mixed-Integer Optimization: Fundamentals and Applications
Floudas, C. A. (1995) · Cited by 957
Self-citation(2001) · Springer eBooks · doi:10.1007/0-306-48332-7 · Cited by 955
Self-citationPractical Bilevel Optimization
Bard, J. F. (1998) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-2836-1 · Cited by 930 · cited 1×
“These include the textbooks by Tuy (1998) on convex analysis, Bard (1998) on bilevel programming, Sherali and Adams (1999) on the reformulation–linearization technique (RLT), Horst et al. (2000), Floudas (2000a) and Horst and Tuy (2003) on deterministic approaches, Rubinov (2000) on abstract…”
MethodA Radial Basis Function Method for Global Optimization
Gutmann, H.-M. (2001) · Journal of Global Optimization · doi:10.1023/a:1011255519438 · Cited by 910 · cited 2×
“Regis and Shoemaker (2005) proposed strategies that improve the performance of the radial basis function method of Gutmann (2001).”
BackgroundMethodRuíz, E., Cano, J., Álvarez, S., & Alemany, P. (1999) · Journal of Computational Chemistry · doi:10.1002/(sici)1096-987x(199910)20:13<1354::aid-jcc3>3.0.co;2-n · Cited by 900
(2009) · Springer eBooks · doi:10.1007/978-0-387-74759-0 · Cited by 815
Self-citationConvex Analysis and Global Optimization
Tụy, H. (2016) · Springer optimization and its applications · doi:10.1007/978-3-319-31484-6 · Cited by 738 · cited 1×
“These include the textbooks by Tuy (1998) on convex analysis, Bard (1998) on bilevel programming, Sherali and Adams (1999) on the reformulation–linearization technique (RLT), Horst et al. (2000), Floudas (2000a) and Horst and Tuy (2003) on deterministic approaches, Rubinov (2000) on abstract…”
Handbook of Test Problems in Local and Global Optimization
Floudas, C. A., Pardalos, P. M., Adjiman, C. S., Esposito, W. R., Gümüş, Z. H., Harding, S. T., Klepeis, J. L., Meyer, C. A., & Schweiger, C. A. (1999) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-3040-1 · Cited by 636 · cited 2×
“Klepeis and Floudas (1999b) proposed also a novel deterministic global optimization approach for free energy calculations of peptides.”
BackgroundSelf-citationGlobal Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models
Huang, D., Allen, T. T., Notz, W. I., & Zeng, N. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-2454-3 · Cited by 625 · cited 1×
“Huang et al. (2006) proposed a new global optimization method for stochastic black-box systems that is based on sequential kriging meta-models.”
MethodConvex Analysis and Global Optimization
Tụy, H. (1998) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-2809-5 · Cited by 618
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
Tawarmalani, M., & Sahinidis, N. V. (2002) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3532-1 · Cited by 612
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
(1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)91233-6 · Cited by 591
Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
Tawarmalani, M., & Sahinidis, N. V. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0467-6 · Cited by 569 · cited 1×
“Tawarmalani and Sahinidis (2004) developed a branch and bound framework for the global optimization of continuous, integer, and mixed-integer nonlinear programs.”
BackgroundAli, M. M., Khompatraporn, C., & Zabinsky, Z. B. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-9972-2 · Cited by 565 · cited 1×
“They applied their method on a wastewater treatment plant model (Alex et al. 1999) and the Tennessee Eastman Process (Downs and Vogel 1993).”
MethodNonconvex Optimization and Its Applications
Pardalos, P. M., Mishra, S. K., Wang, S., & Lai, K. K. (2008) · Cited by 538
Adjiman, C. S., Dallwig, S., Floudas, C. A., & Neumaier, A. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00027-1 · Cited by 526 · cited 3×
“…of finding the optimal functional forms for convex underestimators for twice continuously differentiable functions, and identified the original (Adjiman et al. 1998a,b) and the generalized (Akrotirianakis and Floudas 2004a,b) αBB method as the only optimal schemes that satisfy such a…”
MethodInfluentialSelf-citationDeterministic Global Optimization
Floudas, C. A. (2000) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-4949-6 · Cited by 493 · cited 5×
“Gümü¸s and Floudas (2005) studied the global optimization of bilevel mixed-integer optimization problems, proposed an approach that is applicable to mixed-integer nonlinear outer problem and twice continuously differentiable nonlinear inner problem, introduced another approach based on the convex…”
BackgroundInfluentialSelf-citationA Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
Sherali, H. D., & Adams, W. P. (1999) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-4388-3 · Cited by 472
Deterministic global optimization: Theory, methods and applications
(2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)90165-2 · Cited by 451 · cited 5×
“Harding and Floudas (2000b) studied the enclosure of all heterogeneous and reactive azeotropes, developed a rigorous framework based on the αBB global optimization principles, and demonstrated its potential for a variety of case studies.”
InfluentialGlobal optimization for the synthesis of integrated water systems in chemical processes
Karuppiah, R., & Grossmann, I. E. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.11.005 · Cited by 437 · cited 1×
“Karuppiah and Grossmann (2006) addressed the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are jointly taken into account.”
BackgroundComplete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Acta Numerica · doi:10.1017/s0962492904000194 · Cited by 430
Abstract Convexity and Global Optimization
Rubinov, A. M. (2000) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3200-9 · Cited by 422 · cited 2×
“…(1999) on the reformulation–linearization technique (RLT), Horst et al. (2000), Floudas (2000a) and Horst and Tuy (2003) on deterministic approaches, Rubinov (2000) on abstract convexity, Strongin and Sergeyev (2000) on sequential and parallel algorithms, Tawarmalani and Sahinidis (2002a) on…”
BackgroundHandbook of Global Optimization
(2002) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4757-5362-2 · Cited by 412
Sahinidis, N. V., & Tawarmalani, M. (2002) · Cited by 377
Stochastic Global Optimization
(2008) · Springer Optimization and Its Applications · doi:10.1007/978-0-387-74740-8 · Cited by 351
Adjiman, C. S., Androulakis, I. P., & Floudas, C. A. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00218-x · Cited by 349 · cited 3×
“…of finding the optimal functional forms for convex underestimators for twice continuously differentiable functions, and identified the original (Adjiman et al. 1998a,b) and the generalized (Akrotirianakis and Floudas 2004a,b) αBB method as the only optimal schemes that satisfy such a…”
MethodInfluentialSelf-citationConstrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions
Regis, R. G., & Shoemaker, C. A. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-0570-0 · Cited by 331 · cited 1×
“Regis and Shoemaker (2005) proposed strategies that improve the performance of the radial basis function method of Gutmann (2001).”
BackgroundGlobal Optimization with Non-Convex Constraints
Strongin, R. G., & Sergeyev, Y. D. (2000) · Nonconvex optimization and its applications · doi:10.1007/978-1-4615-4677-1 · Cited by 302
A global optimization algorithm (GOP) for certain classes of nonconvex NLPs—I. Theory
Floudas, C. A., & Visweswaran, V. (1990) · Computers & Chemical Engineering · doi:10.1016/0098-1354(90)80020-c · Cited by 286 · cited 1×
“Zlobec (2005) showed that the Liu–Floudas convexification (Liu and Floudas 1993) can be possible for every Lipschitz continuously differentiable function, practically extending the applicability of the GOP algorithm (Floudas and Visweswaran 1990) to almost every smooth program occurring in practice.”
BackgroundSelf-citationGlobal optimization of mixed‐integer nonlinear problems
Adjiman, C. S., Androulakis, I. P., & Floudas, C. A. (2000) · AIChE Journal · doi:10.1002/aic.690460908 · Cited by 261 · cited 1×
“Adjiman et al. (2000) proposed two novel global optimization approaches for nonconvex mixed-integer nonlinear programming problems.”
BackgroundSelf-citation(2005) · Natural Computing Series · doi:10.1007/3-540-31306-0 · Cited by 256
Advances in protein structure prediction and de novo protein design: A review
Floudas, C. A., Fung, H. K., McAllister, S. R., Mönnigmann, M., & Rajgaria, R. (2006) · Chemical Engineering Science · doi:10.1016/j.ces.2005.04.009 · Cited by 244 · cited 1×
“Reviews of the global optimization activities in the areas of protein folding and peptide docking can be found in Floudas (2005, 2007) and Floudas et al. (2006).”
BackgroundSelf-citationGlobal optimization in the 21st century: Advances and challenges
Floudas, C. A., Akrotirianakis, I. G., Caratzoulas, S., Meyer, C. A., & Kallrath, J. (2005) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.02.006 · Cited by 234 · cited 1×
“More recently, Floudas et al. (2005) provided a thorough review of developments that covered the years 1998–2003.”
BackgroundSelf-citationRecent developments and trends in global optimization
Pardalos, P. M., Romeijn, H. E., & Tuy, H. (2000) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(00)00425-8 · Cited by 229 · cited 1×
“Floudas (2000b) presented a review on global optimization in the design and control of chemical process systems, while Pardalos et al. (2000) presented advances and research trends on deterministic and stochastic global optimization during the nineties.”
BackgroundGlobal optimization in generalized geometric programming
Maranas, C. D., & Floudas, C. A. (1997) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(96)00282-7 · Cited by 225
Self-citationA multiparametric programming approach for mixed-integer quadratic engineering problems
Dua, V., Bozinis, N. A., & Pistikopoulos, E. N. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(01)00797-9 · Cited by 222
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Horst, R. (2002) · Springer eBooks · Cited by 218
Stochastic Adaptive Search for Global Optimization
Zabinsky, Z. B. (2003) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4419-9182-9 · Cited by 215 · cited 1×
“…Strongin and Sergeyev (2000) on sequential and parallel algorithms, Tawarmalani and Sahinidis (2002a) on modeling and implementation issues, Zabinsky (2003) and Zhigljavsky and Zilinskas (2007) on stochastic approaches, Hansen and Walster (2004) on interval methods, and Price et al.…”
BackgroundGlobal optimum search for nonconvex NLP and MINLP problems
Floudas, C. A., Aggarwal, A., & Ciric, A. R. (1989) · Computers & Chemical Engineering · doi:10.1016/0098-1354(89)87016-4 · Cited by 207 · cited 1×
“The algorithm is based on the Global Optimum Search methodology (Floudas et al. 1989; Floudas 1995) and includes a procedure to determine the optimal number of clusters to be used.”
MethodSelf-citationGlobal Optimization: From Theory to Implementation
(2006) · Nonconvex Optimization and Its Applications · doi:10.1007/0-387-30528-9 · Cited by 200
An improved PSO algorithm for solving non-convex NLP/MINLP problems with equality constraints
Yiqing, L., Xigang, Y., & Yongjian, L. (2007) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.05.016 · Cited by 197
Improving food processing using modern optimization methods
Banga, J. R., Balsa-Canto, E., Moles, C. G., & Alonso, A. A. (2003) · Trends in Food Science & Technology · doi:10.1016/s0924-2244(03)00048-7 · Cited by 192 · cited 4×
“Banga et al. (2003b) reviewed and introduced optimization as a key technology for food processing and discussed stochastic global optimization methods and their potential applicability in food process engineering.”
BackgroundMethodInfluentialGlobal optimization for the parameter estimation of differential-algebraic systems
Esposito, W. R., & Floudas, C. A. (2000) · Industrial & Engineering Chemistry Research · doi:10.1021/ie990486w · Cited by 188
Self-citationA Model Reference Adaptive Search Method for Global Optimization
Hu, J., Fu, M. C., & Marcus, S. I. (2007) · Operations Research · doi:10.1287/opre.1060.0367 · Cited by 179 · cited 2×
“A review of the recent advances on MINLP optimization of planning and design problems in the process industry was presented by Kallrath (2005). Ghosh et al.”
BackgroundZamora, J. M., & Grossmann, I. E. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(96)00346-8 · Cited by 175
Scatter search for chemical and bio-process optimization
Egea, J. A., Rodríguez-Fernández, M., Banga, J. R., & Martí, R. (2007) · Journal of Global Optimization · doi:10.1007/s10898-006-9075-3 · Cited by 171 · cited 2×
“Using a challenging wastewater treatment plant benchmark model, Egea et al. (2007b) conducted a computational comparison between various global optimization approaches, including surrogate-based methods.”
MethodGlobal Optimization in Generalized Geometric Programming
(2012) · Springer eBooks · doi:10.1007/springerreference_72312 · Cited by 171
Frontiers in Global Optimization
(2004) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4613-0251-3 · Cited by 168
Self-citationGlobal optimization for parameter estimation of differential-algebraic systems
Čižniar, M., Podmajerský, M., Hirmajer, T., Fikar, M., & Latifi, A. (2009) · Chemical Papers · doi:10.2478/s11696-009-0017-7 · Cited by 163 · cited 3×
“Esposito and Floudas (2000a) studied the global optimization in parameter estimation of systems described by differential-algebraic models, proposed a rigorous global optimization approach based on a collocation framework and the αBB principles, proposed a global optimization approach based on an…”
BackgroundA comparison of complete global optimization solvers
Neumaier, A., Shcherbina, O., Huyer, W., & Vinkó, T. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0585-4 · Cited by 162 · cited 2×
“Ostrovsky et al. (2002) studied nonconvex MINLP models in which most variables are in the nonconvex terms and the number of linear constraints is much larger than the nonlinear constraints, introduced the idea of branching on a set of linear branching variables which depend linearly on the search variables, proposed a…”
BackgroundMethodDeterministic Global Optimization in Nonlinear Optimal Control Problems
Esposito, W. R., & Floudas, C. A. (2000) · Journal of Global Optimization · doi:10.1023/a:1026578104213 · Cited by 161 · cited 3×
“Esposito and Floudas (2000a) studied the global optimization in parameter estimation of systems described by differential-algebraic models, proposed a rigorous global optimization approach based on a collocation framework and the αBB principles, proposed a global optimization approach based on an…”
BackgroundSelf-citationA simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
Linderoth, J. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0582-7 · Cited by 159 · cited 1×
“Linderoth (2005) proposed a branch-and-bound algorithm for solving nonconvex quadratically-constrained quadratic programs.”
BackgroundVecchietti, A., Lee, S., & Grossmann, I. E. (2003) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00220-x · Cited by 159 · cited 1×
“Vecchietti et al. (2003) presented characterization and properties for various types of disjunctions, including an interesting result for improper disjunctions.”
BackgroundGlobal Optimization in Design under Uncertainty: Feasibility Test and Flexibility Index Problems
Floudas, C. A., Gumus, Z. H., & Ierapetritou, M. (2001) · Industrial & Engineering Chemistry Research · doi:10.1021/ie001014g · Cited by 158 · cited 1×
“Floudas et al. (2001) introduced a global optimization approach for the calculation of the flexibility index and the feasibility test which are bilevel nonlinear optimization models, and demonstrated its applicability to a heat exchanger network problem, a pump and pipe run problem, a…”
BackgroundSelf-citationGeneralized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
Grossmann, I. E., & Lee, S.-B. (2003) · Computational Optimization and Applications · doi:10.1023/a:1025154322278 · Cited by 156
Klepeis, J. L., & Floudas, C. A. (2003) · Biophysical Journal · doi:10.1016/s0006-3495(03)74640-2 · Cited by 156 · cited 1×
“Klepeis et al. (1998) and Klepeis and Floudas (1999a) proposed new global optimization approaches for the structure prediction of solvated peptides using area and volume accessible to the solvent models.”
BackgroundSelf-citationA bilevel programming framework for enterprise-wide process networks under uncertainty
Ryu, J.-H., Dua, V., & Pistikopoulos, E. N. (2003) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.09.021 · Cited by 156
Bard, J. F. (2006) · Springer eBooks · Cited by 155
Optimality Conditions and Duality for a Class of Nonlinear Fractional Programming Problems
Liang, Z., Huang, H.-X., & Pardalos, P. M. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1017540412396 · Cited by 152 · cited 1×
“Liang et al. (2001) presented sufficient optimality conditions and duality results, based on sublinear functionals and generalized convexity, for a class of nonlinear fractional programming problems.”
BackgroundImproved Strategies for Radial basis Function Methods for Global Optimization
Regis, R. G., & Shoemaker, C. A. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9040-1 · Cited by 148 · cited 1×
“They also presented a new approach for the constrained global optimization of expensive black box functions using response surface models (Regis and Shoemaker 2007).”
MethodGlobal Optimization of Nonlinear Bilevel Programming Problems
Gumus, Z. H., & Floudas, C. A. (2001) · Journal of Global Optimization · doi:10.1023/a:1011268113791 · Cited by 147
Self-citationKaruppiah, R., & Grossmann, I. E. (2007) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2007.03.007 · Cited by 147 · cited 3×
“…of which amounted to an NLP formulation with 133 variables and 110 constraints that include 114 bilinear terms; and an integrated water network (Karuppiah and Grossmann 2008a), an MINLP consisting of 77 binary variables, 1,222 continuous variables, and 1,377 constraints that include 522…”
BackgroundMethodGlobal optimization of a combinatorially complex generalized pooling problem
Meyer, C. A., & Floudas, C. A. (2005) · AIChE Journal · doi:10.1002/aic.10717 · Cited by 147 · cited 2×
“Meyer and Floudas (2006) studied superstructures of pooling networks, which are important to the petrochemical, chemical, and wastewater treatment industries, and formulated this generalized pooling problem as a nonconvex MINLP that involves many bilinear terms in the constraint functions.”
BackgroundSelf-citationZamora, J. M., & Grossmann, I. E. (1999) · Journal of Global Optimization · doi:10.1023/a:1008312714792 · Cited by 144
Global minimization using an Augmented Lagrangian method with variable lower-level constraints
Birgin, E. G., Floudas, C. A., & Martínez, J. M. (2009) · Mathematical Programming · doi:10.1007/s10107-009-0264-y · Cited by 141
Self-citationA Lagrangian Approach to the Pooling Problem
Adhya, N., Tawarmalani, M., & Sahinidis, N. V. (1999) · Industrial & Engineering Chemistry Research · doi:10.1021/ie980666q · Cited by 139 · cited 1×
“Adhya et al. (1999) studied bilinear models of the pooling problem, proposed a Lagrangian relaxation approach for the generation of valid lower bounds, and showed that these bounds are tighter when compared to linear programming based relaxations.”
BackgroundBjörk, K.-M., & Westerlund, T. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00129-1 · Cited by 137 · cited 9×
“Björk and Westerlund (2002) studied the global optimization of heat exchanger network synthesis through the simplified superstructure representation that allows only series and parallel schemes, applied convexification approaches for signomials via piecewise linear approximations, developed convex MINLP lower bounding…”
BackgroundInfluentialGlobal optimization of nonlinear fractional programming problems in engineering design
Tsai, J. (2005) · Engineering Optimization · doi:10.1080/03052150500066737 · Cited by 133
A Rigorous Global Optimization Algorithm for Problems with Ordinary Differential Equations
Papamichail, I., & Adjiman, C. S. (2002) · Journal of Global Optimization · doi:10.1023/a:1016259507911 · Cited by 130 · cited 1×
“Papamichail and Adjiman (2002) introduced a deterministic spatial branch-and-bound global optimization approach for nonconvex models with ordinary differential equations, proposed a convex relaxation based on the theory of differential inequalities which allowed them to generate rigorous bounds for…”
BackgroundGlobal optimization of mixed-integer bilevel programming problems
Gumus, Z. H., & Floudas, C. A. (2005) · Computational Management Science · doi:10.1007/s10287-005-0025-1 · Cited by 130
Self-citationGlobal solution of bilevel programs with a nonconvex inner program
Mitsos, A., Lemonidis, P., & Barton, P. I. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9260-z · Cited by 130
Global Methods for Dynamic Optimization and Mixed-Integer Dynamic Optimization
Chachuat, B., Singer, A. B., & Barton, P. I. (2006) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0601605 · Cited by 129 · cited 1×
“Chachuat et al. (2006) presented an overview of global methods for dynamic programming, with emphasis on the control parameterization approach.”
MethodMixed-Integer Nonlinear Optimization
Floudas, C. A. (1995) · Oxford University Press eBooks · doi:10.1093/oso/9780195100563.003.0011 · Cited by 128
Self-citationConvex extensions and envelopes of lower semi-continuous functions
Tawarmalani, M., & Sahinidis, N. V. (2002) · Mathematical Programming · doi:10.1007/s10107-002-0308-z · Cited by 127 · cited 2×
“…and Tuy (2003) on deterministic approaches, Rubinov (2000) on abstract convexity, Strongin and Sergeyev (2000) on sequential and parallel algorithms, Tawarmalani and Sahinidis (2002a) on modeling and implementation issues, Zabinsky (2003) and Zhigljavsky and Zilinskas (2007) on stochastic…”
BackgroundParametric global optimisation for bilevel programming
Faísca, N. P., Dua, V., Rüstem, B., Saraiva, P. M., & Pistikopoulos, E. N. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9100-6 · Cited by 127 · cited 1×
“Faisca et al. (2007) proposed a global optimization approach for bilevel programming that is based on reformulating the inner optimization problem as a multi-parametric one, where the parameters are the variables of the outer level problem.”
MethodOuter approximation algorithms for separable nonconvex mixed-integer nonlinear programs
Kesavan, P., Allgor, R. J., Gatzke, E. P., & Barton, P. I. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0503-1 · Cited by 125 · cited 1×
“Kesavan et al. (2004) studied separable MINLP models with nonconvex functions, proposed two decomposition algorithms based on alternating sequences of relaxed master problems, two nonlinear programming problems, and outer approximation, showed that the first algorithm yields the global solution…”
BackgroundFilled functions for unconstrained global optimization
Xu, Z., Huang, H.-X., Pardalos, P. M., & Xu, C. (2001) · Journal of Global Optimization · doi:10.1023/a:1011207512894 · Cited by 124
Global optimization for scheduling refinery crude oil operations
Karuppiah, R., Furman, K. C., & Grossmann, I. E. (2007) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2007.11.008 · Cited by 124
Sherali, H. D., Adams, W. P., & Driscoll, P. J. (1998) · Operations Research · doi:10.1287/opre.46.3.396 · Cited by 121 · cited 1×
“Sherali et al. (1998) presented an extension of the reformulation–linearization technique (RLT) that is designed to exploit special structures.”
Optimization in Computational Chemistry and Molecular Biology
Floudas, C. A., & Pardalos, P. M. (2000) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3218-4 · Cited by 120 · cited 1×
“These include the books by Floudas and Pardalos (2000) that covers advances in the areas of computational chemistry and molecular biology, Migdalas et al. (2001), Dzemyda et al. (2002) that focuses on stochastic methods, Floudas and Pardalos (2003), Liberti and Maculan (2006) that includes…”
BackgroundSelf-citationGlobal Optimization with Nonlinear Ordinary Differential Equations
Singer, A. B., & Barton, P. I. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-7074-4 · Cited by 118 · cited 1×
“Singer and Barton (2006) examined the global optimization of an integral objective function subject to nonlinear ordinary differential equations.”
BackgroundComputational methods in protein structure prediction
Floudas, C. A. (2007) · Biotechnology and Bioengineering · doi:10.1002/bit.21411 · Cited by 118 · cited 1×
“Reviews of the global optimization activities in the areas of protein folding and peptide docking can be found in Floudas (2005, 2007) and Floudas et al. (2006).”
BackgroundSelf-citationFloudas, C. A. (2005) · Cited by 117
Self-citationLee, S.-B., & Grossmann, I. E. (2003) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(03)00098-x · Cited by 114 · cited 1×
“Lee and Grossmann (2003) studied nonconvex GDP problems with bilinear equality constraints, derived convex underestimators and overestimators for the bilinear constraints using the reformulation/linearization approach, expressed the discrete choices as disjunctions which were subsequently relaxed…”
BackgroundEnhanced Interval Analysis for Phase Stability: Cubic Equation of State Models
Hua, J. Z., Brennecke, J. F., & Stadtherr, M. A. (1998) · Industrial & Engineering Chemistry Research · doi:10.1021/ie970535+ · Cited by 113 · cited 2×
“Hua et al. (1998a) applied an interval analysis method for the phase stability computations of binary and ternary mixtures using equation of state models.”
MethodDesign of alternative refrigerants via global optimization
Sahinidis, N. V., Tawarmalani, M., & Yu, M. (2003) · AIChE Journal · doi:10.1002/aic.690490714 · Cited by 112 · cited 1×
“Sahinidis et al. (2003) revisited the design of alternative refrigerants problem, introduced an integer formulation for previously described structural constraints, proposed new structural constraints between one-bonded and higher-bonded groups in the absence of rings and new clique constraints for…”
BackgroundSemidefinite Relaxations of Fractional Programs via Novel Convexification Techniques
Tawarmalani, M., & Sahinidis, N. V. (2001) · Journal of Global Optimization · doi:10.1023/a:1011233805045 · Cited by 111 · cited 1×
“2.1 Convex envelopes Tawarmalani and Sahinidis (2001) developed the convex and concave envelopes for x/y over a unit hypercube, compared it to the convex relaxation proposed by Zamora and Grossmann (1998a,b, 1999), proposed a semidefinite relaxation of x/y, and suggested convex envelopes for…”
BackgroundInfluentialKallrath, J. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3976-2 · Cited by 111 · cited 1×
“A review of the recent advances on MINLP optimization of planning and design problems in the process industry was presented by Kallrath (2005).”
BackgroundGlobal optimization of higher order moments in portfolio selection
Maringer, D. G., & Parpas, P. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9224-3 · Cited by 111
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
Floudas, C. A., & Stein, O. T. (2007) · SIAM Journal on Optimization · doi:10.1137/060657741 · Cited by 110 · cited 1×
“Floudas and Stein (2007) presented a novel adaptive convexification algorithm for the solution of semi-infinite optimization problems.”
BackgroundSelf-citationGlobal optimization by continuous grasp
Hirsch, M. J., Meneses, C. N., Pardalos, P. M., & Resende, M. G. C. (2006) · Optimization Letters · doi:10.1007/s11590-006-0021-6 · Cited by 108 · cited 1×
“Hirsch et al. (2007) extended the GRASP algorithm (Feo and Resende 1989, 1995) of discrete optimization to continuous problems, and applied this stochastic heuristic to two hard global optimization problems.”
MethodGlobal Optimization of Multiplicative Programs
Ryoo, H. S., & Sahinidis, N. V. (2003) · Journal of Global Optimization · doi:10.1023/a:1024700901538 · Cited by 107 · cited 1×
“Ryoo and Sahinidis (2003) studied linear and generalized linear multiplicative models, applied the recursive arithmetic interval approach for the derivation of lower bounds, introduced greedy heuristics for a branch-and-reduce approach, and applied it to benchmark problems and randomly generated…”
BackgroundTrilinear Monomials with Mixed Sign Domains: Facets of the Convex and Concave Envelopes
Meyer, C. A., & Floudas, C. A. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000042112.72379.e6 · Cited by 107 · cited 1×
“In a later publication (Meyer and Floudas 2004), they presented the results for the case of mixed-sign domains.”
BackgroundSelf-citationEsposito, W. R., & Floudas, C. A. (1998) · Industrial & Engineering Chemistry Research · doi:10.1021/ie970852g · Cited by 106 · cited 1×
“2.8 Parameter estimation Esposito and Floudas (1998) studied the error-in-variables approach and proposed the first global optimization method for the parameter estimation and data reconcilliation of nonlinear algebraic models using the principles of the αBB approach.”
MethodInfluentialSelf-citationGlobal Dynamic Optimization for Parameter Estimation in Chemical Kinetics
Singer, A. B., Taylor, J. W., Barton, P. I., & Green, W. H. (2006) · The Journal of Physical Chemistry A · doi:10.1021/jp0548873 · Cited by 106
Optimization of dynamic systems: A trigonometric differential evolution approach
Rakesh Angira, A., & Santosh, A. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.09.015 · Cited by 103
An extended cutting plane method for a class of non-convex MINLP problems
Westerlund, T., Skrifvars, H., Harjunkoski, I., & Pörn, R. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(97)00000-8 · Cited by 102 · cited 1×
“Westerlund et al. (1998) proposed an extended cutting plane approach for the global optimization of pseudoconvex MINLP problems, studied its convergence properties, and applied it to an example from the paper-converting industry.”
A Finite Algorithm for Global Minimization of Separable Concave Programs
Shectman, J. P., & Sahinidis, N. V. (1998) · Journal of Global Optimization · doi:10.1023/a:1008241411395 · Cited by 101 · cited 1×
“Shectman and Sahinidis (1998) proposed a finite global optimization method for separable concave problems.”
BackgroundApuzzo, M. D., Marino, M., Migdalas, A., Pardalos, P. M., & Toraldo, G. (2005) · Statistics, a series of textbooks and monographs · doi:10.1201/9781420028683.ch8 · Cited by 99
Beck, A., Ben‐Tal, A., & Teboulle, M. (2006) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040616851 · Cited by 98 · cited 8×
“Beck et al. (2006) derived an efficient global optimization algorithm for the regularized total least squares problem and applied it on problems arising from the inverse Laplace transform and image processing. Jiao et al. (2006) proposed solving generalized linear fractional problems via a branch and bound algorithm t…”
MethodInfluentialA kriging method for the solution of nonlinear programs with black‐box functions
Davis, E., & Ierapetritou, M. (2007) · AIChE Journal · doi:10.1002/aic.11228 · Cited by 95 · cited 4×
“De Saboia et al. (2004) conducted a computational study of two global algorithms for linear bilevel programming and proposed some modifications that improve their computational performance. Ryu et al. (2004) addressed a bilevel decision-making problem under uncertainty in the context of enterprise-wide supply chain op…”
BackgroundMethodInfluentialContinuous reformulations of discrete–continuous optimization problems
Stein, O. T., Oldenburg, J., & Marquardt, W. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2004.03.011 · Cited by 95
Analysis of Bounds for Multilinear Functions
Ryoo, H. S., & Sahinidis, N. V. (2001) · Journal of Global Optimization · doi:10.1023/a:1011295715398 · Cited by 94 · cited 4×
“Shectman and Sahinidis (1998) proposed a finite global optimization method for separable concave problems.”
BackgroundInfluentialReliable phase stability analysis for excess Gibbs energy models
Tessier, S. R., Brennecke, J. F., & Stadtherr, M. A. (2000) · Chemical Engineering Science · doi:10.1016/s0009-2509(99)00442-x · Cited by 94 · cited 1×
“Tessier et al. (2000) introduced monotonicity based and mole fraction weighted averages based enhancments for the application of interval Newton methods to the phase stability problem using the NRTL and UNIQUAC models.”
MethodReliable nonlinear parameter estimation in VLE modeling
Gau, C., Brennecke, J. F., & Stadtherr, M. A. (2000) · Fluid Phase Equilibria · doi:10.1016/s0378-3812(99)00332-5 · Cited by 91 · cited 1×
“Gau et al. (2000) studied further the parameter estimation of vapor liquid equilibrium models via interval analysis, applied it using the Wilson equation for a variety of binary systems, and demonstrated that correct predictions of azeotropes are attained only based on the global optimum parameter…”
MethodComplete search in continuous global optimization and constraint satisfaction
Neumaier, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511569975.004 · Cited by 91
Lee, S.-B., & Grossmann, I. E. (2001) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(01)00732-3 · Cited by 90 · cited 4×
“…discrete choices as disjunctions which were subsequently relaxed by their convex hull representations, used their earlier two level global optimization approach (Lee and Grossmann 2001), and presented computational studies for pooling problems, water usage problems, and wastewater network problems.”
BackgroundInfluentialConvex envelopes for edge-concave functions
Meyer, C. A., & Floudas, C. A. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0580-9 · Cited by 90 · cited 1×
“In a later publication (Meyer and Floudas 2004), they presented the results for the case of mixed-sign domains.”
BackgroundSelf-citationGlobal optimization of nonconvex factorable programming problems
Sherali, H. D., & Wang, H. (2001) · Mathematical Programming · doi:10.1007/pl00011409 · Cited by 89 · cited 1×
“Sherali et al. (2001) studied the water distribution network design problem.”
BackgroundConvexification and Global Optimization in Continuous And
Tawarmalani, M., & Sahinidis, N. V. (2002) · Kluwer Academic Publishers eBooks · Cited by 88
Cutting circles and polygons from area-minimizing rectangles
Kallrath, J. (2008) · Journal of Global Optimization · doi:10.1007/s10898-007-9274-6 · Cited by 87
Global solution of semi-infinite programs
Bhattacharjee, B., Lemonidis, P., Green, W. H., & Barton, P. I. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0583-6 · Cited by 85
A new linearization technique for multi-quadratic 0–1 programming problems
Chaovalitwongse, W. A., Pardalos, P. M., & Prokopyev, O. A. (2004) · Operations Research Letters · doi:10.1016/j.orl.2004.03.005 · Cited by 85
Enhancing RLT relaxations via a new class of semidefinite cuts
Sherali, H. D., & Fraticelli, B. M. P. (2002) · Journal of Global Optimization · doi:10.1023/a:1013819515732 · Cited by 83 · cited 2×
“…formulated it as nonconvex NLP with differential-algebraic constraints, introduced a global optimization framework based on the integration approach and the αBB, investigated alternative types of reformulations, and reported extensive computational studies for complex reaction/reactor networks.”
BackgroundLinear semi-infinite programming theory: An updated survey
Goberna, M. A., & López, M. A. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(02)00327-2 · Cited by 82 · cited 1×
“Goberna and Lopez (2002) presented a review on the theoretical advances in linear and convex semi-infinite programming.”
BackgroundEnvironmentally benign solvent design by global optimization
Sinha, M., Achenie, L. E. K., & Ostrovsky, G. M. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)00299-9 · Cited by 81 · cited 1×
“3.2 MINLP: formulations and applications Sinha et al. (1999) studied the class of solvent design problems, modelled it as a nonconvex MINLP problem, identified the sources of nonconvexities in the properties and solubility parameter design constraints, proposed linear underestimators based on a…”
BackgroundInfluentialConvexification of different classes of non-convex MINLP problems
Pörn, R., Harjunkoski, I., & Westerlund, T. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00305-6 · Cited by 81 · cited 1×
“Pörn et al. (1999) proposed convexification schemes for classes of discrete and integer nonconvex models.”
BackgroundOn the Global Optimization of Sums of Linear Fractional Functions over a Convex Set
Benson, H. P. (2004) · Journal of Optimization Theory and Applications · doi:10.1023/b:jota.0000026129.07165.5a · Cited by 80 · cited 1×
“Benson (2004) showed how fractional programs can be reformulated so as to be solvable by parametric convex programming and concave minimization methods.”
BackgroundGlobal optimization of dynamic systems
Papamichail, I., & Adjiman, C. S. (2003) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(03)00195-9 · Cited by 80 · cited 1×
“Papamichail and Adjiman (2004) presented a deterministic spatial branch and bound global optimization algorithm for problems with a set of first-order differential equations in the constraints.”
BackgroundGlobal Optimization Issues in Multiparametric Continuous and Mixed-Integer Optimization Problems
Dua, V., Papalexandri, K. P., & Pistikopoulos, E. N. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000049091.73047.7e · Cited by 80 · cited 1×
“Dua et al. (2004) studied issues concerning the solution of parametric nonconvex programs, proposed a branch and bound algorithm, and discussed the need for defining a suitable overestimating subproblem.”
BackgroundEssays and Surveys in Global Optimization
Audet, C., Savard, G., & Hansen, P. (2005) · Springer eBooks · doi:10.1007/b135610 · Cited by 79 · cited 1×
“Collection of essays in the area of global optimization were edited by Hadjisavvas and Pardalos (2001), Pardalos and Romeijn (2002), and Audet et al. (2005).”
MethodA cutting plane method for solving linear generalized disjunctive programming problems
Sawaya, N. W., & Grossmann, I. E. (2005) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.04.004 · Cited by 78 · cited 1×
“Sawaya and Grossmann (2005) discussed issues regarding the computational implementation of the convex hull reformulation for nonlinear generalized disjunctive programming.”
BackgroundExler, O., Antelo, L. T., Egea, J. A., Alonso, A. A., & Banga, J. R. (2007) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2007.10.008 · Cited by 78 · cited 1×
“Exler et al. (2008) studied MINLP formulations with differential-algebraic constraints that arise in the integrated design of process and control systems.”
BackgroundPerfect duality theory and complete solutions to a class of global optimization problems*
Gao, D. Y. (2003) · Optimization · doi:10.1080/02331930310001611501 · Cited by 77 · cited 1×
“Gao (2003, 2004) presented detailed applications of the canonical dual transformation method in quadratic and d.c. programming.”
MethodStrongin, R. G., & Sergeyev, Y. D. (2000) · Springer eBooks · Cited by 76
Solutions and optimality criteria to box constrained nonconvex minimization problems
Gao, D. Y. (2007) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2007.3.293 · Cited by 76 · cited 1×
“Based on the same method, Gao (2005) also presented a duality theory for solving concave minimization problems subject to nonlinear inequality constraints, and polynomial programming problems subject to box constraints (Gao 2007).”
MethodSrinivas, M., & Rangaiah, G. P. (2007) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0612459 · Cited by 76 · cited 1×
“Srinivas and Rangaiah (2007) also focused on solving phase equilibrium problems with differential evolution and tabu search methods.”
BackgroundConvex Envelopes of Monomials of Odd Degree
Liberti, L., & Pantelides, C. C. (2003) · Journal of Global Optimization · doi:10.1023/a:1021924706467 · Cited by 74 · cited 1×
“…Grossmann (1998a,b, 1999), proposed a semidefinite relaxation of x/y, and suggested convex envelopes for functions of the form f (x)y2 and f (x)/y. Liberti and Pantelides (2003) proposed a nonlinear continuous and differentiable convex envelope for monomials of odd degree, derived its linear…”
BackgroundA simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
Benson, H. P. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.036 · Cited by 74 · cited 8×
“Benson (2006, 2007a) studied fractional programs that involve ratios of convex terms and presented a new branch and bound algorithm that requires solving a sequence of convex optimization problems.”
BackgroundMethodInfluentialDeterministic Global Optimization for Parameter Estimation of Dynamic Systems
Lin, Y., & Stadtherr, M. A. (2006) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0513907 · Cited by 74 · cited 1×
“Lin and Stadtherr (2006, 2007) created a new interval solver for parametric ODEs, which is used to produce guaranteed bounds on the solution of dynamic systems with intervalvalued parameters, and incorporated it within the framework of a global optimization solver for dynamic systems, including…”
MethodPhase stability with cubic equations of state: Global optimization approach
Harding, S. T., & Floudas, C. A. (2000) · AIChE Journal · doi:10.1002/aic.690460715 · Cited by 73 · cited 2×
“Harding and Floudas (2000a) introduced a novel global optimization approach for the phase stability of several cubic equations of state based on analytical findings and the principles of the αBB global optimization framework.”
BackgroundSelf-citationCanonical Duality Theory and Solutions to Constrained Nonconvex Quadratic Programming
Gao, D. Y. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000048034.94449.e3 · Cited by 72 · cited 2×
“Gao (2003, 2004) presented detailed applications of the canonical dual transformation method in quadratic and d.c. programming.”
BackgroundMethodComputer aided solvent design for extractive fermentation
Wang, Y., & Achenie, L. E. K. (2002) · Fluid Phase Equilibria · doi:10.1016/s0378-3812(02)00073-0 · Cited by 72
Global Optimization of Morse Clusters by Potential Energy Transformations
Doye, J. P. K., Leary, R. H., Locatelli, M., & Schoen, F. (2004) · INFORMS journal on computing · doi:10.1287/ijoc.1040.0084 · Cited by 72
Implementation and Computational Results
Tönshoff, N. (1997) · Deutscher Universitätsverlag eBooks · doi:10.1007/978-3-663-08773-1_12 · Cited by 71
Continuous global optimization of structured process systems models
Zamora, J. M., & Grossmann, I. E. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00244-0 · Cited by 71
Hybrid Global Optimization Algorithms for Protein Structure Prediction: Alternating Hybrids
Klepeis, J. L., Pieja, M. J., & Floudas, C. A. (2003) · Biophysical Journal · doi:10.1016/s0006-3495(03)74905-4 · Cited by 70 · cited 2×
“Klepeis et al. (2003a) introduced a new class of hybrid global optimization methods denoted as integrated hybrids for the oligopeptide structure prediction.”
MethodSelf-citationLOGMIP: a disjunctive 0–1 nonlinear optimizer for process systems models
Vecchietti, A., & Grossmann, I. E. (1997) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(97)87539-4 · Cited by 70
Akrotirianakis, I. G., & Floudas, C. A. (2004) · Journal of Global Optimization · doi:10.1007/s10898-004-6455-4 · Cited by 69 · cited 9×
“Akrotirianakis and Floudas (2004a) introduced a new class of convex underestimators for twice continuously differentiable NLPs, studied their theoretical properties, and proved that the resulting convex relaxation is improved compared to the αBB one. Furthermore, Akrotirianakis and Floudas (2004b) presented computatio…”
BackgroundMethodInfluentialSelf-citationBanga, J. R., Versyck, K. J., & Van Impe, J. F. (2002) · Industrial & Engineering Chemistry Research · doi:10.1021/ie010183d · Cited by 69 · cited 1×
“Banga et al. (2002) studied the optimal experimental design for the parameter estimation of nonlinear dynamic systems, formulated it as an optimal control that optimizes the Fischer information matrix, introduced two stochastic global optimization approaches to address the nonsmoothness and the…”
BackgroundGlobal Optimization of 0-1 Hyperbolic Programs
Tawarmalani, M., Ahmed, S., & Sahinidis, N. V. (2002) · Journal of Global Optimization · doi:10.1023/a:1021279918708 · Cited by 68 · cited 2×
“Tawarmalani et al. (2002a) showed that tighter linear programming relaxations are produced if the product of a continuous variable and the sum of several continuous variables is disaggregated, and applied it to the instance of rational programs that include a nuclear reactor reload pattern design,…”
BackgroundInfluentialGlobal optimization in design and control of chemical process systems
Floudas, C. A. (2000) · Journal of Process Control · doi:10.1016/s0959-1524(99)00019-0 · Cited by 68 · cited 7×
“Harding and Floudas (2000b) studied the enclosure of all heterogeneous and reactive azeotropes, developed a rigorous framework based on the αBB global optimization principles, and demonstrated its potential for a variety of case studies.”
BackgroundInfluentialSelf-citationReliable computation of homogeneous azeotropes
Maier, R. W., Brennecke, J. F., & Stadtherr, M. A. (1998) · AIChE Journal · doi:10.1002/aic.690440806 · Cited by 68 · cited 1×
“2.7 Phase equilibrium Maier et al. (1998) applied an interval analysis based approach for the enclosure of homogeneous azeotropes.”
MethodInfluentialSome transformation techniques with applications in global optimization
Lundell, A., Westerlund, J., & Westerlund, T. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9223-4 · Cited by 68
Davis, E., & Ierapetritou, M. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9217-2 · Cited by 68 · cited 1×
“A kriging based method was also developed by Davis and Ierapetritou (2007, 2008) for the solution of NLPs and MINLPs containing black-box functions.”
MethodCanonical dual approach to solving 0-1 quadratic programming problems
Fang, S., Gao, D. Y., Sheu, R.-L., & Wu, S. (2008) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2008.4.125 · Cited by 67 · cited 1×
“Based on the canonical dual transformation (Gao 2004), Fang et al. (2008) constructed a pair of canonical dual problems for the 0–1 quadratic programming problem, showed that no duality gap exists, derived optimality conditions of both the local and global type, and developed an algorithm for large…”
BackgroundSeizure warning algorithm based on optimization and nonlinear dynamics
Pardalos, P. M., Chaovalitwongse, W. A., Iasemidis, L. D., Sackellares, J. C., Shiau, D., Carney, P. R., Prokopyev, O. A., & Yatsenko, V. A. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0529-4 · Cited by 66 · cited 2×
“Parthasarathy and El-Halwagi (2000) studied a systematic framework for the optimal design of condensation which an important technology for volatile organic compounds, formulated it as a nonconvex MINLP model, proposed an iterative global optimization approach which is based on physical insights and active constraint…”
BackgroundMethodOptimization of hybrid discrete/continuous dynamic systems
Barton, P. I., Banga, J. R., & Galán, S. G. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00586-x · Cited by 66 · cited 1×
“Barton et al. (2000) studied the optimization of hybrid discrete/continuous dynamic systems, presented a framework based on hybrid optimal control, investigated existence and sensitivity results, introduced a modified stochastic search approach, and presented computational results for a tank…”
BackgroundLocating All Homogeneous Azeotropes in Multicomponent Mixtures
Harding, S. T., Maranas, C. D., McDonald, C. M., & Floudas, C. A. (1997) · Industrial & Engineering Chemistry Research · doi:10.1021/ie960305f · Cited by 66 · cited 1×
“They employed the formulations proposed by Harding et al. (1997) and studied systems with activity coefficient and equation of state models.”
MethodSelf-citationlogmip: a disjunctive 0–1 non-linear optimizer for process system models
Vecchietti, A., & Grossmann, I. E. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00293-2 · Cited by 66
Sherali, H. D., Subramanian, S., & Loganathan, G. V. (2001) · Journal of Global Optimization · doi:10.1023/a:1008368330827 · Cited by 65 · cited 1×
“Sherali et al. (2001) studied the water distribution network design problem.”
BackgroundDeterministic global optimization of nonlinear dynamic systems
Lin, Y., & Stadtherr, M. A. (2007) · AIChE Journal · doi:10.1002/aic.11101 · Cited by 65 · cited 2×
“…2007) created a new interval solver for parametric ODEs, which is used to produce guaranteed bounds on the solution of dynamic systems with intervalvalued parameters, and incorporated it within the framework of a global optimization solver for dynamic systems, including optimal control problems.”
MethodOn Saddle Points of Augmented Lagrangians for Constrained Nonconvex Optimization
Sun, X., Li, D., & McKinnon, K. I. M. (2005) · SIAM Journal on Optimization · doi:10.1137/030602770 · Cited by 64
Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents
Sherali, H. D. (1998) · Journal of Global Optimization · doi:10.1023/a:1008249414776 · Cited by 63 · cited 2×
“Sherali (1998) developed a relaxation–linearization technique (RLT) approach for nonconvex polynomial problems that involve mixed-sign coefficients and rational exponents, embedded it in a branch-and-bound framework, and presented suitable branching strategies that induce convergence to the global…”
BackgroundA Global Optimization RLT-based Approach for Solving the Hard Clustering Problem
Sherali, H. D., & Desai, J. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-2706-7 · Cited by 62 · cited 3×
“These include the textbooks by Tuy (1998) on convex analysis, Bard (1998) on bilevel programming, Sherali and Adams (1999) on the reformulation–linearization technique (RLT), Horst et al.”
BackgroundMethodInterval Methods for Semi-Infinite Programs
Bhattacharjee, B., Green, W. H., & Barton, P. I. (2005) · Computational Optimization and Applications · doi:10.1007/s10589-005-4556-8 · Cited by 62 · cited 2×
“Bhattacharjee et al. (2005a) used interval analysis methods to construct a finite reformulation of a semi-infinite program.”
BackgroundMethodBenchmarking Global Optimization and Constraint Satisfaction Codes
Shcherbina, O., Neumaier, A., Sam-Haroud, D., Vu, X.-H., & Nguyen, T.-V. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39901-8_16 · Cited by 62 · cited 1×
“Such collections of problems in local and global optimization can be found in the handbook by Floudas et al. (1999), the benchmark suite compiled by Shcherbina et al. (2003), as well as in other publications (Casado et al. (2003); Ali et al. (2005)).”
Existence and sum decomposition of vertex polyhedral convex envelopes
Tardella, F. (2007) · Optimization Letters · doi:10.1007/s11590-007-0065-2 · Cited by 61 · cited 1×
“Tardella (2008) studied vertex polyhedral convex envelopes, derived sufficient conditions for their existence, and characterized their sum decomposability.”
BackgroundOn the existence of polyhedral convex envelopes
Tardella, F. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_30 · Cited by 61 · cited 1×
“Tardella (2003) studied the class of functions whose convex envelope on a polyhedron coincides with the convex envelope based on the polyhedron vertices, and proved important conditions for a vertex polyhedral convex envelope.”
BackgroundComputational Experience with a New Class of Convex Underestimators: Box-constrained NLP Problems
Akrotirianakis, I. G., & Floudas, C. A. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000044768.75992.10 · Cited by 60 · cited 3×
“Furthermore, Akrotirianakis and Floudas (2004b) presented computational results of the new class of convex underestimators embedded in a branch-and-bound framework for box-constrained NLPs.”
BackgroundMethodSelf-citationFree energy calculations for peptides via deterministic global optimization
Klepeis, J. L., & Floudas, C. A. (1999) · The Journal of Chemical Physics · doi:10.1063/1.478652 · Cited by 60 · cited 2×
“Klepeis and Floudas (1999b) proposed also a novel deterministic global optimization approach for free energy calculations of peptides.”
BackgroundSelf-citationZhu, Y., Wen, H., & Xu, Z. H. (2000) · Chemical Engineering Science · doi:10.1016/s0009-2509(00)00015-4 · Cited by 60 · cited 1×
“Zhu et al. (2000) proposed an enhanced simulated annealing algorithm for the tangent plane stability problem using the PR and SRK cubic equations of state.”
MethodGeneralized branch-and-cut framework for mixed-integer nonlinear optimization problems
Kesavan, P., & Barton, P. I. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00421-x · Cited by 60 · cited 1×
“Kesavan and Barton (2000) introduced a generalized branch-and-cut algorithm for nonconvex MINLPs, showed that decomposition-based approaches and branch-and-bound algorithms are special cases, and proposed a number of heuristics towards addressing the computational efficiency issues.”
BackgroundRelaxation-Based Bounds for Semi-Infinite Programs
Mitsos, A., Lemonidis, P., Lee, C. K., & Barton, P. I. (2008) · SIAM Journal on Optimization · doi:10.1137/060674685 · Cited by 59 · cited 2×
“Mitsos et al. (2008b) developed a global optimization algorithm for bilevel problems with nonconvexities in both the inner and outer programs, presented a KKT-based heuristic for tightening of the lower bounds, extended the method to include branching, and analyzed two branching heuristics.”
BackgroundMethodLocating all transition states and studying the reaction pathways of potential energy surfaces
Westerberg, K. M., & Floudas, C. A. (1999) · The Journal of Chemical Physics · doi:10.1063/1.478850 · Cited by 59
Self-citationAdvances in Convex Analysis and Global Optimization
Hadjisavvas, N., & Pardalos, P. M. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0279-7 · Cited by 58 · cited 1×
“Collection of essays in the area of global optimization were edited by Hadjisavvas and Pardalos (2001), Pardalos and Romeijn (2002), and Audet et al. (2005).”
MethodReliable computation of phase stability using interval analysis
Hua, J. Z., Brennecke, J. F., & Stadtherr, M. A. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00024-6 · Cited by 57 · cited 2×
“Hua et al. (1998a) applied an interval analysis method for the phase stability computations of binary and ternary mixtures using equation of state models.”
MethodGlobal Optimal Structures of Heat Exchanger Networks by Piecewise Relaxation
Bergamini, M. L., Scenna, N. J., & Aguirre, P. A. (2007) · Industrial & Engineering Chemistry Research · doi:10.1021/ie061288p · Cited by 57 · cited 1×
“Bergamini et al. (2007) formulated an MINLP model for the global optimization of heat exchanger networks, and presented a new solution methodology that is based on outer approximation and utilizes piecewise underestimation.”
MethodLucia, Á., & Feng, Y. (2003) · AIChE Journal · doi:10.1002/aic.690491010 · Cited by 57 · cited 1×
“Lucia and Feng (2003) extended the terrain methodology to multivariable problems and integral curve bifurcations associated with valleys and ridges, showed that the terrain methods are superior to arc homotopy continuation in the presence of parametric disconnectedness, and studied examples for the…”
BackgroundSome convexifications in global optimization of problems containing signomial terms
Björk, K.-M., Lindberg, P. O., & Westerlund, T. (2003) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00254-5 · Cited by 56 · cited 1×
“Björk et al. (2003) studied convexifications for signomial terms, introduced properties of power convex functions, compared the effect of the convexification schemes for heat exchanger network problems, and studied quasi-convex convexifications.”
BackgroundDeterministic global optimization for error‐in‐variables parameter estimation
Gau, C., & Stadtherr, M. A. (2002) · AIChE Journal · doi:10.1002/aic.690480607 · Cited by 56 · cited 3×
“Gau and Stadtherr (2002b) studied synchronous work stealing, synchronous and asynchronous diffusive load balancing on a two-dimensional torus virtual network, developed a distributed computing interval Newton framework, and showed that superlinear speedups can be obtained for vapor–liquid…”
BackgroundMethodGlobal Optimization of Bioprocesses using Stochastic and Hybrid Methods
Banga, J. R., Moles, C. G., & Alonso, A. A. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_3 · Cited by 54 · cited 11×
“Banga et al. (2003a) studied integrated process design and operation, parameter estimation in bioprocess models, and focused on stochastic global optimization methods for dynamic systems, addressed handling of constraints in stochastic methods, presented hybrid approaches for dynamic optimization, and presented comput…”
BackgroundMethodInfluentialAb initio Tertiary Structure Prediction of Proteins
Klepeis, J. L., & Floudas, C. A. (2003) · Journal of Global Optimization · doi:10.1023/a:1021331514642 · Cited by 53
Self-citationBlanket Wash Solvent Blend Design Using Interval Analysis
Sinha, M., Achenie, L. E. K., & Gani, R. (2003) · Industrial & Engineering Chemistry Research · doi:10.1021/ie020224l · Cited by 53 · cited 1×
“Sinha et al. (2003) studied the systematic design of cleaning solvent blends for lithographic printing, modelled it as a nonconvex MINLP problem, introduced an interval analysis based global optimization approach with modifications on the upper bounding calculation and the local feasibility test…”
Reliable nonlinear parameter estimation using interval analysis: error-in-variable approach
Gau, C., & Stadtherr, M. A. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00363-x · Cited by 53 · cited 1×
“Gau and Stadtherr (2000) introduced an interval analysis based approach for the error-in-variables method and studied vapor liquid equilibrium and reaction kinetics models.”
MethodReliable Computation of Phase Stability and Equilibrium from the SAFT Equation of State
Xu, G., Brennecke, J. F., & Stadtherr, M. A. (2001) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0101801 · Cited by 53
Applications of global optimization to process and molecular design
Sahinidis, N. V., & Tawarmalani, M. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00583-4 · Cited by 52
Global optimization for H/sub ∞/ control with constant diagonal scaling
Yamada, Y., & Hara, S. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.661067 · Cited by 51 · cited 1×
“2.6 Application-oriented developments Yamada and Hara (1998) proposed a global optimization approach based on the triangle covering for H-infinity control with constant diagonal scaling.”
BackgroundInfluentialAn Algorithm for the Job Shop Scheduling Problem based on Global Equilibrium Search Techniques
Pardalos, P. M., & Shylo, O. V. (2006) · Computational Management Science · doi:10.1007/s10287-006-0023-y · Cited by 51 · cited 1×
“Floudas (2000b) presented a review on global optimization in the design and control of chemical process systems, while Pardalos et al. (2000) presented advances and research trends on deterministic and stochastic global optimization during the nineties.”
BackgroundDesign of process operations using hybrid dynamic optimization
Barton, P. I., & Lee, C. K. (2003) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.09.015 · Cited by 51 · cited 1×
“Barton and Lee (2004) presented a method for constructing convex relaxations of nonconvex NLPs with linear dynamic systems embedded.”
MethodSemi-Infinite Programming and Applications to Minimax Problems
Žaković, S., & Rüstem, B. (2003) · Annals of Operations Research · doi:10.1023/b:anor.0000004764.76984.30 · Cited by 51 · cited 1×
“Zakovic and Rustem (2003) considered solving a minimization SIP problem through a two stage procedure that searches for global maximum violation of the constraints.”
BackgroundNew interval methodologies for reliable chemical process modeling
Gau, C., & Stadtherr, M. A. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00005-4 · Cited by 51 · cited 3×
“Gau and Stadtherr (2002b) studied synchronous work stealing, synchronous and asynchronous diffusive load balancing on a two-dimensional torus virtual network, developed a distributed computing interval Newton framework, and showed that superlinear speedups can be obtained for vapor–liquid…”
BackgroundMethodTrilinear Monomials with Positive or Negative Domains: Facets of the Convex and Concave Envelopes
Meyer, C. A., & Floudas, C. A. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_18 · Cited by 50 · cited 1×
“In a later publication (Meyer and Floudas 2004), they presented the results for the case of mixed-sign domains.”
BackgroundSelf-citationPrediction of critical points: A new methodology using global optimization
Henderson, N., Freitas, L., & Platt, G. M. (2004) · AIChE Journal · doi:10.1002/aic.10119 · Cited by 50 · cited 1×
“Henderson et al. (2004) formulated an optimization problem based on a slight modification of the Gibbs tangent plane criterion, and used a simulated annealing algorithm to solve it.”
MethodOptimization of hybrid systems
Barton, P. I., Lee, C. K., & Yunt, M. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.05.024 · Cited by 49 · cited 1×
“Barton et al. (2006) focused on the solution of optimization problems with continuous time automata embedded, and presented an overview of the control parameterization approach.”
BackgroundA remark on the GOP algorithm for global optimization
Liu, W. B., & Floudas, C. A. (1993) · Journal of Global Optimization · doi:10.1007/bf01096418 · Cited by 49 · cited 1×
“Zlobec (2005) showed that the Liu–Floudas convexification (Liu and Floudas 1993) can be possible for every Lipschitz continuously differentiable function, practically extending the applicability of the GOP algorithm (Floudas and Visweswaran 1990) to almost every smooth program occurring in practice.”
BackgroundSelf-citation
Research works printed but not linked: 2
- Barton P.I., Lee C.K.: Global dynamic optimization of linear time varying hybrid systems. Dyn. Contin. Discrete Impuls. Syst. B. S, 153–158 (2003)
- Prokopyev O.A., Meneses C.N., Oliveira C.A.S., Pardalos P.M.: On multiple-ratio hyperbolic 0-1 programming problems. Pacific J. Optim. 1(2), 327–345 (2005b)
Cited by
Optimal power flow: a bibliographic survey I: Formulations and deterministic methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0056-y · Cited by 554
Non-convex mixed-integer nonlinear programming: A survey
Burer, S., & Letchford, A. N. (2012) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2012.08.001 · Cited by 547
ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations
Misener, R., & Floudas, C. A. (2014) · Journal of Global Optimization · doi:10.1007/s10898-014-0166-2 · Cited by 505
“We therefore limit ourselves to mentioning several excellent review articles and texts [17, 24, 40, 49–52, 54, 63, 64, 101, 103, 113, 136, 145] and hereafter discuss the items most relevant to ANTIGONE.”
BackgroundSelf-citationAbdollahzadeh, B., Khodadadi, N., Barshandeh, S., Trojovský, P., Gharehchopogh, F. S., El-kenawy, E.-S. M., Abualigah, L., & Mirjalili, S. (2024) · Cluster Computing · doi:10.1007/s10586-023-04221-5 · Cited by 479
“Traditional optimization algorithms have constraints including single-based solutions, converging to local optima, and difficulties in unknown search spaces [1].”
Optimal power flow: a bibliographic survey II: Non-deterministic and hybrid methods
Frank, S., Steponavice, I., & Rebennack, S. (2012) · Energy Systems · doi:10.1007/s12667-012-0057-x · Cited by 294
“However, the latest developments in global optimization Floudas and Gounaris [49], have not yet been fully applied to OPF problems.”
Background
Metadata
- Authors
- Floudas, C. A., & Gounaris, C. E.
- Affiliations
- Princeton University (US)
- Corresponding author
- Floudas, C. A.
- ORCID
- Gounaris, C. E.
- Venue
- Journal of Global Optimization
- Published
- 2008-08-12
- Volume
- 45
- Issue
- 1
- Pages
- 3-38
- ISSN
- 0925-5001 (ISSN-L)
- 1573-2916
- OpenAlex
- W2074869363
- Cited by
- 455
- References
- 369
- Citations by year
- 2026: 9 · 2025: 11 · 2024: 9 · 2023: 19 · 2022: 13 · 2021: 28 · 2020: 18 · 2019: 24 · 2018: 36 · 2017: 37 · 2016: 31 · 2015: 38 · 2014: 52 · 2013: 33 · 2012: 39
- FWCI
- 22.63
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Global Optimization (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Keywords
- deterministic global optimization, mixed-integer nonlinear programming, differential-algebraic models, semi-infinite programming, grey-box modeling
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.