An analytical approach to global optimization
From MaRDI portal
Publication:1181733
DOI10.1007/BF01582889zbMath0747.90091OpenAlexW2044384850MaRDI QIDQ1181733
Shi Hui Lu, Brigitte Jaumard, Pierre Hansen
Publication date: 27 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582889
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations, Nonlinear coordinate transformations for unconstrained optimization. I: Basic transformations, Theoretical and computational results about optimality-based domain reductions, A reformulation-convexification approach for solving nonconvex quadratic programming problems, A branch-and-reduce approach to global optimization, Alternative branching rules for some nonconvex problems, Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization, Domain reduction techniques for global NLP and MINLP optimization, Global optimization problems and domain reduction strategies, Application of CASs to iterative solution of nonlinear analysis of shallow conical shell, Iterative analytical solution of nonlinear analysis of shallow spherical shell with computer algebra systems--MapleV, What can interval analysis do for global optimization?, Reverse propagation of McCormick relaxations, Investigating a hybrid simulated annealing and local search algorithm for constrained optimization, Convergence qualification of adaptive partition algorithms in global optimization, Time-optimal velocity planning by a bound-tightening technique, Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background, NEW SIMULATED ANNEALING ALGORITHMS FOR CONSTRAINED OPTIMIZATION, Remarks on solutions to a nonconvex quadratic programming test problem, Tighter McCormick relaxations through subgradient propagation, Improve-and-branch algorithm for the global optimization of nonconvex NLP problems, Monotonic reformulation and bound tightening for global optimization of ideal multi-component distillation columns, An approximate approach of global optimization for polynomial programming problems, The solution of infinitely ill-conditioned weakly-singular problems, New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints, Primal-relaxed dual global optimization approach, A priority measure in interval methods for constrained global optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the range of values of real functions with accuracy higher than second order
- Concave minimization via conical partitions and polyhedral outer approximation
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- On the convergence of global methods in multiextremal optimization
- An algorithm for global optimization of Lipschitz continuous functions
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Inclusion functions and global optimization. II
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- More test examples for nonlinear programming codes
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
- Global optimization using interval analysis - the multi-dimensional case
- Test examples for nonlinear programming codes
- Integral global optimization. Theory, implementation and applications
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A Way to Simplify Truth Functions
- The determination of the location of the global maximum of a function in the presence of several local extrema
- A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
- An algorithm for finding the global maximum of a multimodal, multivariate function
- The Tunneling Algorithm for the Global Minimization of Functions
- Censored Discrete Linear $l_1 $ Approximation
- Global optimization under Lipschitzian constraints
- Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Some NP-complete problems in quadratic and nonlinear programming
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- Global Optimization Approach to the Linear Complementarity Problem
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- Analytical Optimization Using Computer Algebraic Manipulation
- Global optimization using special ordered sets
- A set of geometric programming test problems and their solutions
- Automatic Categorization of Optimization Problems: An Application of Computer Symbolic Mathematics
- An algorithm for finding the absolute extremum of a function
