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
Items 201–364 of 364
Karuppiah, R., & Grossmann, I. E. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9203-8 · Cited by 48 · 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…”
BackgroundMethodBenchmarking Global Optimization and Constraint Satisfaction Codes
Shcherbina, O., Neumaier, A., Sam-Haroud, D., Vu, X.-H., & Nguyen, T.-V. (2003) · doi:10.3929/ethz-a-010090582 · Cited by 48
Necessary Optimality Conditions for Bilevel Optimization Problems Using Convexificators
Babahadda, H., & Gadhi, N. A. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-1650-5 · Cited by 47 · cited 7×
“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 multiplicity of solutio…”
BackgroundMethodInfluentialLucia, Á., & Feng, Y. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(01)00777-3 · Cited by 47
Fractional programming with convex quadratic forms and functions
Benson, H. P. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.02.069 · Cited by 47
Solving Sum of Ratios Fractional Programs via Concave Minimization
Benson, H. P. (2007) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-007-9199-8 · Cited by 47 · cited 2×
“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.”
BackgroundMethodGlobal optimization of generalized linear fractional programming with nonlinear constraints
Jiao, H., Guo, Y., & Shen, P. (2006) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.05.102 · Cited by 47 · cited 1×
“Jiao et al. (2006) proposed solving generalized linear fractional problems via a branch and bound algorithm that is based on the construction of a linear relaxation.”
BackgroundGlobal mixed‐integer dynamic optimization
Chachuat, B., Singer, A. B., & Barton, P. I. (2005) · AIChE Journal · doi:10.1002/aic.10494 · Cited by 47 · cited 3×
“Chachuat et al. (2005) developed a decomposition approach for a general class of mixed-integer dynamic optimization problems that is capable of guaranteeing convergence to the global solution.”
BackgroundGlobal Optimization in Multiproduct and Multipurpose Batch Design under Uncertainty
Harding, S. T., & Floudas, C. A. (1997) · Industrial & Engineering Chemistry Research · doi:10.1021/ie960696y · Cited by 46 · cited 2×
“These include, representatively, the global optimization of: a multiproduct batch plant under uncertain demands (Harding and Floudas 1997), an NLP problem with 15,636 variables and about the same number of nonconvex terms of the type xexp(y); a generalized pooling problem (Meyer and Floudas 2006),…”
BackgroundSelf-citationA deterministic global optimization algorithm for generalized geometric programming
Wang, Y., & Liang, Z. (2005) · Applied Mathematics and Computation · doi:10.1016/j.amc.2005.01.142 · Cited by 46
Adams, W. P., & Sherali, H. D. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3966-4 · Cited by 46
Sherali, H. D., Al-LOUGHANI, I., & Subramanian, S. (2002) · Operations Research · doi:10.1287/opre.50.3.433.7739 · Cited by 46 · cited 1×
“Sherali et al. (2002) studied the capacitated Euclidean distance location–allocation problems, reported that an RLT approach leads to superior lower bounds than those computed via a projected location space subproblem, tightened further their relaxation by incorporating certain-cut-set inequalities…”
BackgroundA Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
Solodov, M. V. (2007) · SIAM Journal on Optimization · doi:10.1137/050647566 · Cited by 46 · cited 1×
“Solodov (2007) considered the bilevel problem of minimizing a nonsmooth convex function over the set of minimizers of another nonsmooth convex function, and developed a bundle-type algorithm for solving it.”
BackgroundFrom Local to Global Optimization
Migdalas, A., Pardalos, P. M., & Värbrand, P. (2001) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-5284-7 · Cited by 45 · 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…”
BackgroundMeyer, C. A., & Floudas, C. A. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-2704-9 · Cited by 45
Self-citationIntegrated Process Design and Control Via Global Optimization
Moles, C. G., Gutiérrez, G., Alonso, A. A., & Banga, J. R. (2003) · Process Safety and Environmental Protection · doi:10.1205/026387603765444465 · Cited by 44 · cited 1×
“…optimization, and presented computational studies on the optimal control of bioreactors, the integrated design of a waste treatment plant (see also Moles et al. (2003)) where they provided comparisons for several algorithmic approaches, and discussed advances in the parameter estimation of…”
BackgroundTan, M. P., Broach, J. R., & Floudas, C. A. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9140-6 · Cited by 44 · cited 2×
“Tan et al. (2007a) presented a novel clustering approach for use with DNA microarray data.”
MethodSelf-citationInterval-based targeting for pollution prevention via mass integration
Noureldin, M., & El‐Halwagi, M. M. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)00309-9 · Cited by 44 · cited 3×
“Noureldin and El-Halwagi (1999) studied mass integration problems for pollution prevention, proposed targets for the maximum achievable pollution, introduced an interval analysis framework for the determination of these targets, studied the pollution prevention via unit manipulation, recycle and interception, and empl…”
BackgroundInfluentialZhu, Y., & Xu, Z. H. (1999) · Fluid Phase Equilibria · doi:10.1016/s0378-3812(98)00417-8 · Cited by 43 · cited 3×
“Moreover, they used simulated annealing for the stability analysis of liquid-liquid equilibrium systems modeled via the NRTL and UNIQUAC equations for the activity coefficients and studied ternary systems with up to three liquid phases (Zhu and Xu 1999c).”
MethodInfluentialResearch challenges, opportunities and synergism in systems engineering and computational biology
Floudas, C. A. (2005) · AIChE Journal · doi:10.1002/aic.10620 · Cited by 43 · cited 8×
“Caratzoulas and Floudas (2005) proposed novel convex underestimators for trigonometric functions which are trigonometric functions themselves.”
BackgroundMethodInfluentialSelf-citationCasado, L. G., Martínez, J. A., García, I., & Sergeyev, Y. D. (2003) · Journal of Global Optimization · doi:10.1023/a:1022512411995 · Cited by 42 · cited 2×
“Casado et al. (2003) proposed new interval analysis support functions.”
Global Solution of Optimization Problems with Parameter-Embedded Linear Dynamic Systems
Singer, A. B., & Barton, P. I. (2004) · Journal of Optimization Theory and Applications · doi:10.1023/b:jota.0000037606.79050.a7 · Cited by 42 · cited 1×
“Singer and Barton (2003), Singer and Barton (2004) studied the global optimization of integral objective functions subject to ordinary differential equations, derived convex relaxations for the integral based on a pointwise integrand scheme, developed a branch-and-bound global optimization approach…”
BackgroundLinearization method of global optimization for generalized geometric programming
Shen, P. (2004) · Applied Mathematics and Computation · doi:10.1016/j.amc.2003.12.101 · Cited by 42 · cited 2×
“Shen (2005) developed a linearization method for the global optimization of generalized geometric programs (GGPs).”
BackgroundMethodA hybrid global optimization approach for solvent design
Wang, Y., & Achenie, L. E. K. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00118-7 · Cited by 42 · cited 2×
“Wang and Achenie (2002b) studied also the molecular design of solvents for extractive fermentation including solvent attributes such as biocompatibility, inertness and phase splitting, introduced a group contribution framework which results in a nonconvex MINLP model, studied a local MINLP…”
BackgroundOn generalized geometric programming problems with non-positive variables
Tsai, J., Lin, M.-H., & Hu, Y. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2005.11.037 · Cited by 42 · cited 1×
“Li and Tsai (2005), Tsai and Lin (2006), and Tsai et al. (2007) studied generalized GGPs in the presence of non-positive variables, proposed a technique for treating these variables, and provided convexification rules for certain signomial terms.”
BackgroundOn complexity of unconstrained hyperbolic 0–1 programming problems
Prokopyev, O. A., Huang, H.-X., & Pardalos, P. M. (2004) · Operations Research Letters · doi:10.1016/j.orl.2004.05.011 · Cited by 42 · cited 1×
“Prokopyev et al. (2005b) studied also their MILP reformulations, and presented a GRASP-based heuristic for solving cardinality constrained problems.”
BackgroundGounaris, C. E., & Floudas, C. A. (2008) · Journal of Global Optimization · doi:10.1007/s10898-008-9288-8 · Cited by 42 · cited 3×
“The methodology was extended to handle multivariate functions (Gounaris and Floudas 2008b), through appropriate projections of the function’s epigraph into select one-dimensional spaces.”
BackgroundMethodSelf-citationVOLUME-BASED THERMODYNAMICS GLOBAL PHASE STABILITY ANALYSIS
Nichita, D. V., Valencia, C. D. L. A. D., & Gómez, S. (2006) · Chemical Engineering Communications · doi:10.1080/00986440500440165 · Cited by 41 · cited 1×
“Nichita et al. (2006) used the same method to solve the nonconvex phase stability problem that results from the tangent plane distance criterion in terms of the Helmholtz free energy.”
MethodKlepeis, J. L., Pieja, M. J., & Floudas, C. A. (2003) · Computer Physics Communications · doi:10.1016/s0010-4655(02)00735-x · Cited by 41 · 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-citationOptimum mass integration strategies for condensation and allocation of multicomponent VOCs
Parthasarathy, G., & El‐Halwagi, M. M. (2000) · Chemical Engineering Science · doi:10.1016/s0009-2509(99)00382-6 · Cited by 41
A dual extremum principle in thermodynamics
Mitsos, A., & Barton, P. I. (2007) · AIChE Journal · doi:10.1002/aic.11230 · Cited by 41 · cited 1×
“Mitsos and Barton (2007) reinterpreted the Gibbs tangent plane stability criterion via a Lagrangian duality approach, and performed case studies based on the NRTL and UNIQUAC activity coefficient model.”
MethodImplementation and evaluation of random tunneling algorithm for chemical engineering applications
Srinivas, M., & Rangaiah, G. P. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.04.005 · Cited by 40 · cited 1×
“Srinivas and Rangaiah (2006) evaluated their implementation of the random tunneling algorithm on a number of medium sized problems, including VL, LL, and VLL phase equilibrium problems.”
BackgroundHarjunkoski, I., Westerlund, T., & Pörn, R. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)00310-5 · Cited by 40 · cited 1×
“Harjunkoski et al. (1999) studied the trim loss minimization problem for the paper converting industry, formulated it as a nonconvex MINLP, proposed transformations for the bilinear terms that are based on linear representations and convex expressions, studied the reductions of the combinatorial…”
BackgroundGlobal Optimization of Modular Process Flowsheets
Byrne, R. P., & Bogle, I. D. L. (2000) · Industrial & Engineering Chemistry Research · doi:10.1021/ie990619d · Cited by 39 · cited 1×
“Byrne and Bogle (2000) studied the global optimization of modular flowsheeting systems, introduced an approach to modular based process simulation which is based on interval analysis and which can generate interval bounds, derivatives and their bounds for generic input–output modules, proposed a…”
BackgroundDeterministic global optimization in isothermal reactor network synthesis
Esposito, W. R., & Floudas, C. A. (2002) · Journal of Global Optimization · doi:10.1023/a:1013842726210 · Cited by 38
Self-citationAn Iterative Global Optimization Algorithm for Potential Energy Minimization
Moloi, N. P., & Ali, M. M. (2005) · Computational Optimization and Applications · doi:10.1007/s10589-005-4555-9 · Cited by 38 · 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.”
Framework for evaluating the feasibility/operability of nonconvex processes
Goyal, V., & Ierapetritou, M. (2003) · AIChE Journal · doi:10.1002/aic.690490514 · Cited by 38 · cited 2×
“Goyal and Ierapetritou (2003b) studied MINLP models where the objective function is convex, and the constraints are convex, concave or quasi-concave, introduced the simplicial approximation of the convex hull of the feasible region, proposed algorithmic procedures and illustrated them via small…”
BackgroundSufficient conditions and perfect duality in nonconvex minimization with inequality constraints
Gao, D. Y. (2005) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2005.1.53 · Cited by 38 · 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).”
MethodInformation-Guided Genetic Algorithm Approach to the Solution of MINLP Problems
Young, C.-T., Zheng, Y., Yeh, C.-W., & Jang, S. (2007) · Industrial & Engineering Chemistry Research · doi:10.1021/ie060727h · Cited by 37
Hiriart‐Urruty, J., & Ledyaev, Y. S. (1996) · Journal of convex analysis · doi:10.68381/jca03004 · Cited by 37
Optimization of metabolic pathways under stability considerations
Chang, Y., & Sahinidis, N. V. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2004.08.013 · Cited by 36 · cited 1×
“Chang and Sahinidis (2005) studied the optimization of metabolic pathways under stability considerations.”
BackgroundA novel approach to Bilevel nonlinear programming
Tụy, H., Migdalas, A., & Hoai-Phuong, N. T. (2007) · Journal of Global Optimization · doi:10.1007/s10898-006-9093-1 · Cited by 36 · cited 1×
“Tuy et al. (2007) extended their monotonic optimization approach to handle general bilevel programming problems.”
BackgroundA Generic Global Optimization Algorithm for the Chemical and Phase Equilibrium Problem
McKinnon, K. I. M., & Mongeau, M. (1998) · Journal of Global Optimization · doi:10.1023/a:1008298110010 · Cited by 35 · cited 1×
“McKinnon and Mongeau (1998) proposed a generic global optimization approach for the phase and chemical reaction equilibrium problem that is based on interval analysis and combines the stability criterion with the minimization of the Gibbs free energy.”
BackgroundAdvances in Interval Methods for Deterministic Global Optimization in Chemical Engineering
Lin, Y., & Stadtherr, M. A. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000044770.73245.14 · Cited by 35 · cited 2×
“Lin and Stadtherr (2004a) applied their interval-Newton procedure, enhanced by a new LP bounding strategy, on various phase equilibrium problems.”
MethodNonlinear model predictive control using deterministic global optimization
Long, C. E., Polisetty, P. K., & Gatzke, E. P. (2006) · Journal of Process Control · doi:10.1016/j.jprocont.2005.11.001 · Cited by 35 · cited 1×
“Long et al. (2006, 2007) applied a deterministic non-convex optimization method for nonlinear model predictive control of systems that exhibit nonlinear hybrid dynamics.”
MethodNecessary and Sufficient Global Optimality Conditions for Convex Maximization Revisited
Dür, M., Horst, R., & Locatelli, M. (1998) · Journal of Mathematical Analysis and Applications · doi:10.1006/jmaa.1997.5745 · Cited by 34 · cited 1×
“Chinchuluun et al. (2005) developed a new approach for solving concave quadratic programming problems which is based on the improved global optimality conditions of Dur et al. (1998) and Hiriart-Urruty and Ledyav (1996).”
BackgroundOptimization of Polynomial Fractional Functions
Tụy, H., Thach, P. T., & Konno, H. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000035016.74398.e6 · Cited by 34 · cited 1×
“Adjiman et al. (2000) proposed two novel global optimization approaches for nonconvex mixed-integer nonlinear programming problems.”
BackgroundA Branch-and-Bound Approach for Solving a Class of Generalized Semi-infinite Programming Problems
Levitin, E. S., & Tichatschke, R. (1998) · Journal of Global Optimization · doi:10.1023/a:1008245113420 · Cited by 33 · cited 1×
“Levitin and Tichatschke (1998) considered a nonconvex generalized semi-infinite programming problem that involves parametric max-functions in both the objective and the constraints.”
BackgroundGlobal minimization of rational functions and the nearest GCDs
Nie, J., Demmel, J. W., & Gu, M. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9119-8 · Cited by 33 · cited 1×
“Nichita et al. (2004) used the tunneling global optimization method to directly minimize the Gibbs free energy in multiphase equilibria calculations.”
MethodGlobally optimal robust process control
VanAntwerp, J. G., Braatz, R. D., & Sahinidis, N. V. (1999) · Journal of Process Control · doi:10.1016/s0959-1524(99)00012-8 · Cited by 33
On the solution of mixed-integer nonlinear programming models for computer aided molecular design
Ostrovsky, G. M., Achenie, L. E. K., & Sinha, M. (2002) · Computers & Chemistry · doi:10.1016/s0097-8485(02)00049-9 · Cited by 33 · cited 1×
“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…”
BackgroundSolving mixed integer nonlinear programming problems with line-up competition algorithm
Yan, L., Shen, K., & Hu, S. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2004.07.027 · Cited by 33
An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs
Yamamoto, R., & Konno, H. (2007) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-007-9188-y · Cited by 33 · cited 1×
“Yamamoto and Konno (2007) proposed an efficient algorithm for solving convex-convex quadratic fractional programs that combines the classical Dinkelbach approach, the integer programming approach for solving nonconvex quadratic programs, and a standard NLP solver.”
BackgroundLP Strategy for the Interval-Newton Method in Deterministic Global Optimization
Lin, Y., & Stadtherr, M. A. (2004) · Industrial & Engineering Chemistry Research · doi:10.1021/ie034073d · Cited by 33
Stochastic and Global Optimization
Dzemyda, G., Šaltenis, V., & Žilinskas, A. (2002) · Nonconvex optimization and its applications · doi:10.1007/b130735 · Cited by 32
A cutting plane method for minimizing pseudo-convex functions in the mixed integer case
Pörn, R., & Westerlund, T. (2000) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(00)00622-0 · Cited by 32 · cited 1×
“Pörn and Westerlund (2000) introduced procedures for the successive linear approximation of the objective function and line search techniques, proposed a cutting plane method for addressing global MINLP problems that feature pseudo-convex objective function and constraints, studied its convergence…”
MethodNovel approach for the calculation of critical points in binary mixtures using global optimization
Freitas, L., Platt, G. M., & Henderson, N. (2004) · Fluid Phase Equilibria · doi:10.1016/j.fluid.2004.06.063 · Cited by 32 · cited 1×
“Freitas et al. (2004) studied a number of binary mixtures by solving the aforementioned formulation.”
BackgroundGlobal equilibrium search applied to the unconstrained binary quadratic optimization problem
Pardalos, P. M., Prokopyev, O. A., Shylo, O. V., & Shylo, V. P. (2007) · Optimization methods & software · doi:10.1080/10556780701550083 · Cited by 32
A bilinear relaxation based algorithm for concave piecewise linear network flow problems
Nahapetyan, A. G., & Pardalos, P. M. (2007) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2007.3.71 · Cited by 32 · cited 1×
“Nahapetyan and Pardalos (2007) presented a continuous relaxation for the Concave Piecewise Linear Network Flow Problem (CPLNFP), which has a bilinear objective function and network constraints.”
BackgroundAn Adaptive Dual Parametrization Algorithm for Quadratic Semi-infinite Programming Problems
Liu, Y., & Teo, K. L. (2002) · Journal of Global Optimization · doi:10.1023/a:1020234019886 · Cited by 31 · cited 1×
“Liu and Teo (2002) considered quadratic SIP problems with positive definite objective and multiple linear infinite constraints.”
BackgroundComputational implementation of non-linear convex hull reformulation
Sawaya, N. W., & Grossmann, I. E. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.08.002 · Cited by 31 · cited 1×
“Sawaya and Grossmann (2007) also proposed a cutting plane method for solving linear generalized disjunctive programming problems.”
MethodLogic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems
Lee, S.-B., & Grossmann, I. E. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-3451-0 · Cited by 31 · cited 1×
“Lee and Grossmann (2005) presented a review of advances in the area of discrete/ continuous mathematical programming.”
BackgroundSome Transformation Techniques in Global Optimization
Westerlund, T. (2006) · Kluwer Academic Publishers eBooks · doi:10.1007/0-387-30528-9_3 · Cited by 30
Uncertainties in parameter estimation and optimal control in batch distillation
Ulas, S., Diwekar, U. M., & Stadtherr, M. A. (2005) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.03.002 · Cited by 30
Global optimization of linear hybrid systems with explicit transitions
Lee, C. K., Singer, A. B., & Barton, P. I. (2003) · Systems & Control Letters · doi:10.1016/j.sysconle.2003.09.005 · Cited by 30 · cited 2×
“…via binary variables while maintaining the linearity of the dynamical system, derived convex relaxations of Bolza-type functions using recent results for linear time varying continuous systems (Lee et al. 2004), and applied it to benchmark problems and an isothermal plug flow reactor problem.”
BackgroundMethodA branch-and-bound algorithm to globally solve the sum of several linear ratios
Yan-jun, W., Peiping, S., & Liang, Z. (2004) · Applied Mathematics and Computation · doi:10.1016/j.amc.2004.08.016 · Cited by 30
Schafroth, H. D., & Floudas, C. A. (2003) · Proteins Structure Function and Bioinformatics · doi:10.1002/prot.10608 · Cited by 30
Self-citationKlepeis, J. L., Androulakis, I. P., Ierapetritou, M., & Floudas, C. A. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(97)00258-5 · Cited by 28 · 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-citationTight convex underestimators for $${{\mathcal C}^2}$$ -continuous problems: I. univariate functions
Gounaris, C. E., & Floudas, C. A. (2008) · Journal of Global Optimization · doi:10.1007/s10898-008-9287-9 · Cited by 28
Self-citationLinearly Constrained Global Optimization and Stochastic Differential Equations
Parpas, P., Rüstem, B., & Pistikopoulos, E. N. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9026-z · Cited by 27 · cited 1×
“Parpas et al. (2006) proposed a stochastic algorithm for the global optimization of nonconvex functions over a polytope.”
BackgroundLocating All Heterogeneous and Reactive Azeotropes in Multicomponent Mixtures
Harding, S. T., & Floudas, C. A. (2000) · Industrial & Engineering Chemistry Research · doi:10.1021/ie990527o · Cited by 26
Self-citationGlobal Optimization with Nonfactorable Constraints
Meyer, C. A., Floudas, C. A., & Neumaier, A. (2002) · Industrial & Engineering Chemistry Research · doi:10.1021/ie020199j · Cited by 26 · cited 1×
“Meyer et al. (2002) studied the global optimization of problems with nonfactorable constraints for which there does not exist an analytical form, proposed a sampling phase in which the nonfactorable functions and their gradients are sampled and a new blending function is constructed, and presented…”
BackgroundSelf-citationEvaluation Ranges of Functions using Balanced Random Interval Arithmetic
Žilinskas, J., & Bogle, I. D. L. (2003) · Informatica · doi:10.15388/informatica.2003.030 · Cited by 25
Two results on bounding the roots of interval polynomials
Hertz, D., Adjiman, C. S., & Floudas, C. A. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)00292-6 · Cited by 25
Self-citationDistributed Branch and Bound Algorithms for Global Optimization
Androulakis, I. P., & Floudas, C. A. (1999) · The IMA volumes in mathematics and its applications · doi:10.1007/978-1-4612-1492-2_1 · Cited by 25
Self-citationModels and Algorithms for Global Optimization
Törn, A., & Žilinskas, J. (2007) · Springer eBooks · doi:10.1007/978-0-387-36721-7 · Cited by 25 · cited 1×
“…et al. (2001), Dzemyda et al. (2002) that focuses on stochastic methods, Floudas and Pardalos (2003), Liberti and Maculan (2006) that includes implementation discussions and commercial software presentation, as well as by Törn and Zilinskas (2007) on global optimization algorithms of various kinds.”
BackgroundKlepeis, J. L., Schafroth, H. D., Westerberg, K. M., & Floudas, C. A. (2002) · Advances in chemical physics · doi:10.1002/0471224421.ch7 · Cited by 24 · cited 1×
“Klepeis et al. (2002) presented the advances in deterministic global optimization based on the αBB approach and its applications for structure prediction of oligopeptides, dynamics of helical formation, and protein–peptide interactions.”
BackgroundSelf-citationGlobal optimisation of constrained non-convex programs using reformulation and interval analysis
Byrne, R. P., & Bogle, I. D. L. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(99)00295-1 · Cited by 24 · cited 1×
“Byrne and Bogle (1999) introduced a bound constrained linear relaxation, developed two classes of linear underestimators using the natural extension and mean value theorems of interval analysis, and showed that the interval LP is more efficient than other interval analysis approaches.”
BackgroundComparative study of global minimum energy conformations of hydrated peptides
Klepeis, J. L., & Floudas, C. A. (1999) · Journal of Computational Chemistry · doi:10.1002/(sici)1096-987x(19990430)20:6<636::aid-jcc10>3.0.co;2-d · Cited by 24
Self-citationDeterministic global optimization for nonlinear model predictive control of hybrid dynamic systems
Long, C. E., Polisetty, P. K., & Gatzke, E. P. (2006) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1105 · Cited by 24 · cited 1×
“Long et al. (2006, 2007) applied a deterministic non-convex optimization method for nonlinear model predictive control of systems that exhibit nonlinear hybrid dynamics.”
MethodGlobal optimization for the sum of generalized polynomial fractional functions
Shen, P., & Gui-Xia, Y. (2007) · Mathematical Methods of Operations Research · doi:10.1007/s00186-006-0130-0 · Cited by 24 · cited 1×
“Shen and Yuan (2007) proposed a branch and bound approach for the global optimization problem of the sum of generalized polynomial fractional functions under generalized polynomial constraints.”
BackgroundColumn enumeration based decomposition techniques for a class of non-convex MINLP problems
Rebennack, S., Kallrath, J., & Pardalos, P. M. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9271-9 · Cited by 24
A New Quadratic Semi-infinite Programming Algorithm Based on Dual Parametrization
Liu, Y., Teo, K. L., & Wu, S. Y. (2004) · Journal of Global Optimization · doi:10.1023/b:jogo.0000047910.80739.95 · Cited by 23
Yushan, Z., & Zhihong, X. (1999) · Fluid Phase Equilibria · doi:10.1016/s0378-3812(99)00173-9 · Cited by 23
Global Solution Approach for a Nonconvex MINLP Problem in Product Portfolio Optimization
Lin, X., Floudas, C. A., & Kallrath, J. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-5903-5 · Cited by 23 · cited 1×
“Lin et al. (2005) revisited the nonconvex product portfolio problem introduced by Kallrath (2003), presented an improved formulation consisting of a concave objective function with linear constraints in the continuous and binary variables, proposed several techniques for tightening the model and…”
BackgroundSelf-citationGlobal Optimization for Integrated Design and Control of Computationally Expensive Process Models
Egea, J. A., Vries, D., Alonso, A. A., & Banga, J. R. (2007) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0705094 · Cited by 22
Zhu, Y., & Inoue, K. (2001) · Chemical Engineering Science · doi:10.1016/s0009-2509(01)00336-0 · Cited by 22
Linearity Embedded in Nonconvex Programs
Liberti, L. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-0864-2 · Cited by 22 · cited 2×
“Liberti (2005) developed an automatic symbolic reformulation procedure that can uncover linearity that is embedded in bilinear programs and thus simplify such formulations.”
BackgroundParallel Computing in Global Optimization
Apuzzo, M. D., Marino, M., Migdalas, A., Pardalos, P. M., & Toraldo, G. (2005) · Statistics, a series of textbooks and monographs · doi:10.1201/9781420028683.ch7 · Cited by 22
Casado, L. G., García, I., & Sergeyev, Y. D. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599357590 · Cited by 21 · cited 4×
“Casado et al. (2002) developed three new algorithms based on interval analysis and branch-and-bound global optimization approaches to solve the problem of finding the smallest root of an one-dimensional function. The novelty of these methods is in improving the elimination criteria and the order in which interval and…”
BackgroundMethodInfluentialTreating Free Variables in Generalized Geometric Global Optimization Programs
Li, H.-L., & Tsai, J. (2005) · Journal of Global Optimization · doi:10.1007/s10898-005-2098-3 · Cited by 21 · cited 2×
“Li and Tsai (2005), Tsai and Lin (2006), and Tsai et al. (2007) studied generalized GGPs in the presence of non-positive variables, proposed a technique for treating these variables, and provided convexification rules for certain signomial terms.”
BackgroundResultSafe and tight linear estimators for global optimization
Borradaile, G., & Hentenryck, P. V. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0533-8 · Cited by 21 · cited 3×
“Bringas et al. (2007) worked on the optimal design of groundwater remediation networks that use selective membranes for the valorization of anionic pollutants.”
BackgroundMethodProduct Disaggregation in Global Optimization and Relaxations of Rational Programs
Tawarmalani, M., & Sahinidis, N. V. (2002) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3532-1_3 · Cited by 21 · 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,…”
BackgroundInfluentialCharacterization of convexifiable functions
Zlobec, S. (2006) · Optimization · doi:10.1080/02331930600711968 · Cited by 20 · cited 1×
“Zlobec (2006) also worked on the characterization of convexifiable functions by developing necessary and sufficient conditions for the decomposition of a function into a sum of a convex and a quadratic concave function.”
BackgroundAn optimization approach for solving signomial discrete programming problems with free variables
Tsai, J., & Lin, M.-H. (2006) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2006.02.013 · Cited by 20 · cited 2×
“Li and Tsai (2005), Tsai and Lin (2006), and Tsai et al. (2007) studied generalized GGPs in the presence of non-positive variables, proposed a technique for treating these variables, and provided convexification rules for certain signomial terms.”
BackgroundMethodZhu, Y., & Kuno, T. (2003) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0200813 · Cited by 20 · cited 1×
“Zhu and Kuno (2003) proposed a hybrid global optimization method for nonconvex MINLPs which combines convex quadratic underestimation techniques with a revised form of the generalized Benders decomposition, suggested its convergence properties, and illustrated it via a two variable problem.”
BackgroundOn the Liu–Floudas Convexification of Smooth Programs
Zlobec, S. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-3134-4 · Cited by 20 · 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.”
BackgroundAnalysis and design of suitable model structures for activated sludge tanks with circulating flow
Alex, J., Tschepetzki, R., Jumar, U., Obenaus, F., & Rosenwinkel, K. ‐. (1999) · Water Science & Technology · doi:10.1016/s0273-1223(99)00053-0 · Cited by 20 · 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).”
MethodSherali, H. D., Smith, J. C., & Adams, W. P. (2000) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(99)00225-5 · Cited by 20 · cited 1×
“Sherali et al. (2000) explored the generation of reduced first-level RLT representations, showed that there exist representations with about half the constraints of the full firstlevel representation whose relaxations yield the same lower bound value, and argued that an accurate a priori prediction…”
BackgroundA reduced dimension branch-and-bound algorithm for molecular design
Ostrovsky, G. M., Achenie, L. E. K., & Sinha, M. (2003) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00233-8 · Cited by 19 · cited 1×
“Ostrovsky et al. (2003) revisited their molecular design reduced dimension branch-andbound algorithm by studying further the branching functions concept and the special tree function representation, proposed the sweep method for the construction of the linear underestimators, investigated the…”
BackgroundGounaris, C. E., & Floudas, C. A. (2008) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-008-9402-6 · Cited by 19 · cited 3×
“The methodology was extended to handle multivariate functions (Gounaris and Floudas 2008b), through appropriate projections of the function’s epigraph into select one-dimensional spaces.”
BackgroundMethodSelf-citationLocal saddle point and a class of convexification methods for nonconvex optimization problems
Li, T., Wang, Y., Liang, Z., & Pardalos, P. M. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9090-4 · Cited by 19
Trigonometric Convex Underestimator for the Base Functions in Fourier Space
Caratzoulas, S., & Floudas, C. A. (2005) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-004-0940-2 · Cited by 19 · cited 1×
“Caratzoulas and Floudas (2005) proposed novel convex underestimators for trigonometric functions which are trigonometric functions themselves.”
BackgroundSelf-citationGeletu, A., & Hoffmann, A. (2003) · European Journal of Operational Research · doi:10.1016/j.ejor.2003.08.009 · Cited by 18 · cited 1×
“Geletu and Hoffmann (2004) outlined theoretical considerations for determining coarse approximations of a solution of a generalized semi-infinite programming problem via global optimization of an exact discontinuous penalty approach.”
BackgroundAccelerating convergence of cutting plane algorithms for disjoint bilinear programming
Ding, X., & Al‐Khayyal, F. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9091-3 · Cited by 18 · cited 1×
“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.”
BackgroundLi, D., Wu, Z., Lee, J. H. W., Yang, X., & Zhang, L. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-5697-5 · Cited by 18 · cited 1×
“Li et al. (2005) discussed nonconvex minimization problems that can be equivalently transformed into convex ones, and thus be globally solved by use of only local techniques.”
BackgroundZhu, Y., & Kuno, T. (2005) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0402719 · Cited by 18 · cited 1×
“Zhu and Kuno (2006) developed a cutting-plane branch-and-cut algorithm for the solution of convex MINLPs.”
BackgroundAmaral, P. A., Júdice, J. J., & Sherali, H. D. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2006.08.007 · Cited by 18
Convex underestimation for posynomial functions of positive variables
Li, H.-L., Tsai, J., & Floudas, C. A. (2007) · Optimization Letters · doi:10.1007/s11590-007-0061-6 · Cited by 18 · cited 2×
“The results also provide insight on why transformations already proposed in the literature, like the exponential (Maranas and Floudas 1997) or the reciprocal (Li et al. 2008), actually work in the convexification of posynomial programs.”
BackgroundSelf-citationGlobal Optimization of Bilevel Programming Problems via Parametric Programming
Pistikopoulos, E. N., Dua, V., & Ryu, J.-H. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_25 · Cited by 17 · cited 1×
“Pistikopoulos et al. (2003) studied bilevel optimization models which are of linear–linear, linear–quadratic, quadratic–linear, or quadratic–quadratic type, and introduced approaches from parametric programming to transform the bilevel problem into a family of single level optimization problems…”
BackgroundThe phase behavior of n-alkane systems
Lucia, Á., DiMaggio, P. A., Bellows, M. L., & Octavio, L. M. (2005) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2005.05.016 · Cited by 17 · cited 1×
“Lucia et al. (2005) incorporated new ideas within the terrain methods to study the phase stability and equilibrium of n-alkanes.”
BackgroundGlobal Optimization in the COCONUT Project
Schichl, H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24738-8_14 · Cited by 16 · cited 2×
“(2005) to perform a computational comparison between eight global optimization solvers with the help of the COCONUT environment (Schichl 2004).”
MethodComparisons of solving a chromatographic separation problem using MINLP methods
Emet, S., & Westerlund, T. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2004.02.010 · Cited by 16 · cited 1×
“Emet and Westerlund (2004) conducted a computational comparison of solving a cyclic chromatographic separation problem using MINLP methods, and reported that the extended cutting plane (ECP) method compares favourably against traditional outer approximation and branch-and-bound methods.”
BackgroundTan, M. P., Broach, J. R., & Floudas, C. A. (2007) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720007002941 · Cited by 16
Self-citationGlobal Optimization: Local Minima and Transition Points
Floudas, C. A., & Jongen, H. T. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-0865-1 · Cited by 16 · 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-citationNichita, D. V., Gómez, S., & Luna‐Ortiz, E. (2004) · Journal of Canadian Petroleum Technology · doi:10.2118/04-05-tn2 · Cited by 16 · cited 1×
“Nichita et al. (2004) used the tunneling global optimization method to directly minimize the Gibbs free energy in multiphase equilibria calculations.”
MethodPhase Behavior and Reliable Computation of High-Pressure Solid−Fluid Equilibrium with Cosolvents
Scurto, A. M., Xu, G., Brennecke, J. F., & Stadtherr, M. A. (2003) · Industrial & Engineering Chemistry Research · doi:10.1021/ie030161m · Cited by 16 · cited 1×
“Scurto et al. (2003) developed a methodology to predict the behavior of high-pressure solid-fluid equilibrium systems with cosolvents, where the likelihood of formation of more than two phases is great.”
MethodA Global Optimization RLT-based Approach for Solving the Fuzzy Clustering Problem
Sherali, H. D., & Desai, J. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-7390-0 · Cited by 16 · 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.”
BackgroundMethodA New Approach in Deterministic Global Optimisation of Problems with Ordinary Differential Equations
Chachuat, B., & Latifi, M. A. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_5 · Cited by 15
A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
Nahapetyan, A. G., & Pardalos, P. M. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2006.09.003 · Cited by 15 · cited 1×
“Nahapetyan and Pardalos (2008) suggested a bilinear reduction of the original MILP formulation of the capacitated multi-item dynamic pricing problem, and proposed a heuristic algorithm to solve effectively the equivalent bilinear problem.”
BackgroundA mixed-integer optimization framework for the synthesis and analysis of regulatory networks
Foteinou, P. T., Yang, E., Saharidis, G. K. D., Ierapetritou, M., & Androulakis, I. P. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9266-6 · Cited by 15
A homotopy interior point method for semi-infinite programming problems
Liu, G. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9077-1 · Cited by 15 · cited 1×
“Liu (2007) presented a homotopy interior point method for globally solving semi-infinite programs.”
MethodA Computational Study of Global Algorithms for Linear Bilevel Programming
de Sabóia, C. H. M., Campêlo, M. B., & Scheimberg, S. (2004) · Numerical Algorithms · doi:10.1023/b:numa.0000021760.62160.a4 · Cited by 15 · cited 1×
“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.”
BackgroundDynamic load balancing for parallel interval-Newton using message passing
Gau, C., & Stadtherr, M. A. (2002) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00006-6 · Cited by 15 · cited 4×
“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…”
BackgroundMethodInfluentialA Pseudo-Global Optimization Approach with Application to the Design of Containerships
Sherali, H. D., & Ganesan, V. (2003) · Journal of Global Optimization · doi:10.1023/a:1024792717467 · Cited by 14 · cited 1×
“Sherali and Ganesan (2003) presented a pseudo-global optimization approach to address black-box problems.”
BackgroundGhosh, S. S., Zhu, T., Grossmann, I. E., Ataai, M. M., & Domach, M. M. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2004.08.027 · Cited by 14 · cited 1×
“Ghosh et al. (2005) studied mixed-integer formulations for the identifications of metabolic network fluxes via NMR data.”
BackgroundPeeling Off a Nonconvex Cover of an Actual Convex Problem: Hidden Convexity
Wu, Z., Li, D., Zhang, L. S., & Yang, X. (2007) · SIAM Journal on Optimization · doi:10.1137/050648584 · Cited by 14 · cited 2×
“General convexification and concavification methods were proposed for some classes of monotone (Wu et al. 2005a) and non-monotone (Wu et al. 2005b) optimization problems, which convert them into the better structured classes of concave minimization, d.c. programming, and reverse convex programming…”
MethodResultConvexification and Concavification for a General Class of Global Optimization Problems
Wu, Z., Bai, F., & Zhang, L. S. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-0569-6 · Cited by 14 · cited 1×
“General convexification and concavification methods were proposed for some classes of monotone (Wu et al. 2005a) and non-monotone (Wu et al. 2005b) optimization problems, which convert them into the better structured classes of concave minimization, d.c. programming, and reverse convex programming…”
MethodJiang, A., Pan, W., Milbauer, L. C., Shyr, Y., & Hebbel, R. P. (2007) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s0219720007002989 · Cited by 14
Information-guided genetic algorithm approach to the solution of MINLP problems
Young, Zheng, Z., Yeh, Y., & Jang (2007) · 中国生物学文摘 · Cited by 14
Exact Computation of Global Minima of a Nonconvex Portfolio Optimization Problem
Kallrath, J. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_13 · Cited by 13
On an Efficient Use of Gradient Information for Accelerating Interval Global Optimization Algorithms
Martínez, J. A., Casado, L. G., García, I., Sergeyev, Y. D., & G.-Tóth, B. (2004) · Numerical Algorithms · doi:10.1023/b:numa.0000049456.81410.fc · Cited by 13
On the functional form of convex underestimators for twice continuously differentiable functions
Floudas, C. A., & Крейнович, В. (2006) · Optimization Letters · doi:10.1007/s11590-006-0003-8 · Cited by 13
Self-citationGlobal minimization algorithms for concave quadratic programming problems
Chinchuluun, A., Pardalos, P. M., & Enkhbat, R. (2005) · Optimization · doi:10.1080/02331930500342534 · Cited by 13 · cited 1×
“Chinchuluun et al. (2005) developed a new approach for solving concave quadratic programming problems which is based on the improved global optimality conditions of Dur et al. (1998) and Hiriart-Urruty and Ledyav (1996).”
BackgroundVaia, A., & Sahinidis, N. V. (2003) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(02)00262-4 · Cited by 13 · cited 1×
“Vaia and Sahinidis (2003) studied the simultaneous parameter estimation and model structure identification in infrared spectroscopy, proposed two methods out of which the second corresponds to a single nonconvex MINLP model, presented a branch-and-bound approach which is based on a relaxation of…”
BackgroundFinding all solutions of systems of nonlinear equations with free variables
Tsai, J., & Lin, M.-H. (2007) · Engineering Optimization · doi:10.1080/03052150701243853 · Cited by 12 · cited 1×
“Tsai and Lin (2007) applied this work and developed an algorithm to find all solutions of systems of nonlinear equations with free variables.”
BackgroundA RELIABLE METHOD FOR LIQUID-LIQUID PHASE EQUILIBRIUM CALCULATION AND GLOBAL STABILITY ANALYSIS
YUSHAN, Z., & Xu, Z.-H. (1999) · Chemical Engineering Communications · doi:10.1080/00986449908912150 · Cited by 12
Global optimization of robust chance constrained problems
Parpas, P., Rüstem, B., & Pistikopoulos, E. N. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9244-z · Cited by 12 · cited 3×
“Pörn and Westerlund (2000) introduced procedures for the successive linear approximation of the objective function and line search techniques, proposed a cutting plane method for addressing global MINLP problems that feature pseudo-convex objective function and constraints, studied its convergence properties and initi…”
BackgroundMethodSynthesis of Biotechnological Processes Using Generalized Disjunctive Programming
Montagna, J. M., Iribarren, O. A., & Vecchietti, A. (2004) · Industrial & Engineering Chemistry Research · doi:10.1021/ie0499005 · Cited by 11 · cited 1×
“Montagna et al. (2004) formulated a generalized disjunctive programming model to address the problem of synthesis of a biotechnological process in which a set of biotechnological products must be elaborated.”
BackgroundCheung, A., Adjiman, C. S., Kolar, P., & Ishikawa, T. (2002) · Fluid Phase Equilibria · doi:10.1016/s0378-3812(01)00780-4 · Cited by 11 · cited 1×
“Cheung et al. (2002) studied the global minimum determination of clusters for the solvent-solute interactions in phase equilibrium.”
BackgroundOptimal Groundwater Remediation Network Design Using Selective Membranes
Bringas, E., Karuppiah, R., Román, M. F. S., Ortíz, I., & Grossmann, I. E. (2007) · Industrial & Engineering Chemistry Research · doi:10.1021/ie061325c · Cited by 11 · cited 3×
“…variables, 52 continuous variables, and nonconvexities that appear in the form of 156 distinct bilinear terms; a groundwater remediation network (Bringas et al. 2007), a simplified version of which amounted to an NLP formulation with 133 variables and 110 constraints that include 114 bilinear…”
BackgroundA regional convexity test for global optimization
Meyer, C. A., & Swartz, C. L. E. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)80031-8 · Cited by 10 · cited 1×
“Meyer and Swartz (1998) proposed a new approach for testing convexity for phase equilibrium problems.”
BackgroundA Sequential Convexification Method (SCM) for Continuous Global Optimization
Zhu, W., & Qing-xiang, F. (2003) · Journal of Global Optimization · doi:10.1023/a:1023031513471 · Cited by 10
Towards Optimal Techniques for Solving Global Optimization Problems: Symmetry-Based Approach
Floudas, C. A., & Крейнович, В. (2007) · Springer eBooks · doi:10.1007/978-0-387-36721-7_2 · Cited by 9
Self-citationWesterberg, K. M., & Floudas, C. A. (1999) · Journal of Global Optimization · doi:10.1023/a:1008341702093 · Cited by 9
Self-citationPapamichail, I., & Adjiman, C. S. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-6100-2 · Cited by 9 · cited 1×
“They also presented a proof of convergence in a separate publication (Papamichail and Adjiman 2005).”
BackgroundPartial convexification cuts for 0–1 mixed-integer programs
Sherali, H. D., Lee, Y., & Kim, Y. (2004) · European Journal of Operational Research · doi:10.1016/j.ejor.2002.09.002 · Cited by 9 · cited 1×
“Sherali et al. (2005) proposed a new cutting plane methodology that is based on the construction of a partial convex hull representation for a given 0–1 mixedinteger programming problem by using the reformulation–linearization technique (RLT).”
MethodAnalysis and design of suitable model structures for activated sludge tanks with circulating flow
Alex, J., Tschepetzki, R., Jumar, U., et al. (1999) · Water Science & Technology · doi:10.2166/wst.1999.0189 · Cited by 9
Improved scatter search for the global optimization of computationally expensive dynamic models
Egea, J. A., Vázquez, E., Banga, J. R., & Martı́, R. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9172-y · Cited by 9 · cited 1×
“Egea et al. (2008) developed a new algorithm for the global optimization of costly nonlinear continuous problems.”
A Study of Local Solutions in Linear Bilevel Programming
Campêlo, M. B., & Scheimberg, S. (2005) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-004-1711-9 · Cited by 8 · cited 1×
“Campelo and Scheimberg (2005) studied the linear bilevel problem and derived the characterization of a strict local solution.”
BackgroundA Nonlinear Transformation Based Hybrid Evolutionary Method for MINLP Solution
Munawar, S. A., & Gudi, R. D. (2005) · Process Safety and Environmental Protection · doi:10.1205/cherd.04286 · Cited by 8 · cited 1×
“Munawar and Gudi (2005) proposed a hybrid method that combines stochastic and deterministic approaches to improve the convergence rate of differential evolution (DE) algorithms, and utilized a nonlinear transformation proposed in the literature so as to more effectively take into account the…”
BackgroundHadjisavvas, N., & Pardalos, P. M. (2012) · Cited by 7
MINLP Optimization Using Simplicial Approximation Method for Classes of Non-Convex Problems
Goyal, V., & Ierapetritou, M. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_10 · Cited by 6
Global Solution of Optimization Problems with Dynamic Systems Embedded
Singer, A. B., & Barton, P. I. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_26 · Cited by 6 · cited 1×
“Singer and Barton (2003), Singer and Barton (2004) studied the global optimization of integral objective functions subject to ordinary differential equations, derived convex relaxations for the integral based on a pointwise integrand scheme, developed a branch-and-bound global optimization approach…”
BackgroundGlobal Dynamic Optimization of Linear Hybrid Systems
Lee, C. K., & Barton, P. I. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_16 · Cited by 5 · cited 1×
“Lee and Barton (2003) studied the global optimization of linear time varying hybrid systems which exhibit both discrete state and continuous state behavior, and extended their recently developed approach for the determination of the optimal mode sequence when the transition times are fixed (Barton…”
BackgroundA Deterministic Global Optimization Algorithm for Problems with Nonlinear Dynamics
Adjiman, C. S., & Papamichail, I. (2004) · Nonconvex optimization and its applications · doi:10.1007/978-1-4613-0251-3_1 · Cited by 5 · cited 3×
“Adjiman and Papamichail (2003) developed further their branch-and-bound approach, proposed three convex relaxations for the parameter estimation of the initial value problem, and presented computational results on several parameter estimation problems in kinetics. Singer and Barton (2003), Singer and Barton (2004) stu…”
BackgroundInfluentialA class of convexification and concavification methods for non-monotone optimization problems
Wu, Z., Lee, J. H. W., & Yang, X. (2005) · Optimization · doi:10.1080/02331930500342807 · Cited by 5 · cited 1×
“General convexification and concavification methods were proposed for some classes of monotone (Wu et al. 2005a) and non-monotone (Wu et al. 2005b) optimization problems, which convert them into the better structured classes of concave minimization, d.c. programming, and reverse convex programming…”
MethodMolecular conformation of n-alkanes using terrain/funneling methods
Gattupalli, R. R., & Lucia, Á. (2007) · Journal of Global Optimization · doi:10.1007/s10898-007-9206-5 · Cited by 5 · cited 1×
“Chachuat et al. (2005) developed a decomposition approach for a general class of mixed-integer dynamic optimization problems that is capable of guaranteeing convergence to the global solution.”
BackgroundEsposito, W. R., & Floudas, C. A. (2000) · Industrial & Engineering Chemistry Research · doi:10.1021/ie000864t · Cited by 4 · cited 1×
“Esposito and Floudas (2001) pointed out the theoretical rigor and advantages of the proposed global optimization methods by Esposito and Floudas (2000a) and the differences between local search approaches and global optimization methods.”
BackgroundSelf-citationImprove-and-Branch Algorithm for the Global Optimization of Nonconvex NLP Problems
Marcovecchio, M. G., Bergamini, M. L., & Aguirre, P. A. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-4386-3 · Cited by 4 · cited 1×
“Marcovecchio et al. (2006) presented a new algorithm for nonconvex NLPs that is based on the solution of two problems, called the reformulated and the main problem.”
Frits, E. R., Markót, M. C., Lelkes, Z., Fonyó, Z., Csendes, T., & Rév, E. (2007) · Journal of Global Optimization · doi:10.1007/s10898-006-9111-3 · Cited by 3 · cited 5×
“Gau and Stadtherr (2002a) studied the computational improvement of interval Newton with generalized bisection approaches, introduced a hybrid preconditioning strategy where a pivoting preconditioner is combined with the standard inverse midpoint method, and showed that this approach results in a large reduction of the…”
MethodInfluentialStochastic and Global Optimization (Nonconvex Optimization and Its Applications)
Dzemyda, G., Šaltenis, V., & Žilinskas, A. (2006) · Springer eBooks · Cited by 2
Comments on “Global Optimization for the Parameter Estimation of Differential-Algebraic Systems”
Luus, R. (2000) · Industrial & Engineering Chemistry Research · doi:10.1021/ie000602r · Cited by 2
Locating All Homogeneous Azeotropes
Floudas, C. A. (2000) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-4949-6_24 · Cited by 1 · 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-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.