485 research outputs found
Adaptive Methods for Linear Programming Decoding
Detectability of failures of linear programming (LP) decoding and the
potential for improvement by adding new constraints motivate the use of an
adaptive approach in selecting the constraints for the underlying LP problem.
In this paper, we make a first step in studying this method, and show that it
can significantly reduce the complexity of the problem, which was originally
exponential in the maximum check-node degree. We further show that adaptively
adding new constraints, e.g. by combining parity checks, can provide large
gains in the performance.Comment: 22 pages, 8 figures. Submitted to IEEE Transactions on Information
Theor
Split Cuts From Sparse Disjunctions
Cutting planes are one of the major techniques used in solving Mixed-Integer Linear Programming (MIP) models. Various types of cuts have long been exploited by MIP solvers, leading to state-of-the-art performance in practice. Among them, the class of split cuts, which includes Gomory Mixed Integer (GMI) and Mixed Integer Rounding (MIR) cuts from tableaux, are arguably the most effective class of general cutting planes within a branch-and-cut framework. Sparsity, on the other hand, is a common characteristic of real-world MIP problems, and it is an important part of why the simplex method works so well inside branch-and-cut. A natural question, therefore, is to determine how sparsity can be incorporated into split cuts and how effective are split cuts that exploit sparsity. In this thesis, we evaluate the strength of split cuts that arise from sparse split disjunctions. In particular, we implement an approximate separation routine that separates only split cuts whose split disjunctions are sparse. We also present a straightforward way to exploit sparsity structure that is implicit in the MIP formulation. We run computational experiments and conclude that, one possibility to produce good split cuts is to try sparse disjunctions and exploit such structure
A Scalable Algorithm For Sparse Portfolio Selection
The sparse portfolio selection problem is one of the most famous and
frequently-studied problems in the optimization and financial economics
literatures. In a universe of risky assets, the goal is to construct a
portfolio with maximal expected return and minimum variance, subject to an
upper bound on the number of positions, linear inequalities and minimum
investment constraints. Existing certifiably optimal approaches to this problem
do not converge within a practical amount of time at real world problem sizes
with more than 400 securities. In this paper, we propose a more scalable
approach. By imposing a ridge regularization term, we reformulate the problem
as a convex binary optimization problem, which is solvable via an efficient
outer-approximation procedure. We propose various techniques for improving the
performance of the procedure, including a heuristic which supplies high-quality
warm-starts, a preprocessing technique for decreasing the gap at the root node,
and an analytic technique for strengthening our cuts. We also study the
problem's Boolean relaxation, establish that it is second-order-cone
representable, and supply a sufficient condition for its tightness. In
numerical experiments, we establish that the outer-approximation procedure
gives rise to dramatic speedups for sparse portfolio selection problems.Comment: Submitted to INFORMS Journal on Computin
Strengthening Chvátal-Gomory cuts for the stable set problem
The stable set problem is a well-known NP-hard combinatorial optimization problem. As well as being hard to solve (or even approximate) in theory, it is often hard to solve in practice. The main difficulty is that upper bounds based on linear programming (LP) tend to be weak, whereas upper bounds based on semidefinite programming (SDP) take a long time to compute. We propose a new method to strengthen the LP-based upper bounds. The key idea is to take violated Chvátal-Gomory cuts and then strengthen their right-hand sides. Although the strengthening problem is itself NP-hard, it can be solved reasonably quickly in practice. As a result, the overall procedure proves to be capable of yielding competitive upper bounds in reasonable computing times
Topics in exact precision mathematical programming
The focus of this dissertation is the advancement of theory and computation related to exact precision mathematical programming. Optimization software based on floating-point arithmetic can return suboptimal or incorrect resulting because of round-off errors or the use of numerical tolerances. Exact or correct results are necessary for some applications. Implementing software entirely in rational arithmetic can be prohibitively slow. A viable alternative is the use of hybrid methods that use fast numerical computation to obtain approximate results that are then verified or corrected with safe or exact computation. We study fast methods for sparse exact rational linear algebra, which arises as a bottleneck when solving linear programming problems exactly. Output sensitive methods for exact linear algebra are studied. Finally, a new method for computing valid linear programming bounds is introduced and proven effective as a subroutine for solving mixed-integer linear programming problems exactly. Extensive computational results are presented for each topic.Ph.D.Committee Chair: Dr. William J. Cook; Committee Member: Dr. George Nemhauser; Committee Member: Dr. Robin Thomas; Committee Member: Dr. Santanu Dey; Committee Member: Dr. Shabbir Ahmed; Committee Member: Dr. Zonghao G
- …