Constraint aggregation for rigorous global optimization
DOI10.1007/S10107-014-0851-4zbMATH Open1342.90142OpenAlexW2085643939MaRDI QIDQ5962722FDOQ5962722
Publication date: 23 February 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0851-4
global optimizationconstraint satisfactioninterval analysisverified computingconstraint aggregationfiltering method
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- BARON: A general purpose global optimization software package
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- The optimization test environment
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Complete search in continuous global optimization and constraint satisfaction
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Automatic computation of a linear interval enclosure
- On proving existence of feasible points in equality constrained optimization problems
- Lower bound functions for polynomials
- Rigorous verification of feasibility
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Global Optimization and Constraint Satisfaction
- Constraint propagation on quadratic constraints
- The cluster problem in multivariate global optimization
- Exclusion Regions for Systems of Equations
- A rigorous global filtering algorithm for quadratic constraints
- Rigorous filtering using linear relaxations
- Comparing partial consistencies
- Transposition Theorems and Qualification‐Free Optimality Conditions
- An optimality criterion for global quadratic optimization
- First order rejection tests for multiple-objective optimization
Cited In (8)
- Global propagation of side constraints for solving over-constrained problems
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
- Linear and parabolic relaxations for quadratic constraints
- A computational study of global optimization solvers on two trust region subproblems
- Rigorous verification of feasibility
- Domain reduction techniques for global NLP and MINLP optimization
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- (Global) optimization: historical notes and recent developments
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Constrained global optimization: algorithms and applications 👍 👎
- Optimization-oriented global constraints 👍 👎
- Deterministic global optimization using interval constraint propagation techniques 👍 👎
- Constraint decomposition algorithms in global optimization 👍 👎
- Constraint aggregation principle in convex optimization 👍 👎
- Efficient global optimization of constrained mixed variable problems 👍 👎
- Handling of Constraints in Efficient Global Optimization 👍 👎
- Constrained Global Optimization Using a New Exact Penalty Function 👍 👎
- Constrained Consensus-Based Optimization 👍 👎
This page was built for publication: Constraint aggregation for rigorous global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962722)
