A reliable affine relaxation method for global optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4185412
- A global optimization algorithm using parametric linearization relaxation
- Reformulation and convex relaxation techniques for global optimization
- scientific article; zbMATH DE number 5669891
- A global method for relaxation
- scientific article; zbMATH DE number 1822478
- A global optimization algorithm using linear relaxation
- A global optimization using linear relaxation for generalized geometric programming
- A trust-region algorithm for global optimization
- scientific article; zbMATH DE number 749354
Cites work
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 3473200 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 1408651 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- A Deterministic Global Optimization Algorithm for Design Problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A comparison of complete global optimization solvers
- A general reliable quadratic form: An extension of affine arithmetic
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Affine arithmetic: concepts and applications
- Algorithm 852
- Benchmarking global optimization and constraint satisfaction codes
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Deterministic global optimization using interval constraint propagation techniques
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Enhancing numerical constraint propagation using multiple inclusion representations
- Exclusion regions for optimization problems
- Extensions of affine arithmetic: application to unconstrained global optimization
- GlobSol user guide
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization with polynomials and the problem of moments
- Interval analysis on directed acyclic graphs for global optimization
- McCormick-Based Relaxations of Algorithms
- New interval methods for constrained global optimization
- Rigorous Lower and Upper Bounds in Linear Programming
- Rigorous global search: continuous problems
- Safe bounds in linear and mixed-integer linear programming
- The cluster problem in multivariate global optimization
- Validated Linear Relaxations and Preprocessing: Some Experiments
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
Cited in
(29)- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- Tighter McCormick relaxations through subgradient propagation
- A certified branch \& bound approach for reliability-based optimization problems
- On tightness and anchoring of McCormick and other relaxations
- \texttt{lsmear}: a variable selection strategy for interval branch and bound solvers
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Node selection strategies in interval branch and bound algorithms
- Linear and parabolic relaxations for quadratic constraints
- Safe and tight linear estimators for global optimization
- Improved convex and concave relaxations of composite bilinear forms
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Upper bounding in inner regions for global optimization under inequality constraints
- The small octagons of maximal width
- Solving generalized polynomial problem by using new affine relaxed technique
- An efficient and safe framework for solving optimization problems
- Validated Linear Relaxations and Preprocessing: Some Experiments
- An interval branch and bound method for global robust optimization
- On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
- Numerical certification of Pareto optimality for biobjective nonlinear problems
- Extensions of affine arithmetic: application to unconstrained global optimization
- A review of computation of mathematically rigorous bounds on optima of linear programs
- A generic interval branch and bound algorithm for parameter estimation
- On rigorous upper bounds to a global optimum
- The relief indicator method as a new approach to constrained global optimization
- Enhancing interval constraint propagation by identifying and filtering \(n\)-ary subsystems
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
This page was built for publication: A reliable affine relaxation method for global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496103)
