The following pages link to Christian Jansson (Q171492):
Displaying 26 items.
- Inclusion isotonicity of convex-concave extensions for polynomials based on Bernstein expansion (Q424731) (← links)
- On verified numerical computations in convex programming (Q849186) (← links)
- (Q1179534) (redirect page) (← links)
- A geometric approach for computing a posteriori error bounds for the solution of a linear system (Q1179535) (← links)
- An NP-hardness result for nonlinear systems (Q1276126) (← links)
- Lower bound functions for polynomials (Q1405189) (← links)
- A rigorous lower bound for the optimal value of convex optimization problems (Q1424965) (← links)
- Convex-concave extensions (Q1577720) (← links)
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives (Q1904655) (← links)
- Computational experience with rigorous error bounds for the Netlib linear programming library (Q2503174) (← links)
- (Q2738485) (← links)
- (Q3140951) (← links)
- (Q3486360) (← links)
- Rigorous Error Bounds for the Optimal Value in Semidefinite Programming (Q3614175) (← links)
- (Q3738925) (← links)
- (Q3800994) (← links)
- (Q3811600) (← links)
- (Q3990682) (← links)
- An Algorithm for Checking Regularity of Interval Matrices (Q4243527) (← links)
- (Q4295107) (← links)
- (Q4308281) (← links)
- (Q4310321) (← links)
- Rigorous Lower and Upper Bounds in Linear Programming (Q4651975) (← links)
- Rigorous solution of linear programming problems with uncertain data (Q4713478) (← links)
- Global Optimization and Constraint Satisfaction (Q5897041) (← links)
- Quasiconvex relaxations based on interval arithmetic (Q5929744) (← links)
