Complete search in continuous global optimization and constraint satisfaction
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Packaged methods for numerical algorithms (65Y15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Search theory (90B40) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)
Recommendations
Cited in
(only showing first 100 items - show all)- Enhancing numerical constraint propagation using multiple inclusion representations
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- Basin hopping networks of continuous global optimization problems
- Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
- Chebyshev model arithmetic for factorable functions
- Guided dive for the spatial branch-and-bound
- A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set
- Certificates of infeasibility via nonsmooth optimization
- A certified branch \& bound approach for reliability-based optimization problems
- The cluster problem in constrained global optimization
- A new algorithm for Chebyshev minimum-error multiplication of reduced affine forms
- Domain reduction techniques for global NLP and MINLP optimization
- Global optimization in Hilbert space
- Fixed-order robust \(H_{\infty}\) estimator design for side-slip angle of vehicle
- Integrated stoichiometric, thermodynamic and kinetic modelling of steady state metabolism
- A direct search algorithm for global optimization
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- A comparison of complete global optimization solvers
- Global optimization problems and domain reduction strategies
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- On the efficient Gerschgorin inclusion usage in the global optimization \(\alpha\)BB method
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- On the extension of the \textsc{direct} algorithm to multiple objectives
- A method for global minimization of functions using the Krawczyk operator
- A systematic approach to Kähler moduli stabilisation
- QPLIB: a library of quadratic programming instances
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Some observations on exclusion regions in branch and bound algorithms
- Using a derivative-free optimization method for multiple solutions of inverse transport problems
- Computing expensive multivariate functions of fuzzy numbers using sparse grids
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Nonlinear robust optimization via sequential convex bilevel programming
- 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
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Actuator fault diagnosis for flat systems: a constraint satisfaction approach
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- Symmetry in mathematical programming
- Transformations of interval linear systems of equations and inequalities
- An enhanced genetic algorithm for structural topology optimization
- Global Optimization in Practice:State of the Art and Perspectives
- Computational Microstructures in Phase Transition Solids and Finite-Strain Elastoplasticity
- Convergence analysis of Taylor models and McCormick-Taylor models
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies
- A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function
- Solving set-valued constraint satisfaction problems
- Rigorous filtering using linear relaxations
- Robust Designs for Circle Coverings of a Square
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
- Mathematically rigorous global optimization in floating-point arithmetic
- A CSP versus a zonotope-based method for solving guard set intersection in nonlinear hybrid reachability
- scientific article; zbMATH DE number 869737 (Why is no real title available?)
- On solving mixed-integer constraint satisfaction problems with unbounded variables
- Reverse propagation of McCormick relaxations
- On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function
- Mathematically Rigorous Global Optimization and Fuzzy Optimization
- Rigorous estimation of floating-point round-off errors with symbolic Taylor expansions
- Three enhancements for optimization-based bound tightening
- Derivative-free optimization methods
- Convergence analysis of multivariate McCormick relaxations
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Numerical Software with Result Verification
- Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
- Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design
- On the numerical performance of finite-difference-based methods for derivative-free optimization
- Constraint aggregation for rigorous global optimization
- An extension of the \(\alpha\mathrm{BB}\)-type underestimation to linear parametric Hessian matrices
- Constraint propagation on quadratic constraints
- Robustness analysis of continuous-depth models with Lagrangian techniques
- (Global) optimization: historical notes and recent developments
- A new taxonomy of global optimization algorithms
- Nonsmooth exclusion test for finding all solutions of nonlinear equations
- A Modified Quantum-Inspired Genetic Algorithm for Continuum Structural Topology Optimization
- A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
- Reliable amplitude and frequency estimation for biased and noisy signals
- Optimal value bounds in nonlinear programming with interval data
- Interval constraint programming for globally solving catalog-based categorical optimization
- Convergence rate of McCormick relaxations
- Low dimensional simplex evolution: a new heuristic for global optimization
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Solving the interval eigenvalue problem via optimization and constraint interval theory
- Second-order methods for quartically-regularised cubic polynomials, with applications to high-order tensor methods
- An approach to constrained global optimization based on exact penalty functions
- Solving optimal control problems by exploiting inherent dynamical systems structures
- Automatic source code generation for deterministic global optimization with parallel architectures
- Unifying view on sparse convex relaxations in polynomial optimization
- Interval convex optimization under uncertainty via an admissible order approach
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- The cluster problem revisited
- Minotaur: a mixed-integer nonlinear optimization toolkit
- A review of recent advances in global optimization
- On verified numerical computations in convex programming
- 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
Describes a project that uses
Uses Software
This page was built for publication: Complete search in continuous global optimization and constraint satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5292941)
