Results 1  10
of
431,105
A Homogeneous Interiorpoint Algorithm for . . .
"... A homogeneous infeasiblestart interiorpoint algorithm for solving nonsymmetric convex conic optimization problems is presented. Starting each iteration from the vicinity of the central path, the method steps in the approximate tangent direction and then applies a correction phase to locate the ne ..."
Abstract
 Add to MetaCart
A homogeneous infeasiblestart interiorpoint algorithm for solving nonsymmetric convex conic optimization problems is presented. Starting each iteration from the vicinity of the central path, the method steps in the approximate tangent direction and then applies a correction phase to locate
An Improved InteriorPoint Approach for Use in Reservoir Operation
"... . A novel approach is presented for solving multireservoir operation planning (MROP) problems. MROP is formulated as a multiobjective optimization model and solved by a sequential linear programming (SLP) technique. The resulting linear programming (LP) problem is often very large and highly spars ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
sparse. A constantpotential interiorpoint algorithm is developed for handling LP problems in general. The efficiency of the algorithm is further improved by exploiting the structure of MROP. In particular, the normal equation arising from the projection step of the algorithm is solved more effectively
Stability Of Linear Equations Solvers In InteriorPoint Methods
 SIAM J. Matrix Anal. Appl
, 1994
"... . Primaldual interiorpoint 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 illconditioned in the later stages of the algorithm, but the computed steps ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
. Primaldual interiorpoint 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 illconditioned in the later stages of the algorithm, but the computed
On The Symmetric Formulation Of InteriorPoint Methods
, 1994
"... . We present a unified framework for studying interior point methods for linear programming. Within this framework, we compare three fundamental methods: (1) pathfollowing, (2) barrier, and (3) primal/dual affinescaling (our terminology differs slightly from the commonly accepted terminology). The ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. We present a unified framework for studying interior point methods for linear programming. Within this framework, we compare three fundamental methods: (1) pathfollowing, (2) barrier, and (3) primal/dual affinescaling (our terminology differs slightly from the commonly accepted terminology
A Computational View of InteriorPoint Methods for Linear Programming
 IN: ADVANCES IN LINEAR AND INTEGER PROGRAMMING
, 1994
"... Many issues that are crucial for an efficient implementation of an interior point algorithm are addressed in this paper. To start with, a prototype primaldual algorithm is presented. Next, many tricks that make it so efficient in practice are discussed in detail. Those include: the preprocessing te ..."
Abstract

Cited by 16 (10 self)
 Add to MetaCart
Many issues that are crucial for an efficient implementation of an interior point algorithm are addressed in this paper. To start with, a prototype primaldual algorithm is presented. Next, many tricks that make it so efficient in practice are discussed in detail. Those include: the preprocessing
Smoothed Analysis of InteriorPoint Algorithms: Termination
, 2003
"... We perform a smoothed analysis of the termination phase of an interiorpoint method. By combining this analysis with the smoothed analysis of Renegar’s interiorpoint algorithm in [DST02], we show that the smoothed complexity of an interiorpoint algorithm for linear programming is O(m 3 log(m/σ)). ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We perform a smoothed analysis of the termination phase of an interiorpoint method. By combining this analysis with the smoothed analysis of Renegar’s interiorpoint algorithm in [DST02], we show that the smoothed complexity of an interiorpoint algorithm for linear programming is O(m 3 log
Numerical study of InteriorPoint algorithms for nonlinear complementarity problems ∗
, 2003
"... We are interested in the numerical behavior of infeasible InteriorPoint methods for nonlinear complementarity problems. We study two classical algorithms and compare their relative merits, using two different merit functions. Computational results on some well known test problems suggest that com ..."
Abstract
 Add to MetaCart
We are interested in the numerical behavior of infeasible InteriorPoint methods for nonlinear complementarity problems. We study two classical algorithms and compare their relative merits, using two different merit functions. Computational results on some well known test problems suggest
A Globally Convergent InteriorPoint Algorithm for Nonlinear Programming Problems
, 1997
"... Abstract. This paper presents a primaldual interiorpoint algorithm for solving general constrained nonlinear programming problems. The inequality constraints are incorporated into the objective function by means of a logarithmic barrier function. Also, satisfaction of the equality constraints is e ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Abstract. This paper presents a primaldual interiorpoint algorithm for solving general constrained nonlinear programming problems. The inequality constraints are incorporated into the objective function by means of a logarithmic barrier function. Also, satisfaction of the equality constraints
InteriorPoint Methods for MaxMin Eigenvalue Problems
, 1993
"... The problem of maximizing the smallest eigenvalue of a symmetric matrix subject to modifications on the main diagonal that sum to zero is important since, for example, it yields the best bounds for graphpartitioning. Current algorithms for this problem work well when the multiplicity of the minimu ..."
Abstract
 Add to MetaCart
of the minimum eigenvalue at optimality is one. However, realworld applications have multiplicity at optimality that is greater than one. For such problems, current algorithms break down quickly as the multiplicity increases. We present a primaldual interiorpoint
Results 1  10
of
431,105