On verified numerical computations in convex programming
From MaRDI portal
Recommendations
- Numerical verification of solutions for variational inequalities
- Accuracy certificates for computational problems with convex structure
- Numerical validation of solutions of linear complementarity problems
- On numerical estimates of errors in solving convex optimization problems
- Numerical verification of condition for approximately midconvex functions
- Verified numerical computation for nonlinear equations
- Using computer algebra to certify the global convergence of a numerical optimization process
- Efficient formal verification of bounds of linear programs
- Condition numbers and error bounds in convex programming
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 4080778 (Why is no real title available?)
- scientific article; zbMATH DE number 54095 (Why is no real title available?)
- scientific article; zbMATH DE number 3464348 (Why is no real title available?)
- scientific article; zbMATH DE number 3471507 (Why is no real title available?)
- scientific article; zbMATH DE number 524107 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3271001 (Why is no real title available?)
- scientific article; zbMATH DE number 3050845 (Why is no real title available?)
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A rigorous lower bound for the optimal value of convex optimization problems
- A spectral bundle method with bounds
- An independent benchmarking of SDP and SOCP solvers
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- CSDP, A C library for semidefinite programming
- Complete search in continuous global optimization and constraint satisfaction
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- Fast verification of solutions of matrix equations
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Interval Methods for Systems of Equations
- Introduction to Numerical Analysis
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear programming, complexity theory and elementary functional analysis
- Long-step strategies in interior-point primal-dual methods
- Numerical inverting of matrices of high order
- On a positive semidefinite relaxation of the cut polytope
- On implementing a primal-dual interior-point method for conic quadratic optimization
- On proving existence of feasible points in equality constrained optimization problems
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Rigorous Lower and Upper Bounds in Linear Programming
- Rigorous global search: continuous problems
- Robust Solutions to Uncertain Semidefinite Programs
- Robust convex optimization
- SDPLIB 1.2, a library of semidefinite programming test problems
- Safe bounds in linear and mixed-integer linear programming
- Second-order cone programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Solving a class of semidefinite programs via nonlinear programming
- Solving semidefinite-quadratic-linear programs using SDPT3
- Some perturbation theory for linear programming
- Super-fast validated solution of linear systems
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(6)- Verified reductions for optimization
- Mathematically rigorous global optimization in floating-point arithmetic
- A review of computation of mathematically rigorous bounds on optima of linear programs
- Relaxed verification for continuous problems
- A rigorous lower bound for the optimal value of convex optimization problems
- Accuracy certificates for computational problems with convex structure
Describes a project that uses
Uses Software
This page was built for publication: On verified numerical computations in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849186)
