Results 1  10
of
44
Implementation of interior point methods for large scale linear programming.” Interiorpoint methods of mathematical programming
, 1996
"... ..."
(Show Context)
On implementing a primaldual interiorpoint method for conic quadratic optimization
 MATHEMATICAL PROGRAMMING SER. B
, 2000
"... Conic quadratic optimization is the problem of minimizing a linear function subject to the intersection of an affine set and the product of quadratic cones. The problem is a convex optimization problem and has numerous applications in engineering, economics, and other areas of science. Indeed, linea ..."
Abstract

Cited by 61 (5 self)
 Add to MetaCart
Conic quadratic optimization is the problem of minimizing a linear function subject to the intersection of an affine set and the product of quadratic cones. The problem is a convex optimization problem and has numerous applications in engineering, economics, and other areas of science. Indeed, linear and convex quadratic optimization is a special case. Conic quadratic optimization problems can in theory be solved efficiently using interiorpoint methods. In particular it has been shown by Nesterov and Todd that primaldual interiorpoint methods developed for linear optimization can be generalized to the conic quadratic case while maintaining their efficiency. Therefore, based on the work of Nesterov and Todd, we discuss an implementation of a primaldual interiorpoint method for solution of largescale sparse conic quadratic optimization problems. The main features of the implementation are it is based on a homogeneous and selfdual model, handles the rotated quadratic cone directly, employs a Mehrotra type predictorcorrector
Presolve analysis of linear programs prior to applying an interior point method
 INFORMS Journal on Computing
, 1997
"... ..."
(Show Context)
Convergence of a class of inexact interiorpoint algorithms for linear programs
 Mathematics of Operations Research
, 1999
"... ..."
(Show Context)
B.: Towards robust low cost authentication for pervasive devices
 In: IEEE International Conference on Pervasive Computing and Communications (PERCOM’08
, 2008
"... Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footprint limitations of such networks, prevent us from employing standard cryptographic techniques for authentication which wer ..."
Abstract

Cited by 22 (5 self)
 Add to MetaCart
(Show Context)
Low cost devices such as RFIDs, sensor network nodes, and smartcards are crucial for building the next generation pervasive and ubiquitous networks. The inherent power and footprint limitations of such networks, prevent us from employing standard cryptographic techniques for authentication which were originally designed to secure high end systems with abundant power. Furthermore, the sharp increase in the number, diversity and strength of physical attacks which directly target the implementation may have devastating consequences in a network setting creating a single point of failure. A compromised node may leak a master key, or may give the attacker an opportunity for injecting faulty messages. In this paper we present a lightweight challenge response authentication scheme based on noisy physical unclonable functions (PUF) that allows for extremely efficient implementations. Furthermore, the inherent properties of PUFs provide cryptographically strong tamper resilience. In a network setting this means that a tampered device will no longer authenticate and in a sense will be isolated from the network. 1
Row modifications of a sparse Cholesky factorization
 SIAM J. Matrix Anal. Appl
, 2005
"... Abstract. Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization LDLT, we develop sparse techniques for updating the factorization after a symmetric modification of a row and column of C. We show how the modification in the Cholesky factorization associa ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
(Show Context)
Abstract. Given a sparse, symmetric positive definite matrix C and an associated sparse Cholesky factorization LDLT, we develop sparse techniques for updating the factorization after a symmetric modification of a row and column of C. We show how the modification in the Cholesky factorization associated with this rank2 modification of C can be computed efficiently using a sparse rank1 technique developed in an earlier paper [SIAM J. Matrix Anal. Appl., 20 (1999), pp. 606627]. We also determine how the solution of a linear system Lx = b changes after changing a row and column of C or after a rankr change in C.
A Computational Study of the Homogeneous Algorithm for LargeScale Convex Optimization
, 1997
"... Recently the authors have proposed a homogeneous and selfdual algorithm for solving the monotone complementarity problem (MCP) [5]. The algorithm is a single phase interiorpoint type method, nevertheless it yields either an approximate optimal solution or detects a possible infeasibility of th ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
Recently the authors have proposed a homogeneous and selfdual algorithm for solving the monotone complementarity problem (MCP) [5]. The algorithm is a single phase interiorpoint type method, nevertheless it yields either an approximate optimal solution or detects a possible infeasibility of the problem. In this paper we specialize the algorithm to the solution of general smooth convex optimization problems that also possess nonlinear inequality constraints and free variables. We discuss an implementation of the algorithm for largescale sparse convex optimization. Moreover, we present computational results for solving quadratically constrained quadratic programming and geometric programming problems, where some of the problems contain more than 100,000 constraints and variables. The results indicate that the proposed algorithm is also practically efficient. Department of Management, Odense University, Campusvej 55, DK5230 Odense M, Denmark. Email: eda@busieco.ou.dk y ...
Combining interiorpoint and pivoting algorithms for
 Linear Programming”, Management Science
, 1996
"... ..."
PUFHB: A TamperResilient HB based Authentication Protocol, ACNS
, 2008
"... We propose a lightweight protocol for authentication of lowpower devices. Our construction PUFHB merges the positive qualities of two families of authentication functions. PUF represents physically unclonable functions and fulfills the purpose of providing lowcost tamperresilient challengerespo ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We propose a lightweight protocol for authentication of lowpower devices. Our construction PUFHB merges the positive qualities of two families of authentication functions. PUF represents physically unclonable functions and fulfills the purpose of providing lowcost tamperresilient challengeresponse authentication. On the other hand, the Hopper Blum (HB) function provides provable cryptographic strength against passive adversaries. By building on an earlier proof of the security of HB + by Katz et al. [1], we rigorously prove the security of the proposed scheme against active adversaries. While the active adversary model does not include maninthemiddle attacks, we show that a previously successful maninthemiddle attack proposed for HB +, does not carry to PUFHB. 1