Results 1  10
of
2,756
On Mehrotratype predictorcorrector algorithms
, 2005
"... In this paper we discuss the polynomiality of a feasible version of Mehrotra’s predictorcorrector algorithm whose variants have been widely used in several IPM based optimization packages. A numerical example is given that shows that the adaptive choice of centering parameter and correction terms i ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
In this paper we discuss the polynomiality of a feasible version of Mehrotra’s predictorcorrector algorithm whose variants have been widely used in several IPM based optimization packages. A numerical example is given that shows that the adaptive choice of centering parameter and correction terms
A PredictorCorrector Algorithm for QSDP Combining
 Annals of Operations Research
, 2001
"... Recently, we have extended SDP by adding a quadratic term in the objective function and give a potential reduction algorithm using NT directions. This paper presents a predictorcorrector algorithm using both Dikintype and Newton centering steps and studies properties of Dikintype step. ..."
Abstract
 Add to MetaCart
Recently, we have extended SDP by adding a quadratic term in the objective function and give a potential reduction algorithm using NT directions. This paper presents a predictorcorrector algorithm using both Dikintype and Newton centering steps and studies properties of Dikintype step.
SelfAdaptive PredictorCorrector Algorithms for Static Structural
, 1981
"... ?1 nnn n,..;...nlr" ".... lr J)nru:l 1'1~,,1 rl nu A 11"70::: A multiphase selfadaptive predictor corrector type algorithm has been developed. This algorithm enables the solution of highly nonlinear structural responses including kinematic, kinetic and material effer~ ~?S ~pJl ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
?1 nnn n,..;...nlr" ".... lr J)nru:l 1'1~,,1 rl nu A 11"70::: A multiphase selfadaptive predictor corrector type algorithm has been developed. This algorithm enables the solution of highly nonlinear structural responses including kinematic, kinetic and material effer~ ~?S ~p
A constraintreduced variant of Mehrotra’s predictorcorrector algorithm. submitted for publication
 In Preparation
, 2007
"... Consider linear programs in dual standard form with n constraints and m variables. When typical interiorpoint algorithms are used for the solution of such problems, updating the iterates, using direct methods for solving the linear systems and assuming a dense constraint matrix A, requires O(nm 2) ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
feasible constraintreduced variant of Mehrotra’s predictorcorrector algorithm. Some promising numerical results are reported. 1
Postponing the choice of the barrier parameter in Mehrotratype predictorcorrector algorithms
 European Journal of Operational Research
"... In [8] the authors considered a variant of Mehrotra’s predictorcorrector algorithm that has been widely used in several IPMs based optimization packages. By an example they showed that this variant might make very small steps in order to keep the iterate in a certain neighborhood of the central pat ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In [8] the authors considered a variant of Mehrotra’s predictorcorrector algorithm that has been widely used in several IPMs based optimization packages. By an example they showed that this variant might make very small steps in order to keep the iterate in a certain neighborhood of the central
An InfeasibleInteriorPoint PredictorCorrector Algorithm for the P4Geometric LCP
 Department of Mathematics, The University of Iowa, Iowa City, Iowa
, 1994
"... A P Geometric linear complementarity problem (P GP) as a generalization of the monotone geometric linear complementarity problem is introduced. In particular, it contains the monotone standard linear complementarity problem and the horizontal linear complementarity problem. Linear and quadratic p ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
of the starting points. The algorithm is quadratically convergent for problems having a strictly complementary solution. Key Words:P matrix, linear complementarity problems, predictorcorrector, infeasibleinterior point algorithm, polynomiality, quadratic convergence. Abbreviated Title: Algorithm for P GP
A PredictorCorrector Algorithm For A Class Of Nonlinear Saddle Point Problems
 SIAM Journal on Control and Optimization
, 1994
"... . An interior pathfollowing algorithm is proposed for solving the nonlinear saddle point problem minimax c T x + OE(x) + b T y \Gamma /(y) \Gamma y T Ax subject to (x; y) 2 X \Theta Y ae R n \Theta R m ; where OE(x) and /(y) are smooth convex functions and X and Y are boxes (hyperrecta ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. An interior pathfollowing algorithm is proposed for solving the nonlinear saddle point problem minimax c T x + OE(x) + b T y \Gamma /(y) \Gamma y T Ax subject to (x; y) 2 X \Theta Y ae R n \Theta R m ; where OE(x) and /(y) are smooth convex functions and X and Y are boxes (hyper
A PredictorCorrector Algorithms with Polynomial Convergence for SDLCP Based on the MZ Family of Directions
"... We establishes the polynomial convergence of a new class of pathfollowing methods for semidefinite linear complementarity problems, whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iterationcomplexity bound of the well known a ..."
Abstract
 Add to MetaCart
algorithms for linear programming, namely the predictorcorrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.
Results 1  10
of
2,756