Robust inversion, dimensionality reduction, and randomized sampling

We consider a class of inverse problems in which the forward model is the solution operator to linear ODEs or PDEs. This class admits several dimensionality-reduction techniques based on data averaging or sampling, which are especially useful for large-scale problems. We survey these approaches and their connection to stochastic optimization. The data-averaging approach is only … Read more

Informational validity of Fechtner’s experiments outcomes

All manifestations of dimensional harmony in nature and human practice are being always characterized by deviations from golden ratio that often makes their acceptance problematic. On the example of Fechner’s experiments the paper discusses the way of solving this problem, based on informational approach, according to which the informatively optimal permissible deviation from dimensional harmony … Read more

A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs

We study a class of linear programming (LP) problems motivated by large-scale machine learning applications. After reformulating the LP as a convex nonsmooth problem, we apply Nesterov’s primal-dual smoothing technique. It turns out that the iteration complexity of the smoothing technique depends on a parameter $\th$ that arises because we need to bound the originally … Read more

Informatively optimal levels of confidence for mesurement uncertainty

The conception of dimensional perfection and based on principles of qualimetry and information theory the criterion of informational optimality have been used for analyzing modeling functions of measurement. By means of variances of uncertainty contributions, transformed into their relative weights, the possibility of determining informatively rational and optimal levels of confidence for expanded uncertainty has … Read more

Daily Scheduling of Nurses in Operating Suites

This paper provides a new multi-objective integer programming model for the daily scheduling of nurses in operating suites. The model is designed to assign nurses to di erent surgery cases based on their specialties and competency levels, subject to a series of hard and soft constraints related to nurse satisfaction, idle time, overtime, and job changes … Read more

Improving Robust Rolling Stock Circulation in Rapid Transit Networks

The routing of the rolling stock depends strongly on the rolling stock assignment to di erent opera- tions and the shunting schedule. Therefore, the integration of these decision making is justi ed and is appropriate to introduce robustness in the model. We propose a new approach to obtain better circula- tions of the rolling stock material, solving … Read more

Stochastic approaches for solving Rapid Transit Network Design models with random demand

We address rapid transit network design problems characterized by uncertainty in the input data. Network design has a determinant impact on the future e ective- ness of the system. Design decisions are made with a great degree of uncertainty about the conditions under which the system will be required to operate. The de- mand is one … Read more

Compressive Sensing Based High Resolution Channel Estimation for OFDM System

Orthogonal frequency division multiplexing (OFDM) is a technique that will prevail in the next generation wireless communication. Channel estimation is one of the key challenges in OFDM, since high-resolution channel estimation can significantly improve the equalization at the receiver and consequently enhance the communication performances. In this paper, we propose a system with an asymmetric … Read more

Multi-target Linear-quadratic control problem: semi-infinite interval

We consider multi-target linear-quadratic control problem on semi-infinite interval. We show that the problem can be reduced to a simple convex optimization problem on the simplex. Citation To appear in Mathematical Problems in Engineering 2012 Article Download View Multi-target Linear-quadratic control problem: semi-infinite interval