Complete search in continuous global optimization and constraint satisfaction
From MaRDI portal
Publication:5292941
DOI10.1017/S0962492904000194zbMath1113.90124WikidataQ90159156 ScholiaQ90159156MaRDI QIDQ5292941
Publication date: 25 June 2007
Published in: Acta Numerica (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
90B40: Search theory
90C51: Interior-point methods
65G30: Interval and finite arithmetic
65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
65Y15: Packaged methods for numerical algorithms
Related Items
An efficient and safe framework for solving optimization problems, A decomposition-based solution method for stochastic mixed integer nonlinear programs, Certified error bounds for uncertain elliptic equations, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Lago: a (heuristic) branch and cut algorithm for nonconvex minlps, A comparison of complete global optimization solvers, Computing expensive multivariate functions of fuzzy numbers using sparse grids, Nonlinear optimization with GAMS /LGO, Determining the positive definiteness margin of interval matrices, Computational experience with rigorous error bounds for the Netlib linear programming library, A verified optimization technique to locate chaotic regions of Hénon systems, An enhanced genetic algorithm for structural topology optimization, Computational Microstructures in Phase Transition Solids and Finite-Strain Elastoplasticity
Uses Software
