On verified numerical computations in convex programming
From MaRDI portal
Publication:849186
DOI10.1007/BF03186539zbMath1184.90124MaRDI QIDQ849186
Publication date: 25 February 2010
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jjiam/1265033786
linear programmingsemidefinite programmingcombinatorial optimizationconvex programminginterval arithmeticill-posed problemsrounding errorsconic programmingbranch-bound-and-cut
Related Items
A review of computation of mathematically rigorous bounds on optima of linear programs, Mathematically rigorous global optimization in floating-point arithmetic
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Super-fast validated solution of linear systems
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- On proving existence of feasible points in equality constrained optimization problems
- Some perturbation theory for linear programming
- Fast verification of solutions of matrix equations
- Rigorous global search: continuous problems
- Long-step strategies in interior-point primal-dual methods
- A spectral bundle method with bounds
- Second-order cone programming
- On implementing a primal-dual interior-point method for conic quadratic optimization
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- An independent benchmarking of SDP and SOCP solvers
- A rigorous lower bound for the optimal value of convex optimization problems
- Safe bounds in linear and mixed-integer linear programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Solving a class of semidefinite programs via nonlinear programming
- On a positive semidefinite relaxation of the cut polytope
- Linear programming, complexity theory and elementary functional analysis
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- Computational experience with rigorous error bounds for the Netlib linear programming library
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
- Interval Methods for Systems of Equations
- Robust Solutions to Uncertain Semidefinite Programs
- Introduction to Numerical Analysis
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- Rigorous Lower and Upper Bounds in Linear Programming
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Complete search in continuous global optimization and constraint satisfaction
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
