Semi-infinite linear programming approaches to semidefinite programming problems

Author(s):  
Kartik Krishnan ◽  
John Mitchell
Optimization ◽  
2005 ◽  
Vol 54 (1) ◽  
pp. 1-25 ◽  
Author(s):  
Juan A. Gómez † ◽  
Paul J. Bosch ‡ ◽  
Jorge Amaya

2005 ◽  
Vol 128 (1) ◽  
pp. 167-174 ◽  
Author(s):  
LiMin Zhu ◽  
Ye Ding ◽  
Han Ding

This paper presents a novel methodology for evaluating spatial straightness error based on the minimum zone criterion. Spatial straightness evaluation is formulated as a linear complex Chebyshev approximation problem, and then reformulated as a semi-infinite linear programming problem. Both models for the primal and dual programs are developed. An efficient simplex-based algorithm is employed to solve the dual linear program to yield the straightness value. Also a general algebraic criterion for checking the optimality of the solution is proposed. Numerical experiments are given to verify the effectiveness and efficiency of the presented algorithm.


2020 ◽  
Vol 14 (8) ◽  
pp. 2247-2263
Author(s):  
Miguel A. Goberna ◽  
Marco A. López ◽  
Andrea B. Ridolfi ◽  
Virginia N. Vera de Serio

2014 ◽  
Vol 42 (1) ◽  
pp. 16-20 ◽  
Author(s):  
Amitabh Basu ◽  
Kipp Martin ◽  
Christopher Thomas Ryan

Sign in / Sign up

Export Citation Format

Share Document