Results 1  10
of
25
Determinant maximization with linear matrix inequality constraints
 SIAM Journal on Matrix Analysis and Applications
, 1998
"... constraints ..."
Interior Methods for Constrained Optimization
 Acta Numerica
, 1992
"... Interior methods for optimization were widely used in the 1960s, primarily in the form of barrier methods. However, they were not seriously applied to linear programming because of the dominance of the simplex method. Barrier methods fell from favour during the 1970s for a variety of reasons, includ ..."
Abstract

Cited by 83 (3 self)
 Add to MetaCart
Interior methods for optimization were widely used in the 1960s, primarily in the form of barrier methods. However, they were not seriously applied to linear programming because of the dominance of the simplex method. Barrier methods fell from favour during the 1970s for a variety of reasons, including their apparent inefficiency compared with the best available alternatives. In 1984, Karmarkar's announcement of a fast polynomialtime interior method for linear programming caused tremendous excitement in the field of optimization. A formal connection can be shown between his method and classical barrier methods, which have consequently undergone a renaissance in interest and popularity. Most papers published since 1984 have concentrated on issues of computational complexity in interior methods for linear programming. During the same period, implementations of interior methods have displayed great efficiency in solving many large linear programs of everincreasing size. Interior methods...
Method of centers for minimizing generalized eigenvalues
 Linear Algebra Appl
, 1993
"... We consider the problem of minimizing the largest generalized eigenvalue of a pair of symmetric matrices, each of which depends affinely on the decision variables. Although this problem may appear specialized, it is in fact quite general, and includes for example all linear, quadratic, and linear fr ..."
Abstract

Cited by 65 (14 self)
 Add to MetaCart
We consider the problem of minimizing the largest generalized eigenvalue of a pair of symmetric matrices, each of which depends affinely on the decision variables. Although this problem may appear specialized, it is in fact quite general, and includes for example all linear, quadratic, and linear fractional programs. Many problems arising in control theory can be cast in this form. The problem is nondifferentiable but quasiconvex, so methods such as Kelley's cuttingplane algorithm or the ellipsoid algorithm of Shor, Nemirovksy, and Yudin are guaranteed to minimize it. In this paper we describe relevant background material and a simple interior point method that solves such problems more efficiently. The algorithm is a variation on Huard's method of centers, using a selfconcordant barrier for matrix inequalities developed by Nesterov and Nemirovsky. (Nesterov and Nemirovsky have also extended their potential reduction methods to handle the same problem [NN91b].) Since the problem is quasiconvex but not convex, devising a nonheuristic stopping criterion (i.e., one that guarantees a given accuracy) is more difficult than in the convex case. We describe several nonheuristic stopping criteria that are based on the dual of a related convex problem and a new ellipsoidal approximation that is slightly sharper, in some cases, than a more general result due to Nesterov and Nemirovsky. The algorithm is demonstrated on an example: determining the quadratic Lyapunov function that optimizes a decay rate estimate for a differential inclusion.
A Generic PathFollowing Algorithm With a Sliding Constraint and Its Application to Linear Programming and the Computation of Analytic Centers
, 1996
"... We propose a generic pathfollowing scheme which is essentially a method of centers that can be implemented with a variety of algorithms. The complexity estimate is computed on the sole assumption that a certain local quadratic convergence property holds, independently of the specific algorithmic pr ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
We propose a generic pathfollowing scheme which is essentially a method of centers that can be implemented with a variety of algorithms. The complexity estimate is computed on the sole assumption that a certain local quadratic convergence property holds, independently of the specific algorithmic procedure in use, primal, dual or primaldual. We show convergence in O( p n) iterations. We verify that the primal, dual and primaldual algorithms satisfy the local quadratic convergence property. The method can be applied to solve the linear programming problem (with a feasible start) and to compute the analytic center of a bounded polytope. The generic pathfollowing scheme easily extends to the logarithmic penalty barrier approach. Keywords Interior point method, method of centers, pathfollowing, linear programming. This work has been completed with the support from the Swiss National Foundation for Scientific Research, grant 1234002.92. 1 Introduction Shortly after Karmarkar's s...
How good are interior point methods? KleeMinty. cubes tighten iterationcomplexity bounds
, 2004
"... ..."
Polynomial Cutting Plane Algorithms for TwoStage Stochastic Linear Programs Based on Ellipsoids, Volumetric Centers and Analytic Centers
 Washington State University
, 1995
"... Traditional simplexbased algorithms for twostage stochastic linear programscan be broadly divided into two classes: (a) those that explicitly exploit the structure of the equivalent largescale linear program and (b) those based on cutting planes (or equivalently on decomposition) that implicitly ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Traditional simplexbased algorithms for twostage stochastic linear programscan be broadly divided into two classes: (a) those that explicitly exploit the structure of the equivalent largescale linear program and (b) those based on cutting planes (or equivalently on decomposition) that implicitly exploit that structure. Algorithms of class (b) are in general preferred. In 1988, following the work of Karmarkar for general linear programs, Birge and Qi [10] proposed a specialization of Karmarkar's algorithm for twostage stochastic linear programs. The algorithm of Birge and Qi [10] is the first interior point analog of class (a). Several other authors have studied related and different interior point analogs of class (a). Birge and Qi [10] also presented an analysis of the computational complexity of their algorithm. This analysis indicates that the computational complexity (in terms of total arithmetic operations) of their algorithm is in general smaller than that of the Karmarkar's ...
TimeRecursive VelocityAdapted SpatioTemporal ScaleSpace Filters
 In Proc. ECCV, volume 2350 of LNCS
, 2002
"... This paper presents a theory for constructing and computing velocityadapted scalespace filters for spariotemporal image data. ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
This paper presents a theory for constructing and computing velocityadapted scalespace filters for spariotemporal image data.
The longstep method of analytic centers for fractional problems
 Mathematical Programming
, 1997
"... We develop a longstep surfacefollowing version of the method of analytic centers for the fractionallinear problem min {t0  t0B(x) − A(x) ∈ H, B(x) ∈ K, x ∈ G}, where H is a closed convex domain, K is a convex cone contained in the recessive cone of H, G is a convex domain and B(·), A(·) are a ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We develop a longstep surfacefollowing version of the method of analytic centers for the fractionallinear problem min {t0  t0B(x) − A(x) ∈ H, B(x) ∈ K, x ∈ G}, where H is a closed convex domain, K is a convex cone contained in the recessive cone of H, G is a convex domain and B(·), A(·) are affine mappings. Tracing a twodimensional surface of analytic centers rather than the usual path of centers allows to skip the initial “centering ” phase of the pathfollowing scheme. The proposed longstep policy of tracing the surface fits the best known overall polynomialtime complexity bounds for the method and, at the same time, seems to be more attractive computationally than the shortstep policy, which was previously the only one giving good complexity bounds. 1
An InteriorPoint Method For Convex Fractional Programming
 AT&T Bell Labs Numerical Analysis Manuscript
, 1993
"... We present an interiorpoint method for convex fractional programming. The proposed algorithm converges in polynomial time, just as in the case of a convex problem, even though convex fractional programs are only pseudoconvex. More precisely, the rate of convergence is measured in terms of the area ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present an interiorpoint method for convex fractional programming. The proposed algorithm converges in polynomial time, just as in the case of a convex problem, even though convex fractional programs are only pseudoconvex. More precisely, the rate of convergence is measured in terms of the area of twodimensional convex sets C k containing the optimal points, and the area of C k is reduced by a constant factor c ! 1 at each iteration. The factor c depends only on the selfconcordance parameter of a barrier function associated with the feasible set. We present an outline of a practical implementation of the proposed method, and we report results of a few numerical experiments. 1. Introduction Interiorpoint methods for the solution of nonlinear programming problems were already introduced in the 1950s and 1960s; see [6] and the references given there. In the 1970s, new and seemingly superior approaches, such as sequential quadratic programming techniques, were developed, and as a ...