On verified numerical computations in convex programming
type: Item
instance of: scholarly article
title: On verified numerical computations in convex programming
zbMATH Open document ID: 1184.90124
DOI: 10.1007/BF03186539
author: Christian Jansson
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 2010-02-25T00:00:00Z
full work available at URL: https://projecteuclid.org/euclid.jjiam/1265033786
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 5674924
zbMATH Keywords: linear programming
zbMATH Keywords: semidefinite programming
zbMATH Keywords: conic programming
zbMATH Keywords: convex programming
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: rounding errors
zbMATH Keywords: ill-posed problems
zbMATH Keywords: interval arithmetic
zbMATH Keywords: branch-bound-and-cut
describes a project that uses: Cosy
describes a project that uses: SDPLIB
describes a project that uses: INTLAB
describes a project that uses: INTOPT_90
describes a project that uses: Lurupa
describes a project that uses: SeDuMi
describes a project that uses: YALMIP
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: CSDP
describes a project that uses: VSDP
describes a project that uses: SDPT3
describes a project that uses: CPLEX
describes a project that uses: SDPLR
describes a project that uses: Numerica
describes a project that uses: SDPA
describes a project that uses: SBmethod
describes a project that uses: NETLIB LP Test Set
MaRDI profile type: Publication
cites work: Q3345690
cites work: Second-order cone programming
cites work: On implementing a primal-dual interior-point method for conic quadratic optimization
cites work: Robust convex optimization
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Q5789040
cites work: CSDP, A C library for semidefinite programming
cites work: SDPLIB 1.2, a library of semidefinite programming test problems
cites work: Q4821526
cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
cites work: Solving a class of semidefinite programs via nonlinear programming
cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
cites work: Q4004279
cites work: A spectral bundle method with bounds
cites work: Q3811600
cites work: A rigorous lower bound for the optimal value of convex optimization problems
cites work: Rigorous Lower and Upper Bounds in Linear Programming
cites work: Rigorous Error Bounds for the Optimal Value in Semidefinite Programming
cites work: On proving existence of feasible points in equality constrained optimization problems
cites work: Rigorous global search: continuous problems
cites work: Computational experience with rigorous error bounds for the Netlib linear programming library
cites work: Q4055079
cites work: On a positive semidefinite relaxation of the cut polytope
cites work: An independent benchmarking of SDP and SOCP solvers
cites work: Q3207999
cites work: Long-step strategies in interior-point primal-dual methods
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Interval Methods for Systems of Equations
cites work: Introduction to Numerical Analysis
cites work: Complete search in continuous global optimization and constraint satisfaction
cites work: Safe bounds in linear and mixed-integer linear programming
cites work: Numerical inverting of matrices of high order
cites work: Fast verification of solutions of matrix equations
cites work: Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
cites work: Computational Experience and the Explanatory Value of Condition Measures for Linear Optimization
cites work: Q5555984
cites work: Some perturbation theory for linear programming
cites work: Linear programming, complexity theory and elementary functional analysis
cites work: Q4284596

On verified numerical computations in convex programming (cites work)
cites work: Super-fast validated solution of linear systems

On verified numerical computations in convex programming (cites work)
cites work: Q4049667

On verified numerical computations in convex programming (cites work)
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

On verified numerical computations in convex programming (cites work)
cites work: Generalization of primal-dual interior-point methods to convex optimization problems in conic form

On verified numerical computations in convex programming (cites work)
cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES

On verified numerical computations in convex programming (cites work)
cites work: Solving semidefinite-quadratic-linear programs using SDPT3

On verified numerical computations in convex programming (cites work)
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications

On verified numerical computations in convex programming (cites work)
cites work: Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)

On verified numerical computations in convex programming (Recommended article)
Recommended article: Numerical verification of solutions for variational inequalities
Similarity Score: 0.88526344
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: Accuracy Certificates for Computational Problems with Convex Structure
Similarity Score: 0.8818069
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: Numerical validation of solutions of linear complementarity problems
Similarity Score: 0.8792752
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: On Numerical Estimates of Errors in Solving Convex Optimization Problems
Similarity Score: 0.8771654
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: Numerical verification of condition for approximately midconvex functions
Similarity Score: 0.87622315
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: Verified numerical computation for nonlinear equations
Similarity Score: 0.8716028
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: Using computer algebra to certify the global convergence of a numerical optimization process
Similarity Score: 0.8709701
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: Efficient Formal Verification of Bounds of Linear Programs
Similarity Score: 0.8690472
Recommender Run: Recommender Run 3

On verified numerical computations in convex programming (Recommended article)
Recommended article: Condition numbers and error bounds in convex programming
Similarity Score: 0.8672665
Recommender Run: Recommender Run 3