Results 1  10
of
5,069
On Optimal Locality of Linear Relaxation
"... Tiling is wellknown to reduce the number of cache misses in linear relaxation codes. This paper investigates analytically how close to optimum the improvement gets. We consider one time step of the Jacobi and GaussSeidel methods on a twodimensional array of size (N +2) (N +2). For cache capaci ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Tiling is wellknown to reduce the number of cache misses in linear relaxation codes. This paper investigates analytically how close to optimum the improvement gets. We consider one time step of the Jacobi and GaussSeidel methods on a twodimensional array of size (N +2) (N +2). For cache
Validated Probing with Linear Relaxations
"... Abstract. During branch and bound search in deterministic global optimization, adaptive subdivision is used to produce subregions x, which are then eliminated, shown to contain an optimal point, reduced in size, or further subdivided. The various techniques used to reduce or eliminate a subregion x ..."
Abstract
 Add to MetaCart
determine the efficiency and practicality of the algorithm. Ryoo and Sahinidis have proposed a “probing” technique, involving the dual variables of a linear relaxation, to reduce the size of subregions x. This technique, combined with others, has been successful in the BARON global optimization software
Rigorous filtering using linear relaxations
, 2010
"... This paper presents rigorous filtering methods for continuous constraint satisfaction problems based on linear relaxations. Filtering or pruning stands for reducing the search space of constraint satisfaction problems. Discussed are old and new approaches for rigorously enclosing the solution set o ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
This paper presents rigorous filtering methods for continuous constraint satisfaction problems based on linear relaxations. Filtering or pruning stands for reducing the search space of constraint satisfaction problems. Discussed are old and new approaches for rigorously enclosing the solution set
On linear relaxations of OPF problems
"... . The AC OPF problem is a fundamental software component in the operation of electrical power transmission systems. For background, see [1]. It can be formulated as a nonconvex, continuous optimization problem. In routine problem instances, solutions of excellent quality can be quickly obtained usi ..."
Abstract
 Add to MetaCart
. The AC OPF problem is a fundamental software component in the operation of electrical power transmission systems. For background, see [1]. It can be formulated as a nonconvex, continuous optimization problem. In routine problem instances, solutions of excellent quality can be quickly obtained using a variety of methodologies, including sequential lin
Linear relaxations for transmission system planning
 IEEE Transactions on Power Systems
, 2011
"... We apply a linear relaxation procedure for polynomial optimization problems to transmission system planning. The approach recovers and improves upon existing linear models based on the DC approximation. We then consider the full AC problem, and obtain new linear models with nearly the same efficien ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We apply a linear relaxation procedure for polynomial optimization problems to transmission system planning. The approach recovers and improves upon existing linear models based on the DC approximation. We then consider the full AC problem, and obtain new linear models with nearly the same
Just Relax: Convex Programming Methods for Identifying Sparse Signals in Noise
, 2006
"... This paper studies a difficult and fundamental problem that arises throughout electrical engineering, applied mathematics, and statistics. Suppose that one forms a short linear combination of elementary signals drawn from a large, fixed collection. Given an observation of the linear combination that ..."
Abstract

Cited by 483 (2 self)
 Add to MetaCart
that convex relaxation succeeds. As evidence of the broad impact of these results, the paper describes how convex relaxation can be used for several concrete signal recovery problems. It also describes applications to channel coding, linear regression, and numerical analysis.
Guaranteed minimumrank solutions of linear matrix equations via nuclear norm minimization,”
 SIAM Review,
, 2010
"... Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding, and col ..."
Abstract

Cited by 562 (20 self)
 Add to MetaCart
Abstract The affine rank minimization problem consists of finding a matrix of minimum rank that satisfies a given system of linear equality constraints. Such problems have appeared in the literature of a diverse set of fields including system identification and control, Euclidean embedding
A Linear Relaxation Heuristic For The Generalized Assignment Problem
 Naval Research Logistics
, 1992
"... We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where t ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where
Validated linear relaxations and preprocessing: Some experiments
 SIAM J. OPTIM
, 2005
"... Based on work originating in the early 1970s, a number of recent global optimization algorithms have relied on replacing an original nonconvex nonlinear program by convex or linear relaxations. Such linear relaxations can be generated automatically through an automatic differentiation process. Thi ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Based on work originating in the early 1970s, a number of recent global optimization algorithms have relied on replacing an original nonconvex nonlinear program by convex or linear relaxations. Such linear relaxations can be generated automatically through an automatic differentiation process
Linear Relaxation Techniques for Task Management in Uncertain Settings
 In Proceedings of International Conference on Automated Planning and Scheduling, 363–371. Menlo Park
"... In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably juggling multiple concurrent streams of tasks (or work flows) of varying importance and urgency. There is uncertainty wit ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
as a basis for generating advice in this context, since they are applicable only in the restrictive case where all pending tasks can be accomplished within time constraints and our principal concern is support in oversubscribed circumstances. We present two techniques that are based on linear
Results 1  10
of
5,069