Relaxations and approximations
Relaxations and Approximations for Mixed-Integer Optimal Control
... This section covers four approaches to handle the given overflow formulation and obtain op- timization models that can either be solved by standard algorithms or the algorithm needed is directly specified. The first ...
230
SPECTRAHEDRAL RELAXATIONS OF HYPERBOLICITY CONES
... Our basic idea here is that we produce very small size natural spectrahedral outer approximations to rigidly convex sets and hyperbolicity cones. To the best of our knowledge, these are new although they turn out ...
68
Relaxations and discretizations for the pooling problem
... polyhedral relaxations and analyzed the strengths of these ...inner approximations and presented some valid inequalities for the ...Lagrangian relaxations seem to be more promising than the RLT ...
33
On the Hardness of Probabilistic Inference Relaxations
... various approximations and relaxations are used in practice ...of relaxations is premised on the belief that such relaxations offer com- putational simplicity vis-a-vis exact inference, while ...
8
Adjoint Subgradient Calculation for McCormick Relaxations
... solve relaxations of the original ...McCormick relaxations (see ...the relaxations, with ma- chine ...difference approximations are ...
26
A Note on Convex Relaxations for the Inverse Eigenvalue Problem
... semidefinite relaxations. These relaxations offer increasingly tighter approximations at the expense of solving larger semidefinite programming ...these relaxations both in random problem ...
10
Copositive and semidefinite relaxations of the quadratic assignment problem
... Semidefinite relaxations of the quadratic assignment problem (QAP) have recently turned out to provide good approximations to the optimal value of ...conic relaxations of ...tractable ...
11
Ellipsoidal relaxations of the stable set problem:theory and algorithms
... Table 2 also shows that the quality of the upper bound U B E is preserved by all the linearization techniques. Indeed, the approximations achieved by U B BTN and even by U B K , U B C are satisfactory. This was ...
28
Approximate GCDs of polynomials and sparse SOS relaxations
... In this paper, we discussed how to solve approximate GCD problem which can be formulated as an unconstrained quartic polynomial optimization problem about the coefficients of factor polynomials. This is a nonconvex ...
11
A Note on Convex Relaxations for the Inverse Eigenvalue Problem
... semidefinite relaxations. These relaxations offer increasingly tighter approximations at the expense of solving larger semidefinite programming ...these relaxations both in random problem ...
10
Group-Sparse Model Selection: Hardness and Relaxations
... group-sparse approximations for two tractable models, among which the tree sparsity model, and illustrate selection and computation tradeoffs between our framework and the existing convex ...
27
Multivariate mccormick relaxations
... convex relaxations in deterministic global ...tighter relaxations for important classes of functions including binary product of functions, the division of functions and the minimum/maximum of ...
31
Relaxations of Graph Isomorphism
... We then show that both classical and quantum isomorphism can be reformulated as feasibility programs over the completely positive and completely positive semidefinite cones respectively. This leads us to considering ...
14
Multivariate McCormick relaxations
... convex relaxations in deterministic global ...tighter relaxations for important classes of functions including binary product of functions, the division of functions and the minimum/maximum of ...
30
Relaxations in Practical Clustering and Blockmodeling
... 3.5 Subgraph relaxations In subgraph relaxations, the requirements of Definition 1 for ideal blockmodels are relaxed. Assume a practitioner is interested in regular 4-colorings on a given graph G = (V, E). ...
8
Relaxations of the 3 partition problem
... The outline of this thesis is as follows. In Chapter 2 we describe the 3- partition problem, some of its variations, and prove that it is NP-complete. We conclude the chapter, in Section 2.3, by describing the closely ...
41
Disjunctive programming and relaxations of polyhedra
... Received: 27 April 2012 / Accepted: 16 January 2013 / Published online: 7 February 2013 © Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society 2013 Abstract Given a polyhedron L with h facets, whose ...
8
Rounding sum-of-squares relaxations
... results for the sum-of-squares method are non-constructive, i.e., they show that hard instances for the sos method exist but do not give an efficient way of constructing them. More concretely, the results use the ...
47
Direct Convex Relaxations of Sparse SVM
... In this paper, we study a sparse SVM formulation that is obtained by augmenting the standard SVM formulation with an explicit cardinality constraint on the hyperplane normal. Note that this formulation is in contrast to ...
8
Rigidity of frameworks with coordinated constraint relaxations
... Forced symmetric frameworks are required to only have motions that preserve symmetry, and for frameworks that are generic with a given symmetry, the existence of a symmetric infinitesima[r] ...
249