Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem

DOI10.1007/S11155-005-5939-3zbMATH Open1076.65041OpenAlexW2048290281MaRDI QIDQ2484023FDOQ2484023

Authors: Didier Henrion, L. Jaulin 

Publication date: 2 August 2005

Published in: Reliable Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11155-005-5939-3

Recommendations

• Semidefinite optimization
• Semi-Definite Matrix Constraints in Optimization
• A method for weighted projections to the positive definite cone
• Solving rank-constrained semidefinite programs in exact arithmetic
• Solving rank-constrained semidefinite programs in exact arithmetic

zbMATH Keywords

latticelinear matrix inequalitynumerical exampleinterval arithmeticinterval matrixinterval hullpositive semi-definite matrixworst-case complexityprimal-dual interior-point algorithminterval symmetric matrixlinear matrix inequality setSeDuMi solver

Mathematics Subject Classification ID

Interior-point methods (90C51) Interval and finite arithmetic (65G30)

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Semidefinite Programming
• Title not available (Why is that?)
• Interval Methods for Systems of Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic power from declarative use of redundant constraints
• An algorithm for checking stability of symmetric interval matrices
• A rigorous lower bound for the optimal value of convex optimization problems

Cited In (5)

• Interval Linear Algebra and Computational Complexity
• A probabilistic solution of robustH_∞control problem with scaled matrices
• An algorithm for computing a neighborhood included in the attraction domain of an asymptotically stable point
• Positive semidefinite interval of matrix pencil and its applications to the generalized trust region subproblems
• Fuzzy Matrix Contractor Based Approach for Localization of Robots

Uses Software

• GLOPT
• Matlab
• SeDuMi
• YALMIP
• LMI toolbox
• Control System Toolbox
• Numerica

This page was built for publication: Contracting optimally an interval matrix without loosing any positive semi-definite matrix is a tractable problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484023)