Results 1  10
of
45
Interiorpoint Methods
, 2000
"... The modern era of interiorpoint methods dates to 1984, when Karmarkar proposed his algorithm for linear programming. In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such as convex quadrati ..."
Abstract

Cited by 612 (15 self)
 Add to MetaCart
(Show Context)
The modern era of interiorpoint methods dates to 1984, when Karmarkar proposed his algorithm for linear programming. In the years since then, algorithms and software for linear programming have become quite sophisticated, while extensions to more general classes of problems, such as convex quadratic programming, semidefinite programming, and nonconvex and nonlinear problems, have reached varying levels of maturity. We review some of the key developments in the area, including comments on both the complexity theory and practical algorithms for linear programming, semidefinite programming, monotone linear complementarity, and convex programming over sets that can be characterized by selfconcordant barrier functions.
On the formulation and theory of Newton interior point methods for nonlinear programming
 JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
, 1996
"... In this work, we first study in detail the formulation of the primaldual interiorpoint method for linear programming. We show that, contrary to popular belief, it cannot be viewed.as adamped Newton method applied to the KarushKuhnTucker conditions for the logarithmic barrier function problem. N ..."
Abstract

Cited by 115 (5 self)
 Add to MetaCart
(Show Context)
In this work, we first study in detail the formulation of the primaldual interiorpoint method for linear programming. We show that, contrary to popular belief, it cannot be viewed.as adamped Newton method applied to the KarushKuhnTucker conditions for the logarithmic barrier function problem. Next, we extend the formulation to general nonlinear programming, and then validate this extension by demonstrating that this algorithm can be implemented so that it is locally and Qquadratically convergent under only the standard Newton method assumptions. We also establish a global convergence theory for this algorithm and include promising numerical experimentation.
Implementation of interior  point methods for large scale linear programs,
 In Interior Point Methods of Mathematical Programming,
, 1996
"... ..."
(Show Context)
On The Accurate Identification Of Active Constraints
, 1996
"... We consider nonlinear programs with inequality constraints, and we focus on the problem of identifying those constraints which will be active at an isolated local solution. The correct identification of active constraints is important from both a theoretical and a practical point of view. Such an id ..."
Abstract

Cited by 65 (9 self)
 Add to MetaCart
(Show Context)
We consider nonlinear programs with inequality constraints, and we focus on the problem of identifying those constraints which will be active at an isolated local solution. The correct identification of active constraints is important from both a theoretical and a practical point of view. Such an identification removes the combinatorial aspect of the problem and locally reduces the inequality constrained minimization problem to an equality constrained one which can be more easily dealt with. We present a new technique which identifies active constraints in a neighborhood of a solution and which requires neither complementary slackness nor uniqueness of the multipliers. As an example of application of the new technique we present a local active set Newtontype algorithm for the solution of general inequality constrained problems for which Qquadratic convergence of the primal variables can be proved under very weak conditions. We also present extensions to variational inequalities.
Solving RealWorld Linear Ordering Problems . . .
, 1995
"... Cutting plane methods require the solution of a sequence of linear programs, where the solution to one provides a warm start to the next. A cutting plane algorithm for solving the linear ordering problem is described. This algorithm uses the primaldual interior point method to solve the linear prog ..."
Abstract

Cited by 29 (8 self)
 Add to MetaCart
Cutting plane methods require the solution of a sequence of linear programs, where the solution to one provides a warm start to the next. A cutting plane algorithm for solving the linear ordering problem is described. This algorithm uses the primaldual interior point method to solve the linear programming relaxations. A point which is a good warm start for a simplexbased cutting plane algorithm is generally not a good starting point for an interior point method. Techniques used to improve the warm start include attempting to identify cutting planes early and storing an old feasible point, which is used to help recenter when cutting planes are added. Computational results are described for some realworld problems; the algorithm appears to be competitive with a simplexbased cutting plane algorithm.
INTERIOR POINT METHODS FOR COMBINATORIAL OPTIMIZATION
, 1995
"... Research on using interior point algorithms to solve combinatorial optimization and integer programming problems is surveyed. This paper discusses branch and cut methods for integer programming problems, a potential reduction method based on transforming an integer programming problem to an equivale ..."
Abstract

Cited by 16 (9 self)
 Add to MetaCart
(Show Context)
Research on using interior point algorithms to solve combinatorial optimization and integer programming problems is surveyed. This paper discusses branch and cut methods for integer programming problems, a potential reduction method based on transforming an integer programming problem to an equivalent nonconvex quadratic programming problem, interior point methods for solving network flow problems, and methods for solving multicommodity flow problems, including an interior point column generation algorithm.
Using an Interior Point Method in a Branch and Bound Algorithm for Integer Programming.
, 1992
"... This paper describes an experimental code that has been developed to solve zeroone mixed integer linear programs. The experimental code uses a primaldual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
(Show Context)
This paper describes an experimental code that has been developed to solve zeroone mixed integer linear programs. The experimental code uses a primaldual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method. Computational results for a number of test problems are provided. Introduction Mixed integer linear programming problems are often solved by branch and bound methods. Branch and bound codes, such as the ones described in [7, 11, 12], normally use the simplex algorithm to solve linear programming subproblems that arise. In this paper, we describe an experimental branch and bound code for zeroone mixed integer linear programming problems that uses an interior point method to solve the LP subproblems. This project was motivated by the observation that interior point methods tend to quickly find feasible solutions with good objective values, but take a relatively long time to ...
Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
, 1995
"... Branch and cut methods for integer programming problems solve a sequence of linear programming problems. Traditionally, these linear programming relaxations have been solved using the simplex method. The reduced costs available at the optimal solution to a relaxation may make it possible to fix var ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
(Show Context)
Branch and cut methods for integer programming problems solve a sequence of linear programming problems. Traditionally, these linear programming relaxations have been solved using the simplex method. The reduced costs available at the optimal solution to a relaxation may make it possible to fix variables at zero or one. If the solution to a relaxation is fractional, additional constraints can be generated which cut off the solution to the relaxation, but do not cut off any feasible integer points. Gomory cutting planes and other classes of cutting planes are generated from the final tableau. In this paper, we consider using an interior point method to solve the linear programming relaxations. We show that it is still possible to generate Gomory cuts and other cuts without having to recreate a tableau, and we also show how variables can be fixed without using the optimal reduced costs. The procedures we develop do not require that the current relaxation be solved to optimality; this is useful for an interior point method because early termination of the current relaxation results in an improved starting point for the next relaxation.
Qsuperlinear convergence of the iterates in primaldual interiorpoint methods
 MATH. PROGRAM., SER. A 91: 99–115 (2001)
, 2001
"... ..."
Computational Experience of an InteriorPoint SQP Algorithm in a Parallel BranchandBound Framework
"... An interiorpoint algorithm within a parallel branchandbound framework for solving nonlinear mixed integer programs is described. The nonlinear programming relaxations at each node are solved using an interior point SQP method. In contrast to solving the relaxation to optimality at each tree node ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
(Show Context)
An interiorpoint algorithm within a parallel branchandbound framework for solving nonlinear mixed integer programs is described. The nonlinear programming relaxations at each node are solved using an interior point SQP method. In contrast to solving the relaxation to optimality at each tree node, the relaxation is only solved to nearoptimality. Analogous to employing advanced bases in simplexbased linear MIP solvers, a “dynamic” collection of warmstart vectors is kept to provide “advanced warmstarts” at each branchandbound node. The code has the capability to run in both sharedmemory and distributedmemory parallel environments. Preliminary computational results on various classes of linear mixed integer programs and quadratic portfolio problems are presented.