Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
From MaRDI portal
Recommendations
- Global Optimization and Constraint Satisfaction
- Computable error bounds for semidefinite programming
- Error bounds and singularity degree in semidefinite programming
- Certified roundoff error bounds using semidefinite programming
- Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
- A unified approach to error bounds for structured convex optimization problems
- Error bounds for initial value problems by optimization
- Error bounds for eigenvalue and semidefinite matrix inequality systems
- Error bounds for rank constrained optimization problems and applications
Cited in
(29)- Computable error bounds for semidefinite programming
- A rigorous lower bound for the optimal value of convex optimization problems
- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation
- SDP-based bounds for graph partition via extended ADMM
- Improving ADMMs for solving doubly nonnegative programs through dual factorization
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- Tight bounds on the radius of nonsingularity
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Error bounds and singularity degree in semidefinite programming
- Validating numerical semidefinite programming solvers for polynomial invariants
- Convex computation of maximal Lyapunov exponents
- (Global) optimization: historical notes and recent developments
- The Lorenz system as a gradient-like system
- Bounding escape rates and approximating quasi-stationary distributions of Brownian dynamics
- Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
- Global optimization for cardinality-constrained minimum sum-of-squares clustering via semidefinite programming
- Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems
- Application of the Lovász-Schrijver operator to compact stable set integer programs
- On verified numerical computations in convex programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- A new relaxation framework for quadratic assignment problems based on matrix splitting
Describes a project that uses
Uses Software
This page was built for publication: Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614175)
