Semi-Infinite Programming

TL;DR: In this paper, the problem of obtaining an estimator that has the appropriate pattern and is close to the sample covariance matrix is addressed without the assumption of normality, and the estimator is obtained numerically, via an iterative procedure, or in some special cases, as closed form expressions.

TL;DR: The robust distributed relay beamforming problem is solved using the worst case approach, and it is shown that the original robust design can be relaxed and reformed to a semi-definite problem (SDP).

TL;DR: This paper considers the question of whether these optimum solutions are modified if a priori deterministic information on individual component failure rates is available, and provides a procedure to compute optimum component test times for general systems.

TL;DR: This article analyzes the mission-based component testing problem of devices which consist ofseries connection of 1-out-of-n subsystems or series connection of m- out- of- n subsystems to find optimal component test times that yield desired levels of system reliability.

TL;DR: The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables and it is shown that the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix.

TL;DR: This work considers the generalization of a variant of Karmarkar's algorithm to semi-infinite programming and pays particular attention to the problem of Chebyshev approximation.