Constraint aggregation for rigorous global optimization
From MaRDI portal
Publication:5962722
DOI10.1007/s10107-014-0851-4zbMath1342.90142OpenAlexW2085643939MaRDI QIDQ5962722
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 optimizationinterval analysisconstraint aggregationconstraint satisfactionfiltering methodverified computing
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Linear and parabolic relaxations for quadratic constraints, A computational study of global optimization solvers on two trust region subproblems, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, (Global) optimization: historical notes and recent developments, Domain reduction techniques for global NLP and MINLP optimization, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Rigorous verification of feasibility
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Rigorous filtering using linear relaxations
- Constraint propagation on quadratic constraints
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- An optimality criterion for global quadratic optimization
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- On proving existence of feasible points in equality constrained optimization problems
- The cluster problem in multivariate global optimization
- Lower bound functions for polynomials
- A rigorous global filtering algorithm for quadratic constraints
- BARON: A general purpose global optimization software package
- Comparing partial consistencies
- Rigorous verification of feasibility
- First order rejection tests for multiple-objective optimization
- The optimization test environment
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Exclusion Regions for Systems of Equations
- Complete search in continuous global optimization and constraint satisfaction
- Transposition Theorems and Qualification‐Free Optimality Conditions
- Global Optimization and Constraint Satisfaction
- Automatic computation of a linear interval enclosure
