Upper bounding in inner regions for global optimization under inequality constraints
From MaRDI portal
Publication:486384
DOI10.1007/S10898-014-0145-7zbMATH Open1312.90057OpenAlexW2062609317MaRDI QIDQ486384FDOQ486384
Bertrand Neveu, Gilles Chabert, I. Araya, Gilles Trombettoni
Publication date: 15 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/128153
Recommendations
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Convergent upper bounds in global minimization with nonlinear equality constraints
- On rigorous upper bounds to a global optimum
- Bounding the set of solutions of a perturbed global optimization problem
- Global convergence of a trust-region algorithm for inequality constrained optimization
- On consistency of bounding operations in deterministic global optimization
- scientific article
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints
- New interval methods for constrained global optimization
- On lower and upper bounds in smooth and strongly convex optimization
Cites Work
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Introduction to Interval Analysis
- A polyhedral branch-and-cut approach to global optimization
- Interval Methods for Systems of Equations
- Computational complexity and feasibility of data processing and interval computations
- Title not available (Why is that?)
- Constructive Interval Disjunction
- A reliable affine relaxation method for global optimization
- Contractor programming
- Efficient and Safe Global Constraints for Handling Numerical Constraint Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algebraic links and skein relations of the Links-Gould invariant
- On the Solution Set of a Linear System with Inaccurate Coefficients
Cited In (16)
- \textsc{AbsTaylor}: upper bounding with inner regions in nonlinear continuous global optimization problems
- Nonlinear biobjective optimization: improvements to interval branch \& bound algorithms
- A certified branch \& bound approach for reliability-based optimization problems
- \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
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- A standard branch-and-bound approach for nonlinear semi-infinite problems
- Interval methods for model qualification: methodology and advanced application
- Example Guided Synthesis of Linear Approximations for Neural Network Verification
- A generic interval branch and bound algorithm for parameter estimation
- A global constraint for over-approximation of real-time streams
- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation
- Construction of parametric barrier functions for dynamical systems using interval analysis
- Constrained global optimization for wine blending
Uses Software
This page was built for publication: Upper bounding in inner regions for global optimization under inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486384)
