Results 21  30
of
4,407
CONVERGENCE OF A SHORTSTEP PRIMALDUAL ALGORITHM BASED ON THE GAUSSNEWTON DIRECTION
, 2003
"... We prove the theoretical convergence of a shortstep, approximate pathfollowing, interiorpoint primaldual algorithm for semidefinite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence for th ..."
Abstract
 Add to MetaCart
We prove the theoretical convergence of a shortstep, approximate pathfollowing, interiorpoint primaldual algorithm for semidefinite programs based on the GaussNewton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence
Solving semidefinitequadraticlinear programs using SDPT3
 MATHEMATICAL PROGRAMMING
, 2003
"... This paper discusses computational experiments with linear optimization problems involving semidefinite, quadratic, and linear cone constraints (SQLPs). Many test problems of this type are solved using a new release of SDPT3, a Matlab implementation of infeasible primaldual pathfollowing algorithm ..."
Abstract

Cited by 243 (19 self)
 Add to MetaCart
This paper discusses computational experiments with linear optimization problems involving semidefinite, quadratic, and linear cone constraints (SQLPs). Many test problems of this type are solved using a new release of SDPT3, a Matlab implementation of infeasible primaldual pathfollowing
SecondOrder Cone Programming
 MATHEMATICAL PROGRAMMING
, 2001
"... In this paper we survey the second order cone programming problem (SOCP). First we present several applications of the problem in various areas of engineering and robust optimization problems. We also give examples of optimization problems that can be cast as SOCPs. Next we review an algebraic struc ..."
Abstract

Cited by 247 (11 self)
 Add to MetaCart
barrier function for the SOCP problem and survey the pathfollowing interior point algorithms for it. Next we examine numerically stable methods for solving the interior point methods and study ways that sparsity in the input data can be exploited. Finally we give some current and future research
Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data
 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 2006
"... A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., nonhierarchical edge ..."
Abstract

Cited by 271 (12 self)
 Add to MetaCart
hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a Bspline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical
A PathFollowing InfeasibleInteriorPoint Algorithm for Linear Complementarity Problems
 Optimization Methods and Software
, 1993
"... We describe an infeasibleinteriorpoint algorithm for monotone linear complementarity problems that has polynomial complexity, global linear convergence, and local superlinear convergence with a Qorder of 2. Only one matrix factorization is required per iteration, and the analysis assumes only tha ..."
Abstract

Cited by 56 (10 self)
 Add to MetaCart
number of interior point methods have been proposed for (1). Among recent papers are the predictor...
On PrimalDual PathFollowing Algorithms in Semidefinite Programming
, 1996
"... Interior point methods for semidefinite programming have recently been studied intensively, due to their polynomial complexity and practical efficiency. Most of these methods are extensions of linear programming algorithms. The primaldual central path following method for linear programming by Janse ..."
Abstract
 Add to MetaCart
convergence to target points on the central path is shown. Moreover, we show how to compute large dynamic target updates which still allow full Newton steps. Key words: interiorpoint method, primaldual method, pathfollowing, semidefinite programming. Running title: PathFollowing Methods for SDP. iii
PathFollowing Methods for a Class of Constrained Minimization Problems in Function Space
, 2004
"... Pathfollowing methods for primaldual active set strategies requiring a regularization parameter are introduced. Existence of a path and its differentiability properties are analyzed. Monotonicity and convexity of the primaldual path value function are investigated. Both feasible and infeasible ap ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
Pathfollowing methods for primaldual active set strategies requiring a regularization parameter are introduced. Existence of a path and its differentiability properties are analyzed. Monotonicity and convexity of the primaldual path value function are investigated. Both feasible and infeasible
A NonInterior PredictorCorrector PathFollowing Method for LCP
 Mathematical Programming
, 1997
"... In a previous work the authors introduced a noninterior predictorcorrector path following algorithm for the monotone linear complementarity problem. The method uses ChenHarkerKanzowSmale smoothing techniques to track the central path and employs a refined notion for the neighborhood of the ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
In a previous work the authors introduced a noninterior predictorcorrector path following algorithm for the monotone linear complementarity problem. The method uses ChenHarkerKanzowSmale smoothing techniques to track the central path and employs a refined notion for the neighborhood
Trajectory Sampling for Direct Traffic Observation
, 2001
"... Traffic measurement is a critical component for the control and engineering of communication networks. We argue that traffic measurement should make it possible to obtain the spatial flow of traffic through the domain, i.e., the paths followed by packets between any ingress and egress point of the d ..."
Abstract

Cited by 248 (30 self)
 Add to MetaCart
Traffic measurement is a critical component for the control and engineering of communication networks. We argue that traffic measurement should make it possible to obtain the spatial flow of traffic through the domain, i.e., the paths followed by packets between any ingress and egress point
PrimalDual InteriorPoint Methods for SelfScaled Cones
 SIAM Journal on Optimization
, 1995
"... In this paper we continue the development of a theoretical foundation for efficient primaldual interiorpoint algorithms for convex programming problems expressed in conic form, when the cone and its associated barrier are selfscaled (see [9]). The class of problems under consideration includes li ..."
Abstract

Cited by 206 (12 self)
 Add to MetaCart
as pathfollowing methods. Because of the special properties of these cones and barriers, two of our algorithms can take steps that go typically a large fraction of the way to the boundary of the feasible region, rather than being confined to a ball of unit radius in the local norm defined by the Hessian
Results 21  30
of
4,407