K. Tanabe. Complementarity-enforcing centered Newton method for mathematical programming. In K. Tone, ed., New Methods for Linear Programming, pp. 118--144, The Inst. of Stat. Math., Minato-ku, Tokyo, Japan, 1987. 11 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Polynomial Convergence of a New Family of Primal-Dual.. - Monteiro, Tsuchiya (1998) (15 citations) (Correct)
....and Boyd [36] and Zhang [38] Most of these more recent works are concentrated on primal dual methods. The first algorithms for SDP which are extensions of well known primal dual LP algorithms, such as the long step path following algorithm of Kojima, Mizuno and Yoshise [7] and Tanabe [31, 32], the short step path following algorithm of Kojima, Mizuno and Yoshise [6] and Monteiro and Adler [17, 18] and the predictor corrector algorithm of Mizuno, Todd and Ye [14] use one of the following three search directions: i) the Alizadeh, Haeberly and Overton (AHO) direction proposed in [2] ....
K. Tanabe, Complementarity-enforcing centered Newton method for mathematical programming: Global methods, in New method for linear programming, K. Tone, ed., vol. 5 of Cooperative Research Report, Institute of Statistical Mathematics, Tokyo, Japan, 1987, pp. 118--144.
On a Homogeneous Algorithm for the Monotone Complementarity.. - Andersen, Ye (1995) (8 citations) (Correct)
.... Related interior point infeasible starting algorithms for solving (MCP ) or nonlinear programming problems has been suggested for example by den Hertog et al. 3] El Bakry et al. 4] Kojima et al. 13] Kortanek et al. 15] Mizuno et al. 19] Monteiro [20] Monteiro and Wright [23] Tanabe [27], Vial [30] and Wang et al. 31] 2 A homogeneous MCP model Consider an augmented homogeneous model related to (MCP ) HMCP ) minimize x T s subject to 0 s 1 A = 0 f(x= Gammax T f(x= 1 A ; x; s; 0: A similar augmented transformation was discussed in Ye [33] ....
K. Tanabe, Complementarity-enforcing centered Newton method for mathematical programming: global method, The Symposium of New Methods for Linear Programming (The Institute of Statistical Mathematics, Tokyo, Japan 106, 1987).
A Unified ApproachtoInterior Point Algorithms - For Linear Complementarity (Correct)
No context found.
K. Tanabe. Complementarity-enforcing centered Newton method for mathematical programming. In K. Tone, ed., New Methods for Linear Programming, pp. 118--144, The Inst. of Stat. Math., Minato-ku, Tokyo, Japan, 1987. 11
Theoretical Convergence of Large-Step Primal-Dual.. - Kojima, Megiddo, Mizuno (1992) (8 citations) (Correct)
No context found.
K. Tanabe, "Complementarity-enforcing centered Newton method for mathematical programming," in K. Tone, ed., New Methods for Linear Programming, The Institute of Statistical Mathematics (Tokyo 106, 1987) 118--144.
A Unified Approach to Interior Point Algorithms for.. - Kojima, Megiddo.. (1991) (104 citations) (Correct)
No context found.
K. Tanabe. Complementarity-enforcing centered Newton method for mathematical programming. In K. Tone, ed., New Methods for Linear Programming, pp. 118--144, The Inst. of Stat. Math., Minato-ku, Tokyo, Japan, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC