Linear and parabolic relaxations for quadratic constraints
From MaRDI portal
Publication:300753
DOI10.1007/s10898-015-0381-5zbMath1351.90131OpenAlexW2238216977MaRDI QIDQ300753
Publication date: 29 June 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0381-5
interval analysisconstraint satisfaction problemsverified computingdirected modified Cholesky factorizationellipsoid relaxationsinterval hulllinear relaxationsnon-convex constraintsparabolic relaxationsquadratic constraintsrounding error control
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Algorithms with automatic result verification (65G20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- GLOMIQO: global mixed-integer quadratic optimizer
- Constraint propagation on quadratic constraints
- On proving existence of feasible points in equality constrained optimization problems
- A comparison of complete global optimization solvers
- Rigorous verification of feasibility
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- The optimization test environment
- Verified stability analysis using the Lyapunov matrix equation
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Algorithmic differentiation techniques for global optimization in the COCONUT environment
- Rigorous Enclosures of Ellipsoids and Directed Cholesky Factorizations
- A New Modified Cholesky Factorization
- A Revised Modified Cholesky Factorization Algorithm
- On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables
- Global Optimization and Constraint Satisfaction
- Constraint aggregation for rigorous global optimization
