Explicit solutions for interval semidefinite linear programs

DOI10.1016/0024-3795(94)00130-8zbMath0844.90057OpenAlexW1987454867MaRDI QIDQ1911421

Henry Wolkowicz

Publication date: 28 April 1996

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(94)00130-8

zbMATH Keywords

primal and dual optimal solutionssemidefinite linear programs

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs, A unified class of directly solvable semidefinite programming problems, Nonnegative Generalized Inverses and Interval Linear Programs, Linear optimization with box constraints in Banach spaces, Solving SDP completely with an interior point oracle

Cites Work

• Some applications of optimization in matrix theory
• Cones of diagonally dominant matrices
• An interior-point method for multifractional programs with convex constraints
• A primal-dual potential reduction method for problems involving matrix inequalities
• An interval programming algorithm for discrete linear \(L_ 1\) approximation problems
• An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
• The Simplest Semidefinite Programs are Trivial
• An Explicit Solution of a Special Class of Linear Programming Problems
• Inequalities: theory of majorization and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item