A reliable affine relaxation method for global optimization
From MaRDI portal
Publication:496103
DOI10.1007/S10288-014-0269-0zbMATH Open1320.90065OpenAlexW1976996892MaRDI QIDQ496103FDOQ496103
Authors: Jordan Ninin, Frédéric Messine, Pierre Hansen 
Publication date: 17 September 2015
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-014-0269-0
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
Nonconvex programming, global optimization (90C26) General methods in interval analysis (65G40) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical methods of relaxation type (49M20) Interval and finite arithmetic (65G30)
Cites Work
- Rigorous global search: continuous problems
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- Algorithm 852
- McCormick-Based Relaxations of Algorithms
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A comparison of complete global optimization solvers
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- Deterministic global optimization using interval constraint propagation techniques
- Benchmarking global optimization and constraint satisfaction codes
- The cluster problem in multivariate global optimization
- Safe bounds in linear and mixed-integer linear programming
- Affine arithmetic: concepts and applications
- New interval methods for constrained global optimization
- A general reliable quadratic form: An extension of affine arithmetic
- GlobSol user guide
- Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization
- A Deterministic Global Optimization Algorithm for Design Problems
- Extensions of affine arithmetic: application to unconstrained global optimization
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Interval analysis on directed acyclic graphs for global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exclusion regions for optimization problems
- Enhancing numerical constraint propagation using multiple inclusion representations
- Rigorous Lower and Upper Bounds in Linear Programming
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
- Node selection strategies in interval branch and bound algorithms
- Nonlinear biobjective optimization: improving the upper envelope using feasible line segments
- Safe and tight linear estimators for global optimization
- Linear and parabolic relaxations for quadratic constraints
- Improved convex and concave relaxations of composite bilinear forms
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Solving generalized polynomial problem by using new affine relaxed technique
- The small octagons of maximal width
- Validated Linear Relaxations and Preprocessing: Some Experiments
- Upper bounding in inner regions for global optimization under inequality constraints
- An efficient and safe framework for solving optimization problems
- 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
Uses Software
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)
