Pages that link to "Item:Q3614175"
From MaRDI portal
The following pages link to Rigorous Error Bounds for the Optimal Value in Semidefinite Programming (Q3614175):
Displaying 23 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated? (Q335016) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs (Q977327) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- Computable error bounds for semidefinite programming (Q1292192) (← links)
- A rigorous lower bound for the optimal value of convex optimization problems (Q1424965) (← links)
- Estimating the robust domain of attraction for non-smooth systems using an interval Lyapunov equation (Q1737666) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- Improving ADMMs for solving doubly nonnegative programs through dual factorization (Q2240675) (← links)
- A review of computation of mathematically rigorous bounds on optima of linear programs (Q2399497) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) (← links)
- Tight Bounds on the Radius of Nonsingularity (Q2803591) (← links)
- Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration (Q3989777) (← links)
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming (Q4611311) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering (Q5106412) (← links)
- Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)
- Convex computation of maximal Lyapunov exponents (Q6048912) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- The Lorenz system as a gradient-like system (Q6586970) (← links)