This work gives an overview over the major codes available for the solution of linear semidefinite (SDP) and second-order cone (SOCP) programs. Some developments since the 7th DIMACS Challenge [9, 17] are pointed out as well as some currently under way. Instead of presenting per- formance tables, reference is made to the ongoing benchmark [19] … Read more
We introduce a class of nonconvex/affine feasibility problems, called (NCF), that consists of finding a point in the intersection of affine constraints with a nonconvex closed set. This class captures some interesting fundamental and NP hard problems arising in various application areas such as sparse recovery of signals and affine rank minimization that we briefly … Read more
We derive a new semidefinite programming bound for the maximum k-section problem. For k=2 (i.e. for maximum bisection), the new bound is least as strong as the well-known bound by Frieze and Jerrum [A. Frieze and M. Jerrum. Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18(1): 67-81, 1997]. For k > 2 … Read more
In this chapter we study a class of semidefinite programming relaxations of combinatorial problems. These relaxations are derived using the theory of coherent configurations in algebraic combinatorics. CitationDraft version of a chapter for “Handbook on SDP II” (M. Anjos and J. Lasserre, eds.), Springer.ArticleDownload View PDF
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment problem aims to minimize total travel delay among all travelers. Based on data derived from the first problem, the toll pricing problem determines the set of tolls and corresponding … Read more
This paper presents a multi-population biased random-key genetic algorithm (BRKGA) for the Single Container Loading Problem (CLP) where several rectangular boxes of different sizes are loaded into a single rectangular container. The approach uses a maximal-space representation to manage the free spaces in the container. The proposed algorithm hybridizes a novel placement procedure with a … Read more
A.D.Roy’s (1952) safety first (SF) approach to a financial portfolio selection is improved. Safety first means minimization of probability of poor returns. Improvement concerns a better estimation of the poor return probabilities by means of shortfall risk functions. Optimal SF-portfolio is sought similar to Roy’s geometric method but with a different efficient frontier. In case … Read more
We present a new technique for building effective and low cost preconditioners for sequences of shifted linear systems (A+aI)x=b, where A is symmetric positive definite and a>0. This technique updates a preconditioner for A, available in the form of an LDL’ factorization, by modifying only the nonzero entries of the L factor in such a … Read more
The complementarity problem over a symmetric cone (that we call the Symmetric Cone Complementarity Problem, or the SCCP) has received much attention of researchers in the last decade. Most of studies done on the SCCP can be categorized into the three research themes, interior point methods for the SCCP, merit or smoothing function methods for … Read more
An artificial neural network (ANN) is a computational model – implemented as a computer program – that is aimed at emulating the key features and operations of biological neural networks. ANNs are extensively used to model unknown or unspecified functional relationships between the input and output of a “black box” system. In order to apply … Read more