CCO Commun. Comb. Optim.

Size: px
Start display at page:

Download "CCO Commun. Comb. Optim."

Transcription

1 Communications in Combinatorics and Optimization Vol. 3 No., 08 pp.5-70 DOI: 0.049/CCO CCO Commun. Comb. Optim. An infeasible interior-point method for the P -matrix linear complementarity problem based on a trigonometric kernel function with full-newton step Behrouz Kheirfam and Masoumeh Haghighi Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, I.R. Iran b.kheirfam@azaruniv.edu Received: 6 September 06; Accepted: 0 January 08 Published Online: January 08 Communicated by Tamás Terlaky Abstract: An infeasible interior-point algorithm for solving the P -matrix linear complementarity problem based on a kernel function with trigonometric barrier term is analyzed. Each main iteration of the algorithm consists of a feasibility step and several centrality steps, whose feasibility step is induced by a trigonometric kernel function. The complexity result coincides with the best result for infeasible interiorpoint methods for P -matrix linear complementarity problem. Keywords: Linear complementarity problem, Full-Newton step, Infeasible interiorpoint method, Kernel function, Polynomial complexity AMS Subject classification: 90C5, 90C. Introduction Since Karmarkar s landmark paper [4], interior point methods IPMs have became one of the most active research areas. They have been widely extended for solving linear optimization LO, linear complementarity problems LCPs and many other problems. Due to the fact that LCP is closely related to LO, several IPMs designed for LO have been extended to P -LCP. Kojima et al. [] first proved the existence of the central path for P -LCP and generalized the primal-dual interior-point algorithm for LO to P -LCP. The authors obtained polynomial iteration complexity for the algorithm, which is yet the best iteration bound for solving P -LCP. Miao [4] gave a generalization of Mizuno-Todd-Ye predictor-corrector algorithm [6] with Corresponding Author c 08 Azarbaijan Shahid Madani University. All rights reserved.

2 5 An infeasible interior-point method for the P -LCP the P -LCP assuming the existence of a strictly positive solution. Miao s algorithm uses the l -neighborhood of the central path and has both polynomial complexity and quadratic convergence. Later Potra and Sheng [9] presented a new predictorcorrector algorithm for P -LCPs from arbitrary positive starting points. Their algorithm is quadratically convergent for nondegenerate problems. Potra and Sheng [0] proposed a superlinearly convergent predictor-corrector method for P -LCPs and improved the results in Miao [4]. Illés and Nagy [] proposed a version of the Mizuno- Todd-Ye predictor-corrector interior-point algorithm for the P -LCP and showed the polynomial convergence. In the above mentioned algorithms it is assumed that the starting point satisfies exactly the equality constraints and lies in the interior of the region defined by the inequality constraints. Such a staring point is called strictly feasible. All the points generated by the algorithms are also strictly feasible. However, in practice it may be very difficult to obtain feasible starting points. Numerical experiments have shown that it is possible to obtain good practical performance by using starting points that lie in the interior of the region defined by the inequality constraints but do not satisfy the equality constraints [7]. The points generated by the method will remain in the interior of the region defined by the inequality constraints but in general will not satisfy the equality constraints. These methods are referred as infeasible interiorpoint methods IIPMs, and feasibility is reached as optimality is approached. The first IIPM was proposed by Lustig [3]. Global convergence shown by Kojima et al. [0], whereas Zhang [5] and Mizuno [5] presented polynomial iteration complexity results for variants of this algorithm. In 006, Roos [] proposed a new IIPM for LO. It differs from the classical IIPMs e.g Kojima et al. [], Potra and Sheng [0], Lustig [3], Mizuno [5], Potra [8] and ect in that the new method uses only full steps, which has the advantage that no line searches are needed. Furthermore, the iteration bound of the algorithm matches the best known iteration bound for this type of algorithms. Some kernel function-based version of the algorithm, were carried out by Liu and Sun [] to LO and Kheirfam [7, 8] to LCP and SCO. Recently, Kheirfam [5, 9] presented full-newton step IIPMs for P horizontal linear complementarity problem HLCP and P -LCP, and developed various analysis from existing methods. Motivated by the above-mentioned works, we propose another extension of Roos algorithm to P -LCP. The main iteration of the algorithm consists of a feasibility step and a few centering steps, whose feasibility step is induced by a kernel function with trigonometric barrier term. We used a norm-based proximity to measure distance of the iterates from the central path, and derive the currently best known iteration bound for P -LCPs. To our knowledge, this is the first infeasible interior-point algorithm for P -LCP based on the kernel function with full-newton step. The paper is organized as follows: In Sect. we recall basic concepts and the notion of the central path. We review some results that provide the local quadratic convergence of the full-newton step. Sect. 3 contains an extension of Roos infeasible interiorpoint algorithm for P -LCP, whose feasibility step is induced by a kernel function. In Sect. 4 we analyze the feasibility step, and then derive the iteration bound for the algorithm. In Sect. 5 are reported some numerical results. Finally, the concluding

3 B. Kheirfam, M. Haghighi 53 remarks are drawn in Sect. 6.. Full-Newton Step Feasible IPM The P κ-lcp requires the computation of a vector pair x, s R n R n satisfying Mx + s = q, xs = 0, x, s 0, where q R n and M R n n is a P κ-matrix. The class of P -matrices was introduced by Kojima et al. [] and it contains many types of matrices encountered in practical applications. Let κ be a nonnegative number. A matrix M is called a P κ-matrix iff it satisfies the following condition: + 4κ x i Mx i + x i Mx i 0, x R n, i I + i I where I + = {i : x i Mx i 0} and I = {i : x i Mx i < 0} are two index sets. The class of all P κ-matrices is denoted by P κ, and the class P is defined by P = κ 0 P κ, i.e., M is a P -matrix iff M P κ for some κ 0. Obviously, P 0 is the class of positive semidefinite matrices. The concept of the central path plays a critical role in the development of IPMs. Kojima et al. [] first proved the existence and uniqueness of the central path for P κ-lcp. Throughout the paper, we assume that P κ-lcp satisfies the interiorpoint condition IPC, i.e., there exists a pair x 0, s 0 > 0 such that s 0 = Mx 0 + q, which implies the existence of a solution for P κ-lcp []. The basic idea of the path-following IPMs is to replace the second equation in, the so-called complementarity condition for P κ-lcp, by the relaxed equation xs = µe with µ > 0. Thus, we consider the system Mx + s = q, xs = µe, x, s 0. Since M is a P κ-matrix and the IPC holds, the system has a unique solution for each µ > 0 cf. Lemma 4.3 in []. This solution is denoted as xµ, sµ and is called the µ-center of P κ-lcp. The set of µ-centers gives a homotopy path, which is called the central path of P κ-lcp. If µ 0, then the limit of the central path exists and yields a solution for P κ-lcp Theorem 4.4 in []. A promising way to define a search direction is to follow Newton s approach and linearize the second equation in, which leads to the system M x s = 0, x s + s x = µe xs. 3 Since M is a P κ-matrix, the system 3 uniquely defines x, s for any x > 0 and s > 0. For ease of analysis, we define xs v := µ, d x := v x x, d s := v s s. 4

4 54 An infeasible interior-point method for the P -LCP This enables us to rewrite the system 3 as follows: Md x d s = 0, d x + d s = v v, 5 where M := DMD and D := diag x s. Since M is P κ-matrix, it follows that M is also P κ-matrix. Thus, the system 5 has a unique solution. The new search directions d x and d s are obtained by solving 5 so that x and s are computed via 4. The new iterate is obtained by taking a full-newton step according to x + := x + x, s + := s + s. For the analysis of the algorithm, we define a norm-based proximity measure as follows: δv := δx, s; µ := v v. 6 Here, we recall some results which are needed for the analysis of the algorithm. Lemma. Lemma II.6 in [3] Let δ := δx, s; µ. Then ρδ vi ρδ, i =,,..., n, where ρδ := δ + + δ. Lemma. Lemma 3 in [5] Let δ := δx, s; µ < is strictly feasible and δx +, s + ; µ + κδ + κδ.. Then, the full-newton step +κ Corollary. If δ := δx, s; µ +κ, then δx +, s + ; µ + κδ, which shows the local quadratic convergence of the full-newton step. 3. Full-Newton Step IIPM In the case of an IIPM, we call the pair x, s an ɛ-solution of P κ-lcp iff max{ s Mx q, x T s} ɛ. As usual for IIPMs, we assume that the initial iterate x 0, s 0 is as follows x 0, s 0 = ρ p e, ρ d e and µ 0 = ρ d ρ p, 7

5 B. Kheirfam, M. Haghighi 55 where ρ p and ρ d are positive numbers such that x ρ p, { s, ρ p Me, q } ρ d, 8 for some solution x, s. The initial value of the residual vector is denoted as r 0 := s 0 q Mx 0. In general, r 0 0, i.e., the initial iterate is not feasible. However, a sequence of perturbed problems is generated below in such a way that the initial iterate is strictly feasible for the first perturbed problem in the sequence. For this purpose, for any ν with 0 < ν, the perturbed problem pertaining to P κ-lcp is given by s q Mx = νr 0, x, s 0. P ν It is obvious that x, s = x 0, s 0 is a strictly feasible solution of P ν when ν =. This means that if ν =, then P ν satisfies the IPC. Lemma 3. Lemma 3. in [9] Let the problem is feasible and 0 < ν. Then, the perturbed problem P ν satisfies the IPC. Let the problem be feasible and 0 < ν. Then Lemma 3 implies that the problem P ν satisfies the IPC, and therefore its central path exists. This means that the system s q Mx = νr 0, xs = µe, x, s 0, 9 has a unique solution xµ, ν, sµ, ν, for every µ > 0 that is called a µ-center of the problem P ν. In the sequel, the parameters µ and ν always satisfy the relation µ = νµ 0 = νρ p ρ d. It is also worth noting that, according to 7, x 0 s 0 = ρ p ρ d e = µ 0 e. Hence x 0, s 0 is the µ 0 -center of the perturbed problem P ν for ν =. In other words, xµ 0,, sµ 0, = x 0, s 0 and the algorithm can easily be started since we have the initial starting point that is exactly on the central path of P ν for ν =. The outline of one iteration of the algorithm is as follows. Suppose that for some ν 0, ] we have an iterate x, s which satisfies the feasibility condition, i.e., the first equation of the system 9 for µ = νµ 0, and such that δx, s; µ τ. This is certainly true at the start of the first iteration, because initially we have δx, s; µ = 0. Each main iteration of the algorithm consists of a feasibility step, a µ-update and a few centering steps. The feasibility step serves to get an iterate x f, s f that is strictly feasible for P ν + where ν + = θν with 0 < θ <, and belongs to the quadratic convergence region with respect to the µ + -center of P ν + with µ + = θµ, i.e., δx f, s f ; µ + +κ. After the feasibility step, we perform a few centering steps in order to get iterates x +, s + which satisfy δx +, s + ; µ + τ.

6 56 An infeasible interior-point method for the P -LCP 3.. The Feasibility Step Suppose that x, s is a strictly feasible solution for P ν. This means that x, s satisfies the first equation of 9. We need displacements f x and f s such that x f, s f := x + f x, s + f s 0 is feasible for P ν +, this implies that the first equation in the following system is satisfied M f x f s = θνr 0, x f s + s f x = µe xs. The system defines the feasibility iterates uniquely since the coefficients matrix of the resulting system is exactly the same as in the feasible case. We define the scaled search directions d f x := v f x x, df s := v f s, s where v is defined as in 4. The system can be expressed as follows: Md f x d f s = θνvs r 0, d f x + d f s = v v. 3 It is clear that the right-hand side of the second equation in 3 coincides with the negative gradient of the logarithmic barrier function Φv = n i= v i log v i. This coincidence motivates a new feasibility step, which is defined by the following system: Md f x d f s = θνvs r 0, d f x + d f s = Ψv, 4 where Ψv is a kernel function-based barrier function [6] as follows ψt := t + 4 π cotht, where ht = πt + t, t > 0. Since ψ t = t 4 π h t + cot ht = t 4 + t csc ht,

7 B. Kheirfam, M. Haghighi 57 the second equation in 4 can be written as follows d f x + d f s = 4e + v csc hv v. A solution of the system 4 returns d f x and d f s, and then f x and f s compute via. The new iterates are obtained by taking a full step, as given by 0. We conclude that after the feasibility step, we have iterate x f, s f that satisfies the first equation of P ν with ν replaced by ν +. In the analysis, we should also guarantee that x f and s f are positive and δx f, s f ; µ + + κ. 5 If this is satisfied then, by using Corollary, the required number of centering steps can easily be obtained. Starting at x f, s f, after k centering steps we will have the iterate x +, s + := x k, s k that is still feasible for P ν + and satisfies δx +, s + ; µ κδv k 4 [ 4 + κ + κδv k ] 4 k+ + κ δv f k k = + κδv f + κ k. + κ From this one easily deduces that δx +, s + ; µ + τ will hold after at most + log log = + log log τ + κ τ + κ 6 centering steps. 3.. Algorithm The steps of the algorithm are summarized as Algorithm. Algorithm : T he full Newton step IIP M. Input : accuracy parameter ɛ > 0; barrier update parameter θ, 0 < θ < ; threshold parameter 0 < τ <. begin x := ρ pe; s := ρ d e; µ := ρ pρ d ; ν = ; while max x T s, ν r 0 > ɛ x, s := x, s + f x, f s; µ and ν update : µ := θµ, ν := θν; while δx, s; µ > τ x, s := x, s + x, s; endwhile endwhile end.

8 58 An infeasible interior-point method for the P -LCP 4. Analysis of the Algorithm Let x and s denote the iterates at the start of an iteration such that δx, s; µ τ. Recall that at the start of the first iteration this is certainly true, because δx 0, s 0 ; µ 0 = The Effect of the Feasibility Step Recall that the feasibility step generates new iterates x f, s f that satisfy P ν with ν = ν +, except possibly the positive conditions. A crucial element in the analysis is to show that after the feasibility step δx f, s f ; µ + +κ and xf and s f are positive. Note that, by using the second equation in 4 we have x f s f = xs v v + df xv + d f s = µ v + vd f x + d f s + d f xd f s = µ 4ve + v csc hv + d f xd f s. 7 The lemma below provides a sufficient condition for the strict feasibility of the feasibility step x f, s f. Lemma 4. The new iterate x f, s f is strictly feasible if and only if 4ve + v csc hv + d f xd f s > 0. Proof. We introduce a step length α with 0 α, and we define xα := x + α f x, sα := s + α f s. We hence have x0 = x, s0 = s, x = x f, s = s f and x0s0 = xs > 0. On the other hand, we have xαsα = µv + αd f xv + αd f s = µ v + αvd f x + d f s + α d f xd f s = µ v + αv 4e + v csc hv v + α d f xd f s > µ αv + 4αve + v csc hv + α 4ve + v csc hv = µ αv + 4α αve + v csc hv 0. Hence, none of the entries of xα and sα vanishes, for 0 < α. Since x0 and s0 are positive and xα and sα depend linearly on α, this implies that xα > 0 and sα > 0 for 0 < α. Hence, x and s are positive and this completes the proof.

9 B. Kheirfam, M. Haghighi 59 Lemma 5. For π t π, one has cost π π π t + 4 π π t. π Proof. For π t π, we have 0 π t π. Using the inequality cosz 4 π π z π π z, for 0 z π see Remark. in [], we get cost = cosπ t 4 π π π t π π π t. This implies the desired result. Lemma 6. For t > 0, one has + t csc ht 0. Proof. If 0 < t, then we have 0 < ht π. In this case, by using the inequality sinz 4 π z 4 π z for 0 < z π see Remark. in [], we obtain + t csc ht = + t sin ht + t 4 π ht 4 π h t = + t. If t >, to prove the statement, we need to show ft := + t sin ht 0. As π < ht < π, for t >, then we have f t = 4 t sinht πt cosht + t 4 sin 3. ht By using the following inequality sinz 4π π 3 z 3 π π z + π 4 z + 8 3π π

10 60 An infeasible interior-point method for the P -LCP for π z π see Remark.6 in [], we obtain 4π t sinht t π 3 h 3 t + and from Lemma 5 we have π 4 ht + 8 3π π π h t π πt + πt + 8 3π = t + t, 8 π πt cosht πt π π ht + 4 π π π ht t + πt + π = πt + t. 9 Substituting 8 and 9 in f t, we get f t 4 πt 3 + π 5πt π π t 3π t 6 sin 3 ht = πt + π 4πt + 3π 8 + t 6 sin 3 ht which implies that ft is increasing for t >, i.e., ft f = 0. This completes the proof. 0, Lemma 7. For t > 0, the following inequality holds. + t csc ht t. t Proof. From Lemma 6 it suffices to prove + t csc ht t. t We consider two cases: If 0 < t, then we have 0 < ht π. Using sinz 3 π z 4 π z 3 for 0 < z π 3 see Remark.4 in [], we get 3 sin ht π ht 4 t 3 + 6t t π 3 h3 t = + t 6. The above inequality implies that + t csc ht = + t sin ht 4 + t 4 t3 + 6t t. 0

11 B. Kheirfam, M. Haghighi 6 Now, for 0 < t, we have 4 + t 4 t3 + 6t t t t = t t5 3t t t + 3t + t3 + 6t t 0. Using the above inequality, 0 and t t = t t for 0 < t, we obtain 4 + t 4 + t csc ht t3 + 6t t t t = t. t If t >, then we have π ht < π. In this case, by using the inequality sinz 4 π z 3 3 π z + 9 π z, for π z π see Remark.6 in [], we have sin ht which implies that 3 + t 3 t + t + 9t + t = 3t + 6t + t 6, + + t csc t4 ht = + t sin ht 3t + 6t. On the other hand, we have + t 4 3t + 6t t t = tt5 + 3t t t 3t + t3t + 6t 0. From the above inequality, and t t = t t for t, it follows that This completes the proof. + t csc ht + t4 3t + 6t t. t Lemma 8. For t > 0, one has t 4 + t csc ht + t t. t Proof. If 0 < t, then by using the inequality sinz 3 π z 4 π 3 z 3 for 0 < z π see Remark.4 in [], we have 4 + t csc ht t + t t t 4 + t 3 π ht 4 π 3 h 3 t = 4 + t 4 t 3 + 6t t t + t t + t t t t t 0,

12 6 An infeasible interior-point method for the P -LCP where the last inequality follows from fact that the left-hand side of the inequality is monotonically increasing for t. If t >, then t 4 +t csc ht 0 and t t 0. In this case, we have t t csc ht = t + cot + t ht t 4 + t + t The above two inequalities prove the desired result. t. t Lemma 9. For t > 0, one has + t csc ht 4 π t + π t 36. Proof. As 0 < ht < π, for t > 0, then by using the inequality cscz > z + π z 6π z for 0 < z < π see Theorem in [], we have + t csc ht = + t + t ht + + t + πt π ht 6π h t πt + t 6 + t = 4 π t + tπ t t 4 π t + π t 36, where the last inequality follows from the fact that gt := π t ++ +t is nonnegative and decreasing for t > 0, so gt lim gt = π. Therefore, the proof is complete. t 4 In the sequel, we denote w := d f x + d f s, which implies d f xd f s d f x d f s df x + d f s = w, d f xi df si df xi + d f si w, i =,,, n. 3 In what follows, we denote δx f, s f ; µ + also briefly by δv f, where v f := x f s f µ +.

13 B. Kheirfam, M. Haghighi 63 Lemma 0. Let the iterate x f, s f be strictly feasible. Then, we have v f min 3 0ρδw 5 θρδ, where v f min = min i n {vf i }. Proof. Using 7, after dividing both sides by µ + = θµ, we have v f = xf s f µ + = 4ve + v csc hv + d f xd f s. 4 θ Therefore, using 3, Lemma 9 and Lemma, we have v f min = θ min 4v i + v i csc hv i + d f xi i df si min 4vi + v i csc hv i + min d f xi θ df si i i min 4vi + v i csc hv i w θ i 4 min θ i π v i + π v i w 36 4 θ π + π v max 36 v min w 4 θ π ρδ + π 36ρδ w 3 θ 5ρδ w = 3 0ρδw. θ 5ρδ This implies the desired result. Lemma. Proof. The following inequality holds. e v f θ n + δv + w. θ Using 4, the triangular inequality, and Lemma 7, we have e v f = e 4ve + v csc hv + d f xd f s θ = θe 4ve + v csc hv d f θ xd f s θ n + e 4ve + v csc hv + w θ θ n + θ v v + w θ n + δv + w. θ

14 64 An infeasible interior-point method for the P -LCP This completes the proof. Lemma. If 4ve + v csc hv + d f xd f s > 0, then δv f 5ρδ θ n + δ + w θ 3 0ρδw. Proof. We may write, using 6, δv f = v f v f = v f e v f v f e v f = e v f. v f min Using the obtained bounds in Lemma 0 and Lemma the lemma follows. In what follows, we want to choose 0 < θ <, as large as possible, and such that x f, s f lies in the quadratic convergence neighborhood with respect to the µ + -center of P ν +, i.e., δv f +κ. According to Lemma, it suffices to have At this stage, we choose 5ρδ θ n + δ + w θ 3 0ρδw + κ. 5 τ = 6 + κ, θ 5n + κ. 6 Since the left-hand side of 5 is monotonically increasing with respect to w, then, for δ τ, one can verify that for w 3 + κ 7 the inequality 5 holds. 4.. Upper Bound for w We start by finding some bounds for the unique solution of the linear system 4. Lemma 3. Corollary. in [3] Let x, s, a, r be four n-dimensional vectors with x > 0 and s > 0, and let M R n n be a P κ-matrix. Then the solution u, v of the linear system Mu v = b, Su + Xv = a, 8

15 B. Kheirfam, M. Haghighi 65 satisfies the following inequality: Du + D v ã + κ c + b + b ã + b + κ c, where D = X S, ã = XS a, b = D b, c = ã + b. Comparing system 8 with the system 4, which can be expressed equivalently as follows: M f x f s = θνr 0, s f x + x f s = µv Ψv 9 and considering u, v = f x, f s, b = θνr 0 and a = µv Ψv in the system 8, we obtain D f x + D f s XS µv Ψv + θνd r 0 +κ XS µv Ψv + θνd r 0 + θνd r 0 XS µv Ψv + θνd r 0 + κ XS µv Ψv + θνd r 0 = µ Ψv + θ ν D r 0 + κ θνd r 0 µ Ψv +θν D r 0 µ Ψv + θ ν D r 0 + κ θνd r 0 µ Ψv. Let x, s be the optimal solution of that satisfies 8 and suppose that the algorithm starts with x 0, s 0 = ρ p e, ρ d e. Then, we have x x 0 ρ p e, s s 0 ρ d e. 30 Also, by using 8 and 30, we get D r 0 x xr 0 = s r0 = xr 0 xs µvmin µvmin S 0 r 0 s 0 x + ρ p Me + q ρ d x 3ρ d x. 3 µvmin ρ d ρ d µvmin Lemma 4. Let δ := δv. Then, one has Ψv + ρδδ.

16 66 An infeasible interior-point method for the P -LCP Proof. Using Lemma 8 and Lemma, we have Ψv = v 4e + v csc hv e + e + v v v = + + ρδ This completes the proof of lemma. Using 3 and Lemma 4, we get δ = + ρδδ. v v v δ v min θνd r 0 µ Ψv θν D r 0 + µ Ψv 3θνρ d x µvmin + µδ + ρδ. 3 Therefore, using bounds in 3, 3 and the equations D f s = µd f s D f x = µd f x, we obtain and d f x + d f s δ + ρδ + 8θ ν ρ d µ vmin x 3θνρd + κ x + δ + ρδ µv min + 6θνρ d µv min x δ + ρδ + 9θ ν ρ d µ vmin x + κ 3θνρd x + δ + ρδ µv min. 33 Lemma 5. Lemma in [5] Let x, s be feasible for the perturbed problem P ν and let x 0, s 0 and x, s be as defined in 7 and 8, respectively. Then, x + 4κ + ρδ nρ p. Substituting the bounds of x and v min into 33 and using µ = νρ p ρ p, we obtain d f x + d f s δ + ρδ κ θ n ρδ + ρδ +κ 3 + 4κnθρδ + ρδ + δ + ρδ κnθρδ + ρδ δ + ρδ κ θ n ρδ + ρδ + κ 3 + 4κnθρδ + ρδ + δ + ρδ. 34

17 B. Kheirfam, M. Haghighi Fixing θ and Complexity Analysis Since δ τ and the right-hand side of 34 is monotonically increasing in δ, so it follows that d f x + d f s τ + ρτ κ θ n ρτ + ρτ +κ 3 + 4κnθρτ + ρτ + τ + ρτ κnθρτ + ρτ τ + ρτ κ θ n ρτ + ρτ + κ 3 + 4κnθρτ + ρτ + τ + ρτ. Using 6, we have found that δv f +κ holds if the inequality 7 is satisfied. Then, by the above inequality, 7 holds if τ + ρτ κ θ n ρτ + ρτ +κ 3 + 4κnθρτ + ρτ + τ + ρτ κnθρτ + ρτ τ + ρτ κ θ n ρτ + ρτ + κ 3 + 4κnθρτ + ρτ 4 + τ + ρτ 9 + κ. One may easily verify that, by some elementary calculation, the above inequality is satisfied if τ = 6 + κ, θ = 33n + κ 3, 35 which is in agreement with 6. Note that we have found that if at the start of an iteration, δx, s; µ τ, then after the feasibility step, δx f, s f ; µ + +κ. According to 6, at most + log log = τ + κ centering steps are needed to get iterates x +, s + such that δx +, s + ; µ + τ. In each main iteration both the duality gap and the norm of the residual vector are reduced by the factor θ. Hence, the total number of main iterations is bounded above by θ log max{x0 T s 0, r 0 }. ɛ

18 68 An infeasible interior-point method for the P -LCP So, due to 35 the total number of inner iterations is bounded above by 99n + κ 3 log max{x0 T s 0, r 0 }. ɛ In the following we state our main result without further proof. Theorem. If the problem has a solution x, s such that x ρ p and s ρ d, then after at most 99n + κ 3 log max{x0 T s 0, r 0 }, ɛ inner iterations, the algorithm finds an ɛ-optimal solution of. 5. Numerical results We test our algorithm on some instances. We write simple MATLAB codes for our Algorithm and the algorithm of Zhang et al. [4]. In our experiments, we choose x = ρ p e, s = ρ d e and µ = ρ p ρ d as the starting data. In order to guarantee the convergence property of these algorithms, we take the parameters τ and θ as τ = 6+κ, θ = 33n+κ and τ = 3 6, θ = 33n respectively. We terminate the algorithms if xt s ɛ = 0 4. Table shows the required number of iterations for P 0-LCP problems corresponding to positive semidefinite matrices, with various sizes, as follows M,n =...., M 5 6 6,n = n 3 Table problem x ρ p s ρ d ρ p Me ρ d Iter. Algor. Algor. [4] M, M, M, M, M, M, M, One can easily see that the assumptions in the theoretical results are satisfied, i.e., x ρ p, { s, ρ p Me } ρ d and µ = ρ p ρ d. Based on the obtained numerical results, as is shown in Table, our proposed algorithm appears to have a competitive edge over the algorithm in [4].

19 B. Kheirfam, M. Haghighi Concluding Remarks In this paper, we have proposed a full-newton step infeasible interior-point method based on a kernel function for the P -matrix LCP. The iteration bound coincides with the currently best known one for IIPM. For further research, this algorithm may be possible extended to the Cartesian P -matrix LCP over symmetric cones. Acknowledgements The authors are very grateful to the editors and the anonymous referees for their useful comments and suggestions which helped to improve the presentation of this paper. References [] Ch.-P. Chen and F. Qi, Inequalities of some trigonometric functions, Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat , [] T. Illés and M. Nagy, A mizuno-todd-ye type predictor-corrector algorithm for sufficient linear complementarity problems, European J. Oper. Res , 097. [3] J. Ji and F.A. Potra, An infeasible-interior-point method for the p -matrix lcp, Rev. Anal. Numér. Théor. Approx. XXVII 998, no., [4] N.K. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 984, [5] B. Kheirfam, Full-newton step infeasible interior-point algorithm for sufficient linear complementarity problems, TOP Revised. [6], Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Numer. Algorithms 6 0, no. 4, [7], A full nesterov-todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function, Numer. Algebra Contr. Optim. 3 03, no. 4, [8], A full-newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function, Algor. Oper. Res. 7 03, [9], A new complexity analysis for full-newton step infeasible interior-point algorithm for horizontal linear complementarity problems, J. Optim. Theory Appl. 6 04, no. 3, [0] M. Kojima, N. Megiddo, and S. Mizuno, A primal-dual infeasible-interior-point algorithm for linear programming, Math. Program , no. 3,

20 70 An infeasible interior-point method for the P -LCP [] M. Kojima, N. Megiddo, T. Noma, and A. Yoshise, A unified approach to interior point algorithms for linear complementarity problems. lecture notes in comput. sci., vol. 538, Springer-Verlag, Berlin, 99. [] Z. Liu, W. Sun, and F. Tian, A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function, Appl. Math. Optim , [3] I.J. Lustig, Feasible issues in a primal-dual interior-point method for linear programming, Math. Program , no. -3, [4] J. Miao, A quadratically convergent O + κ nl-iteration algorithm for the p κ-matrix linear complementarity problem, Math. Program , [5] S. Mizuno, Polynomiality of infeasible-interior-point algorithms for linear programming, Math. Program , no., [6] S. Mizuno, M.J. Todd, and Y. Ye, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res , no. 4, [7] F.A. Potra, A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points, Math. Program , [8], An onl infeasible-interior-point algorithm for lcp with quadratic convergence, Ann. Oper. Res , 8 0. [9] F.A. Potra and R. Sheng, Predictor-corrector algorithm for solving p κ-matrix lcp from arbitrry positive starting points, Math. Program , no., [0], A large step infeasible interior point method for the p -matrix lcp, SIAM J. Optim , no., [] F. Qi, D.W. Niu, and B.N. Guo, Refinements, generalizations, and applications of jordan s inequality and related problems, Journal of Inequalities and Applications 009, no. Article ID 793, 5 Pages. [] C. Roos, A full-newton step on infeasible interior-point algorithm for linear optimization, SIAM J. Optim , no. 4, [3] C. Roos, T. Terlaky, and J-Ph. Vial, Theory and algorithms for linear optimization. an interior-point approach, John Wiley and Sons, Chichester, UK, 997. [4] L. Zhang, Y.Q. Bai, and Y. Xu, A full-newton step infeasible interior- point algorithm for monotone lcp based on a locally-kernel function, Numer. Algorithms 6 0, no., [5] Y. Zhang, On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem, SIAM J. Optim , no., 08 7.

A FULL-NEWTON STEP INFEASIBLE-INTERIOR-POINT ALGORITHM COMPLEMENTARITY PROBLEMS

A FULL-NEWTON STEP INFEASIBLE-INTERIOR-POINT ALGORITHM COMPLEMENTARITY PROBLEMS Yugoslav Journal of Operations Research 25 (205), Number, 57 72 DOI: 0.2298/YJOR3055034A A FULL-NEWTON STEP INFEASIBLE-INTERIOR-POINT ALGORITHM FOR P (κ)-horizontal LINEAR COMPLEMENTARITY PROBLEMS Soodabeh

More information

A full-newton step feasible interior-point algorithm for P (κ)-lcp based on a new search direction

A full-newton step feasible interior-point algorithm for P (κ)-lcp based on a new search direction Croatian Operational Research Review 77 CRORR 706), 77 90 A full-newton step feasible interior-point algorithm for P κ)-lcp based on a new search direction Behrouz Kheirfam, and Masoumeh Haghighi Department

More information

A full-newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function

A full-newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function Algorithmic Operations Research Vol7 03) 03 0 A full-newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function B Kheirfam a a Department of Mathematics,

More information

An Infeasible Interior-Point Algorithm with full-newton Step for Linear Optimization

An Infeasible Interior-Point Algorithm with full-newton Step for Linear Optimization An Infeasible Interior-Point Algorithm with full-newton Step for Linear Optimization H. Mansouri M. Zangiabadi Y. Bai C. Roos Department of Mathematical Science, Shahrekord University, P.O. Box 115, Shahrekord,

More information

Research Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization

Research Note. A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization Iranian Journal of Operations Research Vol. 4, No. 1, 2013, pp. 88-107 Research Note A New Infeasible Interior-Point Algorithm with Full Nesterov-Todd Step for Semi-Definite Optimization B. Kheirfam We

More information

A Second Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

A Second Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization A Second Full-Newton Step On Infeasible Interior-Point Algorithm for Linear Optimization H. Mansouri C. Roos August 1, 005 July 1, 005 Department of Electrical Engineering, Mathematics and Computer Science,

More information

A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function

A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function A full-newton step infeasible interior-point algorithm for linear programming based on a kernel function Zhongyi Liu, Wenyu Sun Abstract This paper proposes an infeasible interior-point algorithm with

More information

A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE

A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE Yugoslav Journal of Operations Research 24 (2014) Number 1, 35-51 DOI: 10.2298/YJOR120904016K A PREDICTOR-CORRECTOR PATH-FOLLOWING ALGORITHM FOR SYMMETRIC OPTIMIZATION BASED ON DARVAY'S TECHNIQUE BEHROUZ

More information

Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization

Improved Full-Newton Step O(nL) Infeasible Interior-Point Method for Linear Optimization J Optim Theory Appl 2010) 145: 271 288 DOI 10.1007/s10957-009-9634-0 Improved Full-Newton Step OnL) Infeasible Interior-Point Method for Linear Optimization G. Gu H. Mansouri M. Zangiabadi Y.Q. Bai C.

More information

A Full Newton Step Infeasible Interior Point Algorithm for Linear Optimization

A Full Newton Step Infeasible Interior Point Algorithm for Linear Optimization A Full Newton Step Infeasible Interior Point Algorithm for Linear Optimization Kees Roos e-mail: C.Roos@tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos 37th Annual Iranian Mathematics Conference Tabriz,

More information

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization A Full-Newton Step On) Infeasible Interior-Point Algorithm for Linear Optimization C. Roos March 4, 005 February 19, 005 February 5, 005 Faculty of Electrical Engineering, Computer Science and Mathematics

More information

A path following interior-point algorithm for semidefinite optimization problem based on new kernel function. djeffal

A path following interior-point algorithm for semidefinite optimization problem based on new kernel function.   djeffal Journal of Mathematical Modeling Vol. 4, No., 206, pp. 35-58 JMM A path following interior-point algorithm for semidefinite optimization problem based on new kernel function El Amir Djeffal a and Lakhdar

More information

Interior-point algorithm for linear optimization based on a new trigonometric kernel function

Interior-point algorithm for linear optimization based on a new trigonometric kernel function Accepted Manuscript Interior-point algorithm for linear optimization based on a new trigonometric kernel function Xin Li, Mingwang Zhang PII: S0-0- DOI: http://dx.doi.org/./j.orl.0.0.0 Reference: OPERES

More information

Improved Full-Newton-Step Infeasible Interior- Point Method for Linear Complementarity Problems

Improved Full-Newton-Step Infeasible Interior- Point Method for Linear Complementarity Problems Georgia Southern University Digital Commons@Georgia Southern Mathematical Sciences Faculty Publications Mathematical Sciences, Department of 4-2016 Improved Full-Newton-Step Infeasible Interior- Point

More information

Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions

Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions Y B Zhao Abstract It is well known that a wide-neighborhood interior-point algorithm

More information

Local Self-concordance of Barrier Functions Based on Kernel-functions

Local Self-concordance of Barrier Functions Based on Kernel-functions Iranian Journal of Operations Research Vol. 3, No. 2, 2012, pp. 1-23 Local Self-concordance of Barrier Functions Based on Kernel-functions Y.Q. Bai 1, G. Lesaja 2, H. Mansouri 3, C. Roos *,4, M. Zangiabadi

More information

A WIDE NEIGHBORHOOD PRIMAL-DUAL INTERIOR-POINT ALGORITHM WITH ARC-SEARCH FOR LINEAR COMPLEMENTARITY PROBLEMS 1. INTRODUCTION

A WIDE NEIGHBORHOOD PRIMAL-DUAL INTERIOR-POINT ALGORITHM WITH ARC-SEARCH FOR LINEAR COMPLEMENTARITY PROBLEMS 1. INTRODUCTION J Nonlinear Funct Anal 08 (08), Article ID 3 https://doiorg/0395/jnfa083 A WIDE NEIGHBORHOOD PRIMAL-DUAL INTERIOR-POINT ALGORITHM WITH ARC-SEARCH FOR LINEAR COMPLEMENTARITY PROBLEMS BEIBEI YUAN, MINGWANG

More information

A New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization

A New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization A New Class of Polynomial Primal-Dual Methods for Linear and Semidefinite Optimization Jiming Peng Cornelis Roos Tamás Terlaky August 8, 000 Faculty of Information Technology and Systems, Delft University

More information

A PRIMAL-DUAL INTERIOR POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMS. 1. Introduction Consider the quadratic program (PQ) in standard format:

A PRIMAL-DUAL INTERIOR POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMS. 1. Introduction Consider the quadratic program (PQ) in standard format: STUDIA UNIV. BABEŞ BOLYAI, INFORMATICA, Volume LVII, Number 1, 01 A PRIMAL-DUAL INTERIOR POINT ALGORITHM FOR CONVEX QUADRATIC PROGRAMS MOHAMED ACHACHE AND MOUFIDA GOUTALI Abstract. In this paper, we propose

More information

2.1. Jordan algebras. In this subsection, we introduce Jordan algebras as well as some of their basic properties.

2.1. Jordan algebras. In this subsection, we introduce Jordan algebras as well as some of their basic properties. FULL NESTEROV-TODD STEP INTERIOR-POINT METHODS FOR SYMMETRIC OPTIMIZATION G. GU, M. ZANGIABADI, AND C. ROOS Abstract. Some Jordan algebras were proved more than a decade ago to be an indispensable tool

More information

A NEW PROXIMITY FUNCTION GENERATING THE BEST KNOWN ITERATION BOUNDS FOR BOTH LARGE-UPDATE AND SMALL-UPDATE INTERIOR-POINT METHODS

A NEW PROXIMITY FUNCTION GENERATING THE BEST KNOWN ITERATION BOUNDS FOR BOTH LARGE-UPDATE AND SMALL-UPDATE INTERIOR-POINT METHODS ANZIAM J. 49(007), 59 70 A NEW PROXIMITY FUNCTION GENERATING THE BEST KNOWN ITERATION BOUNDS FOR BOTH LARGE-UPDATE AND SMALL-UPDATE INTERIOR-POINT METHODS KEYVAN AMINI and ARASH HASELI (Received 6 December,

More information

Improved Full-Newton-Step Infeasible Interior- Point Method for Linear Complementarity Problems

Improved Full-Newton-Step Infeasible Interior- Point Method for Linear Complementarity Problems Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations Graduate Studies, Jack N. Averitt College of Summer 2015 Improved Full-Newton-Step Infeasible Interior- Point

More information

A new primal-dual path-following method for convex quadratic programming

A new primal-dual path-following method for convex quadratic programming Volume 5, N., pp. 97 0, 006 Copyright 006 SBMAC ISSN 00-805 www.scielo.br/cam A new primal-dual path-following method for convex quadratic programming MOHAMED ACHACHE Département de Mathématiques, Faculté

More information

On Mehrotra-Type Predictor-Corrector Algorithms

On Mehrotra-Type Predictor-Corrector Algorithms On Mehrotra-Type Predictor-Corrector Algorithms M. Salahi, J. Peng, T. Terlaky April 7, 005 Abstract In this paper we discuss the polynomiality of Mehrotra-type predictor-corrector algorithms. We consider

More information

An Infeasible Interior Point Method for the Monotone Linear Complementarity Problem

An Infeasible Interior Point Method for the Monotone Linear Complementarity Problem Int. Journal of Math. Analysis, Vol. 1, 2007, no. 17, 841-849 An Infeasible Interior Point Method for the Monotone Linear Complementarity Problem Z. Kebbiche 1 and A. Keraghel Department of Mathematics,

More information

Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems Georgia Southern University Digital Commons@Georgia Southern Electronic Theses & Dissertations Graduate Studies, Jack N. Averitt College of Fall 2012 Infeasible Full-Newton-Step Interior-Point Method for

More information

A Generalized Homogeneous and Self-Dual Algorithm. for Linear Programming. February 1994 (revised December 1994)

A Generalized Homogeneous and Self-Dual Algorithm. for Linear Programming. February 1994 (revised December 1994) A Generalized Homogeneous and Self-Dual Algorithm for Linear Programming Xiaojie Xu Yinyu Ye y February 994 (revised December 994) Abstract: A generalized homogeneous and self-dual (HSD) infeasible-interior-point

More information

Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path

Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path Copyright information to be inserted by the Publishers Predictor-corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path Florian A. Potra and Xing Liu

More information

Full Newton step polynomial time methods for LO based on locally self concordant barrier functions

Full Newton step polynomial time methods for LO based on locally self concordant barrier functions Full Newton step polynomial time methods for LO based on locally self concordant barrier functions (work in progress) Kees Roos and Hossein Mansouri e-mail: [C.Roos,H.Mansouri]@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/

More information

Interior Point Methods for Nonlinear Optimization

Interior Point Methods for Nonlinear Optimization Interior Point Methods for Nonlinear Optimization Imre Pólik 1 and Tamás Terlaky 2 1 School of Computational Engineering and Science, McMaster University, Hamilton, Ontario, Canada, imre@polik.net 2 School

More information

An O(nL) Infeasible-Interior-Point Algorithm for Linear Programming arxiv: v2 [math.oc] 29 Jun 2015

An O(nL) Infeasible-Interior-Point Algorithm for Linear Programming arxiv: v2 [math.oc] 29 Jun 2015 An O(nL) Infeasible-Interior-Point Algorithm for Linear Programming arxiv:1506.06365v [math.oc] 9 Jun 015 Yuagang Yang and Makoto Yamashita September 8, 018 Abstract In this paper, we propose an arc-search

More information

Lecture 10. Primal-Dual Interior Point Method for LP

Lecture 10. Primal-Dual Interior Point Method for LP IE 8534 1 Lecture 10. Primal-Dual Interior Point Method for LP IE 8534 2 Consider a linear program (P ) minimize c T x subject to Ax = b x 0 and its dual (D) maximize b T y subject to A T y + s = c s 0.

More information

Interior-Point Methods

Interior-Point Methods Interior-Point Methods Stephen Wright University of Wisconsin-Madison Simons, Berkeley, August, 2017 Wright (UW-Madison) Interior-Point Methods August 2017 1 / 48 Outline Introduction: Problems and Fundamentals

More information

An EP theorem for dual linear complementarity problems

An EP theorem for dual linear complementarity problems An EP theorem for dual linear complementarity problems Tibor Illés, Marianna Nagy and Tamás Terlaky Abstract The linear complementarity problem (LCP ) belongs to the class of NP-complete problems. Therefore

More information

Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems

Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems Georgia Southern University Digital Commons@Georgia Southern Electronic Theses and Dissertations Graduate Studies, Jack N. Averitt College of Summer 2011 Full-Newton-Step Interior-Point Method for the

More information

A new Primal-Dual Interior-Point Algorithm for Second-Order Cone Optimization

A new Primal-Dual Interior-Point Algorithm for Second-Order Cone Optimization A new Primal-Dual Interior-Point Algorithm for Second-Order Cone Optimization Y Q Bai G Q Wang C Roos November 4, 004 Department of Mathematics, College Science, Shanghai University, Shanghai, 00436 Faculty

More information

A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes

A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes A tight iteration-complexity upper bound for the MTY predictor-corrector algorithm via redundant Klee-Minty cubes Murat Mut Tamás Terlaky Department of Industrial and Systems Engineering Lehigh University

More information

Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood

Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood J Optim Theory Appl 2016 170:562 590 DOI 10.1007/s10957-015-0826-5 Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood Alireza Asadi 1 Cornelis Roos 1 Published online:

More information

A Second-Order Path-Following Algorithm for Unconstrained Convex Optimization

A Second-Order Path-Following Algorithm for Unconstrained Convex Optimization A Second-Order Path-Following Algorithm for Unconstrained Convex Optimization Yinyu Ye Department is Management Science & Engineering and Institute of Computational & Mathematical Engineering Stanford

More information

A priori bounds on the condition numbers in interior-point methods

A priori bounds on the condition numbers in interior-point methods A priori bounds on the condition numbers in interior-point methods Florian Jarre, Mathematisches Institut, Heinrich-Heine Universität Düsseldorf, Germany. Abstract Interior-point methods are known to be

More information

Lecture 5. Theorems of Alternatives and Self-Dual Embedding

Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 1 Lecture 5. Theorems of Alternatives and Self-Dual Embedding IE 8534 2 A system of linear equations may not have a solution. It is well known that either Ax = c has a solution, or A T y = 0, c

More information

Primal-dual IPM with Asymmetric Barrier

Primal-dual IPM with Asymmetric Barrier Primal-dual IPM with Asymmetric Barrier Yurii Nesterov, CORE/INMA (UCL) September 29, 2008 (IFOR, ETHZ) Yu. Nesterov Primal-dual IPM with Asymmetric Barrier 1/28 Outline 1 Symmetric and asymmetric barriers

More information

Interior Point Methods for Linear Programming: Motivation & Theory

Interior Point Methods for Linear Programming: Motivation & Theory School of Mathematics T H E U N I V E R S I T Y O H F E D I N B U R G Interior Point Methods for Linear Programming: Motivation & Theory Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio

More information

Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path

Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path Mathematical Programming manuscript No. will be inserted by the editor) Florian A. Potra Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path

More information

PRIMAL-DUAL ALGORITHMS FOR SEMIDEFINIT OPTIMIZATION PROBLEMS BASED ON GENERALIZED TRIGONOMETRIC BARRIER FUNCTION

PRIMAL-DUAL ALGORITHMS FOR SEMIDEFINIT OPTIMIZATION PROBLEMS BASED ON GENERALIZED TRIGONOMETRIC BARRIER FUNCTION International Journal of Pure and Applied Mathematics Volume 4 No. 4 07, 797-88 ISSN: 3-8080 printed version); ISSN: 34-3395 on-line version) url: http://www.ijpam.eu doi: 0.73/ijpam.v4i4.0 PAijpam.eu

More information

Interior Point Methods in Mathematical Programming

Interior Point Methods in Mathematical Programming Interior Point Methods in Mathematical Programming Clóvis C. Gonzaga Federal University of Santa Catarina, Brazil Journées en l honneur de Pierre Huard Paris, novembre 2008 01 00 11 00 000 000 000 000

More information

A Simpler and Tighter Redundant Klee-Minty Construction

A Simpler and Tighter Redundant Klee-Minty Construction A Simpler and Tighter Redundant Klee-Minty Construction Eissa Nematollahi Tamás Terlaky October 19, 2006 Abstract By introducing redundant Klee-Minty examples, we have previously shown that the central

More information

Interior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems

Interior Point Methods. We ll discuss linear programming first, followed by three nonlinear problems. Algorithms for Linear Programming Problems AMSC 607 / CMSC 764 Advanced Numerical Optimization Fall 2008 UNIT 3: Constrained Optimization PART 4: Introduction to Interior Point Methods Dianne P. O Leary c 2008 Interior Point Methods We ll discuss

More information

A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region

A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region A Redundant Klee-Minty Construction with All the Redundant Constraints Touching the Feasible Region Eissa Nematollahi Tamás Terlaky January 5, 2008 Abstract By introducing some redundant Klee-Minty constructions,

More information

On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs *

On Superlinear Convergence of Infeasible Interior-Point Algorithms for Linearly Constrained Convex Programs * Computational Optimization and Applications, 8, 245 262 (1997) c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. On Superlinear Convergence of Infeasible Interior-Point Algorithms for

More information

Corrector predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path

Corrector predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path Math. Program., Ser. B 008 111:43 7 DOI 10.1007/s10107-006-0068- FULL LENGTH PAPER Corrector predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path Florian

More information

Lecture 17: Primal-dual interior-point methods part II

Lecture 17: Primal-dual interior-point methods part II 10-725/36-725: Convex Optimization Spring 2015 Lecture 17: Primal-dual interior-point methods part II Lecturer: Javier Pena Scribes: Pinchao Zhang, Wei Ma Note: LaTeX template courtesy of UC Berkeley EECS

More information

McMaster University. Advanced Optimization Laboratory. Title: Computational Experience with Self-Regular Based Interior Point Methods

McMaster University. Advanced Optimization Laboratory. Title: Computational Experience with Self-Regular Based Interior Point Methods McMaster University Advanced Optimization Laboratory Title: Computational Experience with Self-Regular Based Interior Point Methods Authors: Guoqing Zhang, Jiming Peng, Tamás Terlaky, Lois Zhu AdvOl-Report

More information

Lineáris komplementaritási feladatok: elmélet, algoritmusok, alkalmazások

Lineáris komplementaritási feladatok: elmélet, algoritmusok, alkalmazások General LCPs Lineáris komplementaritási feladatok: elmélet, algoritmusok, alkalmazások Illés Tibor BME DET BME Analízis Szeminárium 2015. november 11. Outline Linear complementarity problem: M u + v =

More information

IMPLEMENTING THE NEW SELF-REGULAR PROXIMITY BASED IPMS

IMPLEMENTING THE NEW SELF-REGULAR PROXIMITY BASED IPMS IMPLEMENTING THE NEW SELF-REGULAR PROXIMITY BASED IPMS IMPLEMENTING THE NEW SELF-REGULAR PROXIMITY BASED IPMS By Xiaohang Zhu A thesis submitted to the School of Graduate Studies in Partial Fulfillment

More information

4TE3/6TE3. Algorithms for. Continuous Optimization

4TE3/6TE3. Algorithms for. Continuous Optimization 4TE3/6TE3 Algorithms for Continuous Optimization (Algorithms for Constrained Nonlinear Optimization Problems) Tamás TERLAKY Computing and Software McMaster University Hamilton, November 2005 terlaky@mcmaster.ca

More information

On Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming

On Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming On Generalized Primal-Dual Interior-Point Methods with Non-uniform Complementarity Perturbations for Quadratic Programming Altuğ Bitlislioğlu and Colin N. Jones Abstract This technical note discusses convergence

More information

New Interior Point Algorithms in Linear Programming

New Interior Point Algorithms in Linear Programming AMO - Advanced Modeling and Optimization, Volume 5, Number 1, 2003 New Interior Point Algorithms in Linear Programming Zsolt Darvay Abstract In this paper the abstract of the thesis New Interior Point

More information

AN INTERIOR POINT METHOD, BASED ON RANK-ONE UPDATES, Jos F. Sturm 1 and Shuzhong Zhang 2. Erasmus University Rotterdam ABSTRACT

AN INTERIOR POINT METHOD, BASED ON RANK-ONE UPDATES, Jos F. Sturm 1 and Shuzhong Zhang 2. Erasmus University Rotterdam ABSTRACT October 13, 1995. Revised November 1996. AN INTERIOR POINT METHOD, BASED ON RANK-ONE UPDATES, FOR LINEAR PROGRAMMING Jos F. Sturm 1 Shuzhong Zhang Report 9546/A, Econometric Institute Erasmus University

More information

A polynomial time interior point path following algorithm for LCP based on Chen Harker Kanzow smoothing techniques

A polynomial time interior point path following algorithm for LCP based on Chen Harker Kanzow smoothing techniques Math. Program. 86: 9 03 (999) Springer-Verlag 999 Digital Object Identifier (DOI) 0.007/s007990056a Song Xu James V. Burke A polynomial time interior point path following algorithm for LCP based on Chen

More information

The s-monotone Index Selection Rule for Criss-Cross Algorithms of Linear Complementarity Problems

The s-monotone Index Selection Rule for Criss-Cross Algorithms of Linear Complementarity Problems The s-monotone Index Selection Rule for Criss-Cross Algorithms of Linear Complementarity Problems Zsolt Csizmadia and Tibor Illés and Adrienn Nagy February 24, 213 Abstract In this paper we introduce the

More information

The Q Method for Symmetric Cone Programmin

The Q Method for Symmetric Cone Programmin The Q Method for Symmetric Cone Programming The Q Method for Symmetric Cone Programmin Farid Alizadeh and Yu Xia alizadeh@rutcor.rutgers.edu, xiay@optlab.mcma Large Scale Nonlinear and Semidefinite Progra

More information

Primal-dual path-following algorithms for circular programming

Primal-dual path-following algorithms for circular programming Primal-dual path-following algorithms for circular programming Baha Alzalg Department of Mathematics, The University of Jordan, Amman 1194, Jordan July, 015 Abstract Circular programming problems are a

More information

Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization

Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization Primal-dual relationship between Levenberg-Marquardt and central trajectories for linearly constrained convex optimization Roger Behling a, Clovis Gonzaga b and Gabriel Haeser c March 21, 2013 a Department

More information

Interior Point Methods for Mathematical Programming

Interior Point Methods for Mathematical Programming Interior Point Methods for Mathematical Programming Clóvis C. Gonzaga Federal University of Santa Catarina, Florianópolis, Brazil EURO - 2013 Roma Our heroes Cauchy Newton Lagrange Early results Unconstrained

More information

Semidefinite Programming

Semidefinite Programming Chapter 2 Semidefinite Programming 2.0.1 Semi-definite programming (SDP) Given C M n, A i M n, i = 1, 2,..., m, and b R m, the semi-definite programming problem is to find a matrix X M n for the optimization

More information

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 479 491 issn 0364-765X eissn 1526-5471 04 2903 0479 informs doi 10.1287/moor.1040.0103 2004 INFORMS Some Properties of the Augmented

More information

Nonsymmetric potential-reduction methods for general cones

Nonsymmetric potential-reduction methods for general cones CORE DISCUSSION PAPER 2006/34 Nonsymmetric potential-reduction methods for general cones Yu. Nesterov March 28, 2006 Abstract In this paper we propose two new nonsymmetric primal-dual potential-reduction

More information

Lecture: Algorithms for LP, SOCP and SDP

Lecture: Algorithms for LP, SOCP and SDP 1/53 Lecture: Algorithms for LP, SOCP and SDP Zaiwen Wen Beijing International Center For Mathematical Research Peking University http://bicmr.pku.edu.cn/~wenzw/bigdata2018.html wenzw@pku.edu.cn Acknowledgement:

More information

A projection algorithm for strictly monotone linear complementarity problems.

A projection algorithm for strictly monotone linear complementarity problems. A projection algorithm for strictly monotone linear complementarity problems. Erik Zawadzki Department of Computer Science epz@cs.cmu.edu Geoffrey J. Gordon Machine Learning Department ggordon@cs.cmu.edu

More information

A derivative-free nonmonotone line search and its application to the spectral residual method

A derivative-free nonmonotone line search and its application to the spectral residual method IMA Journal of Numerical Analysis (2009) 29, 814 825 doi:10.1093/imanum/drn019 Advance Access publication on November 14, 2008 A derivative-free nonmonotone line search and its application to the spectral

More information

A Weighted-Path-Following Interior-Point Algorithm for Second-Order Cone Optimization

A Weighted-Path-Following Interior-Point Algorithm for Second-Order Cone Optimization Appl Math Inf Sci 9, o, 973-980 (015) 973 Applied Mathematics & Information Sciences An International Journal http://dxdoiorg/101785/amis/0908 A Weighted-Path-Following Interior-Point Algorithm for Second-Order

More information

c 2005 Society for Industrial and Applied Mathematics

c 2005 Society for Industrial and Applied Mathematics SIAM J. OPTIM. Vol. 15, No. 4, pp. 1147 1154 c 2005 Society for Industrial and Applied Mathematics A NOTE ON THE LOCAL CONVERGENCE OF A PREDICTOR-CORRECTOR INTERIOR-POINT ALGORITHM FOR THE SEMIDEFINITE

More information

COMPARATIVE STUDY BETWEEN LEMKE S METHOD AND THE INTERIOR POINT METHOD FOR THE MONOTONE LINEAR COMPLEMENTARY PROBLEM

COMPARATIVE STUDY BETWEEN LEMKE S METHOD AND THE INTERIOR POINT METHOD FOR THE MONOTONE LINEAR COMPLEMENTARY PROBLEM STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume LIII, Number 3, September 2008 COMPARATIVE STUDY BETWEEN LEMKE S METHOD AND THE INTERIOR POINT METHOD FOR THE MONOTONE LINEAR COMPLEMENTARY PROBLEM ADNAN

More information

IMPLEMENTATION OF INTERIOR POINT METHODS

IMPLEMENTATION OF INTERIOR POINT METHODS IMPLEMENTATION OF INTERIOR POINT METHODS IMPLEMENTATION OF INTERIOR POINT METHODS FOR SECOND ORDER CONIC OPTIMIZATION By Bixiang Wang, Ph.D. A Thesis Submitted to the School of Graduate Studies in Partial

More information

On the complexity of computing the handicap of a sufficient matrix

On the complexity of computing the handicap of a sufficient matrix Math. Program., Ser. B (2011) 129:383 402 DOI 10.1007/s10107-011-0465-z FULL LENGTH PAPER On the complexity of computing the handicap of a sufficient matrix Etienne de Klerk Marianna E. -Nagy Received:

More information

Interior-Point Methods for Linear Optimization

Interior-Point Methods for Linear Optimization Interior-Point Methods for Linear Optimization Robert M. Freund and Jorge Vera March, 204 c 204 Robert M. Freund and Jorge Vera. All rights reserved. Linear Optimization with a Logarithmic Barrier Function

More information

New stopping criteria for detecting infeasibility in conic optimization

New stopping criteria for detecting infeasibility in conic optimization Optimization Letters manuscript No. (will be inserted by the editor) New stopping criteria for detecting infeasibility in conic optimization Imre Pólik Tamás Terlaky Received: March 21, 2008/ Accepted:

More information

Infeasible Primal-Dual (Path-Following) Interior-Point Methods for Semidefinite Programming*

Infeasible Primal-Dual (Path-Following) Interior-Point Methods for Semidefinite Programming* Infeasible Primal-Dual (Path-Following) Interior-Point Methods for Semidefinite Programming* Yin Zhang Dept of CAAM, Rice University Outline (1) Introduction (2) Formulation & a complexity theorem (3)

More information

PRIMAL-DUAL ENTROPY-BASED INTERIOR-POINT ALGORITHMS FOR LINEAR OPTIMIZATION

PRIMAL-DUAL ENTROPY-BASED INTERIOR-POINT ALGORITHMS FOR LINEAR OPTIMIZATION PRIMAL-DUAL ENTROPY-BASED INTERIOR-POINT ALGORITHMS FOR LINEAR OPTIMIZATION MEHDI KARIMI, SHEN LUO, AND LEVENT TUNÇEL Abstract. We propose a family of search directions based on primal-dual entropy in

More information

Optimization: Then and Now

Optimization: Then and Now Optimization: Then and Now Optimization: Then and Now Optimization: Then and Now Why would a dynamicist be interested in linear programming? Linear Programming (LP) max c T x s.t. Ax b αi T x b i for i

More information

A class of Smoothing Method for Linear Second-Order Cone Programming

A class of Smoothing Method for Linear Second-Order Cone Programming Columbia International Publishing Journal of Advanced Computing (13) 1: 9-4 doi:1776/jac1313 Research Article A class of Smoothing Method for Linear Second-Order Cone Programming Zhuqing Gui *, Zhibin

More information

Penalty and Barrier Methods General classical constrained minimization problem minimize f(x) subject to g(x) 0 h(x) =0 Penalty methods are motivated by the desire to use unconstrained optimization techniques

More information

Curvature as a Complexity Bound in Interior-Point Methods

Curvature as a Complexity Bound in Interior-Point Methods Lehigh University Lehigh Preserve Theses and Dissertations 2014 Curvature as a Complexity Bound in Interior-Point Methods Murat Mut Lehigh University Follow this and additional works at: http://preserve.lehigh.edu/etd

More information

A Polynomial Column-wise Rescaling von Neumann Algorithm

A Polynomial Column-wise Rescaling von Neumann Algorithm A Polynomial Column-wise Rescaling von Neumann Algorithm Dan Li Department of Industrial and Systems Engineering, Lehigh University, USA Cornelis Roos Department of Information Systems and Algorithms,

More information

informs DOI /moor.xxxx.xxxx c 200x INFORMS

informs DOI /moor.xxxx.xxxx c 200x INFORMS MATHEMATICS OF OPERATIONS RESEARCH Vol. xx, No. x, Xxxxxxx 2x, pp. xxx xxx ISSN 364-765X EISSN 526-547 x xxx xxx informs DOI.287/moor.xxxx.xxxx c 2x INFORMS A New Complexity Result on Solving the Markov

More information

On the Local Quadratic Convergence of the Primal-Dual Augmented Lagrangian Method

On the Local Quadratic Convergence of the Primal-Dual Augmented Lagrangian Method Optimization Methods and Software Vol. 00, No. 00, Month 200x, 1 11 On the Local Quadratic Convergence of the Primal-Dual Augmented Lagrangian Method ROMAN A. POLYAK Department of SEOR and Mathematical

More information

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint

A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint Iranian Journal of Operations Research Vol. 2, No. 2, 20, pp. 29-34 A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint M. Salahi Semidefinite

More information

W. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES

W. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES F A S C I C U L I M A T H E M A T I C I Nr 55 5 DOI:.55/fascmath-5-7 W. Lenski and B. Szal ON POINTWISE APPROXIMATION OF FUNCTIONS BY SOME MATRIX MEANS OF CONJUGATE FOURIER SERIES Abstract. The results

More information

On well definedness of the Central Path

On well definedness of the Central Path On well definedness of the Central Path L.M.Graña Drummond B. F. Svaiter IMPA-Instituto de Matemática Pura e Aplicada Estrada Dona Castorina 110, Jardim Botânico, Rio de Janeiro-RJ CEP 22460-320 Brasil

More information

1. Introduction A number of recent papers have attempted to analyze the probabilistic behavior of interior point algorithms for linear programming. Ye

1. Introduction A number of recent papers have attempted to analyze the probabilistic behavior of interior point algorithms for linear programming. Ye Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming Kurt M. Anstreicher 1, Jun Ji 2, Florian A. Potra 3, and Yinyu Ye 4 Final Revision June, 1998 Abstract We consider

More information

Largest dual ellipsoids inscribed in dual cones

Largest dual ellipsoids inscribed in dual cones Largest dual ellipsoids inscribed in dual cones M. J. Todd June 23, 2005 Abstract Suppose x and s lie in the interiors of a cone K and its dual K respectively. We seek dual ellipsoidal norms such that

More information

1. Introduction and background. Consider the primal-dual linear programs (LPs)

1. Introduction and background. Consider the primal-dual linear programs (LPs) SIAM J. OPIM. Vol. 9, No. 1, pp. 207 216 c 1998 Society for Industrial and Applied Mathematics ON HE DIMENSION OF HE SE OF RIM PERURBAIONS FOR OPIMAL PARIION INVARIANCE HARVEY J. REENBER, ALLEN. HOLDER,

More information

2 The SDP problem and preliminary discussion

2 The SDP problem and preliminary discussion Int. J. Contemp. Math. Sciences, Vol. 6, 2011, no. 25, 1231-1236 Polynomial Convergence of Predictor-Corrector Algorithms for SDP Based on the KSH Family of Directions Feixiang Chen College of Mathematics

More information

Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method

Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Primal-Dual Interior-Point Methods for Linear Programming based on Newton s Method Robert M. Freund March, 2004 2004 Massachusetts Institute of Technology. The Problem The logarithmic barrier approach

More information

Second-order cone programming

Second-order cone programming Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The

More information

Interior Point Methods: Second-Order Cone Programming and Semidefinite Programming

Interior Point Methods: Second-Order Cone Programming and Semidefinite Programming School of Mathematics T H E U N I V E R S I T Y O H F E D I N B U R G Interior Point Methods: Second-Order Cone Programming and Semidefinite Programming Jacek Gondzio Email: J.Gondzio@ed.ac.uk URL: http://www.maths.ed.ac.uk/~gondzio

More information

Operations Research Lecture 4: Linear Programming Interior Point Method

Operations Research Lecture 4: Linear Programming Interior Point Method Operations Research Lecture 4: Linear Programg Interior Point Method Notes taen by Kaiquan Xu@Business School, Nanjing University April 14th 2016 1 The affine scaling algorithm one of the most efficient

More information

Using Schur Complement Theorem to prove convexity of some SOC-functions

Using Schur Complement Theorem to prove convexity of some SOC-functions Journal of Nonlinear and Convex Analysis, vol. 13, no. 3, pp. 41-431, 01 Using Schur Complement Theorem to prove convexity of some SOC-functions Jein-Shan Chen 1 Department of Mathematics National Taiwan

More information

A SECOND ORDER MEHROTRA-TYPE PREDICTOR-CORRECTOR ALGORITHM FOR SEMIDEFINITE OPTIMIZATION

A SECOND ORDER MEHROTRA-TYPE PREDICTOR-CORRECTOR ALGORITHM FOR SEMIDEFINITE OPTIMIZATION J Syst Sci Complex (01) 5: 1108 111 A SECOND ORDER MEHROTRA-TYPE PREDICTOR-CORRECTOR ALGORITHM FOR SEMIDEFINITE OPTIMIZATION Mingwang ZHANG DOI: 10.1007/s1144-01-0317-9 Received: 3 December 010 / Revised:

More information