Constraint aggregation for rigorous global optimization
From MaRDI portal
Publication:5962722
Recommendations
- Constrained global optimization: algorithms and applications
- Optimization-oriented global constraints
- scientific article; zbMATH DE number 4114401
- Efficient global optimization of constrained mixed variable problems
- Constraint decomposition algorithms in global optimization
- Handling of Constraints in Efficient Global Optimization
- Constrained Consensus-Based Optimization
- Deterministic global optimization using interval constraint propagation techniques
- Constrained global optimization using a new exact penalty function
- Constraint aggregation principle in convex optimization
Cites work
- scientific article; zbMATH DE number 5775425 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A rigorous global filtering algorithm for quadratic constraints
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- An optimality criterion for global quadratic optimization
- Automatic computation of a linear interval enclosure
- BARON: A general purpose global optimization software package
- Benchmarking global optimization and constraint satisfaction codes
- Comparing partial consistencies
- Complete search in continuous global optimization and constraint satisfaction
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constraint propagation on quadratic constraints
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
- Exclusion Regions for Systems of Equations
- First order rejection tests for multiple-objective optimization
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- Lower bound functions for polynomials
- On proving existence of feasible points in equality constrained optimization problems
- Rigorous filtering using linear relaxations
- Rigorous verification of feasibility
- The cluster problem in multivariate global optimization
- The optimization test environment
- Transposition Theorems and Qualification‐Free Optimality Conditions
Cited in
(11)- Convergent upper bounds in global minimization with nonlinear equality constraints
- Rigorous verification of feasibility
- On rigorous upper bounds to a global optimum
- (Global) optimization: historical notes and recent developments
- Global propagation of side constraints for solving over-constrained problems
- Linear and parabolic relaxations for quadratic constraints
- Domain reduction techniques for global NLP and MINLP optimization
- Improved constraint-aggregation methods
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
- A computational study of global optimization solvers on two trust region subproblems
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending
Describes a project that uses
Uses Software
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)
