Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
From MaRDI portal
Publication:3614175
DOI10.1137/050622870zbMath1167.90009OpenAlexW2061830070MaRDI QIDQ3614175
Christian Jansson, Denis Chaykin, Christian Keil
Publication date: 16 March 2009
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0b775f06ab6b34e17c8ddf35bb678975535c52a1
linear programmingsensitivity analysissemidefinite programminginterval arithmeticrigorous error boundsNETLIB LP librarySDPLIB
Semidefinite programming (90C22) Interval and finite arithmetic (65G30) Euler-Maclaurin formula in numerical analysis (65B15)
Related Items (17)
SDP-based bounds for graph partition via extended ADMM ⋮ On verified numerical computations in convex programming ⋮ Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? ⋮ A review of computation of mathematically rigorous bounds on optima of linear programs ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ An exact algorithm for semi-supervised minimum sum-of-squares clustering ⋮ Convex computation of maximal Lyapunov exponents ⋮ SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering ⋮ (Global) optimization: historical notes and recent developments ⋮ Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation ⋮ Improving ADMMs for solving doubly nonnegative programs through dual factorization ⋮ Optimizing a polyhedral-semidefinite relaxation of completely positive programs ⋮ A new relaxation framework for quadratic assignment problems based on matrix splitting ⋮ Validating numerical semidefinite programming solvers for polynomial invariants ⋮ Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting ⋮ Tight Bounds on the Radius of Nonsingularity ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
Uses Software
This page was built for publication: Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
