Results 1 - 10
of
12
Computational Experience with Approximation Algorithms for the Set Covering Problem
, 1994
"... The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of eight different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorit ..."
Abstract
-
Cited by 39 (2 self)
- Add to MetaCart
The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of eight different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorithm. The algorithms were tested on a set of random-generated problems with up to 500 rows and 5000 columns, and on two sets of problems originating in combinatorial questions with up to 28160 rows and 11264 columns. On the random problems and on one set of combinatorial problems, the best algorithm among those we tested was the neural network algorithm, with greedy variants very close in second and third place. On the other set of combinatorial problems, the best algorithm was a greedy variant and the neural network performed quite poorly. The other algorithms we tested were always inferior to the ones mentioned above. Theoretical Division and CNLS, MS B-213 Los Alamos National Lab, Los Ala...
Low-authority controller design via convex optimization
- AIAA Journal of Guidance, Control, and Dynamics
, 1999
"... In this paper we address the problem of low-authority controller (LAC) design. The premise is that the actuators have limited authority, and hence cannot significantly shift the eigenvalues of the system. As a result, the closed-loop eigenvalues can be well approximated analytically using perturbati ..."
Abstract
-
Cited by 21 (10 self)
- Add to MetaCart
In this paper we address the problem of low-authority controller (LAC) design. The premise is that the actuators have limited authority, and hence cannot significantly shift the eigenvalues of the system. As a result, the closed-loop eigenvalues can be well approximated analytically using perturbation theory. These analytical approximations may suffice to predict the behavior of the closed-loop system in practical cases, and will provide at least a very strong rationale for the first step in the design iteration loop. We will show that LAC design can be cast as convex optimization problems that can be solved efficiently in practice using interior-point methods. Also, we will show that by optimizing the ℓ1 norm of the feedback gains, we can arrive at sparse designs, i.e., designs in which only a small number of the control gains are nonzero. Thus, in effect, we can also solve actuator/sensor placement or controller architecture design problems. Keywords: Low-authority control, actuator/sensor placement, linear operator perturbation theory, convex optimization, second-order cone programming, semi-definite programming, linear matrix inequality. 1
Practical Problem Solving with Cutting Plane Algorithms in Combinatorial Optimization
, 1994
"... Cutting plane algorithms have turned out to be practically successful computational tools in combinatorial optimization, in particular, when they are embedded in a branch and bound framework. Implementations of such "branch and cut" algorithms are rather complicated in comparison to many purely comb ..."
Abstract
-
Cited by 20 (5 self)
- Add to MetaCart
Cutting plane algorithms have turned out to be practically successful computational tools in combinatorial optimization, in particular, when they are embedded in a branch and bound framework. Implementations of such "branch and cut" algorithms are rather complicated in comparison to many purely combinatorial algorithms. The purpose of this article is to give an introduction to cutting plane algorithms from an implementor's point of view. Special emphasis is given to control and data structures used in practically successful implementations of branch and cut algorithms. We also address the issue of parallelization. Finally, we point out that in important applications branch and cut algorithms are not only able to produce optimal solutions but also approximations to the optimum with certified good quality in moderate computation times. We close with an overview of successful practical applications in the literature.
Stability Of Linear Equations Solvers In Interior-Point Methods
- SIAM J. Matrix Anal. Appl
, 1994
"... . Primal-dual interior-point methods for linear complementarity and linear programming problems solve a linear system of equations to obtain a modified Newton step at each iteration. These linear systems become increasingly ill-conditioned in the later stages of the algorithm, but the computed steps ..."
Abstract
-
Cited by 17 (2 self)
- Add to MetaCart
. Primal-dual interior-point methods for linear complementarity and linear programming problems solve a linear system of equations to obtain a modified Newton step at each iteration. These linear systems become increasingly ill-conditioned in the later stages of the algorithm, but the computed steps are often sufficiently accurate to be useful. We use error analysis techniques tailored to the special structure of these linear systems to explain this observation and examine how theoretically superlinear convergence of a path-following algorithm is affected by the roundoff errors. Key words. primal-dual interior-point methods, error analysis, stability AMS(MOS) subject classifications. 65G05, 65F05, 90C33 1. Introduction. The monotone linear complementarity problem (LCP) is the problem of finding a vector pair (x; y) 2 R l n \Theta R l n such that y = Mx+ q; (x; y) 0; x T y = 0; (1) where M (a real, n \Theta n positive semidefinite matrix) and q (a real vector with n elements...
Stability of Augmented System Factorizations in Interior-Point Methods
- SIAM J. Matrix Anal. Appl
, 1997
"... . Some implementations of interior-point algorithms obtain their search directions by solving symmetric indefinite systems of linear equations. The conditioning of the coefficient matrices in these so-called augmentedsystems deteriorates on later iterations, as some of the diagonal elements grow wit ..."
Abstract
-
Cited by 13 (2 self)
- Add to MetaCart
. Some implementations of interior-point algorithms obtain their search directions by solving symmetric indefinite systems of linear equations. The conditioning of the coefficient matrices in these so-called augmentedsystems deteriorates on later iterations, as some of the diagonal elements grow without bound. Despite this apparent difficulty, the steps produced by standard factorization procedures are often accurate enough to allow the interior-point method to converge to high accuracy. When the underlying linear program is nondegenerate, we show that convergence to arbitrarily high accuracy occurs, at a rate that closely approximates the theory. We also explain and demonstrate what happens when the linear program is degenerate, where convergence to acceptable accuracy (but not arbitrarily high accuracy) is usually obtained. 1. Introduction. We focus on the core linear algebra operation in primal-dual interior-point methods for linear programming: solution of a system of linear equat...
Current Trends in Stochastic Programming Computation and Applications
, 1995
"... While decisions frequently have uncertain consequences, optimal decision models often replace those uncertainties with averages or best estimates. Limited computational capability may have motivated this practice in the past. Recent computational advances have, however, greatly expanded the range of ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
While decisions frequently have uncertain consequences, optimal decision models often replace those uncertainties with averages or best estimates. Limited computational capability may have motivated this practice in the past. Recent computational advances have, however, greatly expanded the range of stochastic programs, optimal decision models with explicit consideration of uncertainties. This paper describes basic methodology in stochastic programming, recent developments in computation, and some practical application examples.
A heuristic for optimizing stochastic activity networks with applications to statistical digital circuit sizing
- IEEE Transactions on Circuits and Systems-I
, 2004
"... A deterministic activity network (DAN) is a collection of activities, each with some duration, along with a set of precedence constraints, which specify that activities begin only when certain others have finished. One critical performance measure for an activity network is its makespan, which is th ..."
Abstract
-
Cited by 8 (4 self)
- Add to MetaCart
A deterministic activity network (DAN) is a collection of activities, each with some duration, along with a set of precedence constraints, which specify that activities begin only when certain others have finished. One critical performance measure for an activity network is its makespan, which is the minimum time required to complete all activities. In a stochastic activity network (SAN), the durations of the activities and the makespan are random variables. The analysis of SANs is quite involved, but can be carried out numerically by Monte Carlo analysis. This paper concerns the optimization of a SAN, i.e., the choice of some design variables that affect the probability distributions of the activity durations. We concentrate on the problem of minimizing a quantile (e.g., 95%) of the makespan, subject to constraints on the variables. This problem has many applications, ranging from project management to digital integrated circuit (IC) sizing (the latter being our motivation). While there are effective methods for optimizing DANs, the SAN optimization problem is much more difficult; the few existing methods cannot handle large-scale problems.
Control applications of nonlinear convex programming
- the 1997 IFAC Conference on Advanced Process Control
, 1998
"... Since 1984 there has been a concentrated e ort to develop e cient interior-point methods for linear programming (LP). In the last few years researchers have begun to appreciate a very important property of these interior-point methods (beyond their e ciency for LP): they extend gracefully to nonline ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
Since 1984 there has been a concentrated e ort to develop e cient interior-point methods for linear programming (LP). In the last few years researchers have begun to appreciate a very important property of these interior-point methods (beyond their e ciency for LP): they extend gracefully to nonlinear convex optimization problems. New interior-point algorithms for problem classes such as semide nite programming (SDP) or second-order cone programming (SOCP) are now approaching the extreme e ciency of modern linear programming codes. In this paper we discuss three examples of areas of control where our ability to e ciently solve nonlinear convex optimization problems opens up new applications. In the rst example we show how SOCP can be used to solve robust open-loop optimal control problems. In the second example, we show how SOCP can be used to simultaneously design the set-point and feedback gains for a controller, and compare this method with the more standard approach. Our nal application concerns analysis and synthesis via linear matrix inequalities and SDP. Submitted to a special issue of Journal of Process Control, edited by Y. Arkun & S. Shah, for papers presented at the 1997 IFAC Conference onAdvanced Process Control, June 1997, Ban. This and related papers available via anonymous FTP at
On Free Variables In Interior Point Methods
, 1997
"... this paper wehave selected the primal-dual logarithmic barrier algorithm to present our ideas, because it and its modified versions are considered, in general, to be the most efficient in practice. The computational results presented in this paper were obtained using implementations of this algorith ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
this paper wehave selected the primal-dual logarithmic barrier algorithm to present our ideas, because it and its modified versions are considered, in general, to be the most efficient in practice. The computational results presented in this paper were obtained using implementations of this algorithm. It is to be noted, however, that this choice has notational consequences only. Practically,anyinterior point method, even nonlinear ones can be discussed in a similar linear algebra framework. Let us consider the linear programming problem
Steplengths in Interior Point Algorithms of Quadratic Programming
"... An approach to determine primal and dual stepsizes in the infeasible-- interior--point primal--dual method for convex quadratic problems is presented. The approach reduces the primal and dual infeasibilities in each step and allows different stepsizes. The method is derived by investigating the ..."
Abstract
- Add to MetaCart
An approach to determine primal and dual stepsizes in the infeasible-- interior--point primal--dual method for convex quadratic problems is presented. The approach reduces the primal and dual infeasibilities in each step and allows different stepsizes. The method is derived by investigating the efficient set of a multiobjective optimization problem. Computational results are also given. Keywords: interior point methods, quadratic programming, steplength, efficient set 1 Introduction In the paper we will assume the convex quadratic problem (QP) in the form: min c T x + 1 2 x T Qx# subject to Ax = b# x 0# (1) This work was supported in part by EPSRC grant No. GR/J52655 and Hungarian ResearchFund OTKA T-016413. y H-1518 Budaspest, P.O. BOX63.Hungary 1 where A 2 R m\Thetan is of full row rank, Q 2 R n\Thetan is symmetric positive semidefinite and c# x 2 R n # b 2 R m . The dual of (1) in the Wolfe sense is defined as follows: max b T y ; 1 2 x T Qx# ...

