Global Optimization and Constraint Satisfaction
From MaRDI portal
Publication:5897050
DOI10.1007/b94062zbMath1296.90004OpenAlexW2624301280MaRDI QIDQ5897050
Djamila Sam-Haroud, Arnold Neumaier, Tuan-Viet Nguyen, Xuan-Ha Vu, Oleg A. Shcherbina
Publication date: 2 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94062
Nonconvex programming, global optimization (90C26) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
Linear and parabolic relaxations for quadratic constraints, A review of recent advances in global optimization, Improved constraint consensus methods for seeking feasibility in nonlinear programs, Best practices for comparing optimization algorithms, A general framework for convexity analysis in deterministic global optimization, Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space, A DIRECT-type approach for derivative-free constrained global optimization, A robust approach for finding all well-separated solutions of sparse systems of nonlinear equations, Benchmarking nonlinear optimization software in technical computing environments, A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms, Solving kinematics problems by efficient interval partitioning, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Efficient interval partitioning-local search collaboration for constraint satisfaction, A reliable affine relaxation method for global optimization, Reverse propagation of McCormick relaxations, Efficient interval partitioning for constrained global optimization, Global optimization test problems based on random field composition, On rigorous upper bounds to a global optimum, Exclusion regions for optimization problems, Efficient computation of spectral bounds for Hessian matrices on hyperrectangles for global optimization, First order rejection tests for multiple-objective optimization, Improved Automatic Computation of Hessian Matrix Spectral Bounds, Rigorous verification of feasibility, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, Convergent upper bounds in global minimization with nonlinear equality constraints, On tightness and anchoring of McCormick and other relaxations, A comparison of complete global optimization solvers, Filter-based DIRECT method for constrained global optimization, Constrained circles packing test problems: all the optimal solutions known, Constraint aggregation for rigorous global optimization, Node selection strategies in interval branch and bound algorithms, Evaluating ASP and commercial solvers on the CSPLib, A derivative-free algorithm for constrained global optimization based on exact penalty functions, The optimization test environment
Uses Software
