Merit functions for semi-definite complemetarity problems

Paul Tseng

doi:10.1007/bf02680556

journal article Jan 01, 1998

Merit functions for semi-definite complemetarity problems

Paul Tseng

Mathematical Programming Vol. 83 No. 1-3 pp. 159-185 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf02680556

Topics

No keywords indexed for this article. Browse by subject →

References

66

[1]

F. Alizadeh, Interior point methods in semidefinite programming with application to combinatorial optimization. SIAM Journal on Optimization 5 (1995) 13–51. 10.1137/0805002

[2]

F. Alizadeh, J.-P.A. Haeberly, M.L. Overton, Primal-dual interior point methods for semidefinite programming, Working paper, RUTCOR, Rutgers University, New Brunswick, 1994.

[3]

G. Auchmuty, Variational principles for variational inequalities. Numerical Functional Analysis and Optimization 10 (1989) 863–874. 10.1080/01630568908816335

[4]

A. Auslender, Optimisation: Méthodes Numériques, Masson, Paris, 1976.

[5]

S. Boyd, L. El Ghaoui, E. Feron, V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, 1994. 10.1137/1.9781611970777

[6]

C. Chen, O.L. Mangasarian, A class of smoothing functions for nonlinear and mixed complementarity problems, Computational Optimization and Applications 5 (1996) 97–138. 10.1007/bf00249052

[7]

R.W. Cottle, J.-S. Pang, R.E. Stone, The Linear Complementarity Problems, Academic Press, New York, 1992.

[8]

T. De Luca, F. Facchinei, C. Kanzow, A semismooth equation approach to the solution of nonlinear complementarity problems, Mathematical Programming 75 (1996) 407–439.

[9]

Y.G. Evtushenko, V.A. Purtov, Sufficient conditions for a minimum for nonlinear programming problems, Soviet Mathematics Doklady 30 (1984) 313–316.

[10]

F. Facchinei, C. Kanzow, A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems. Mathematical Programming 76 (1997) 493–512.

[11]

F. Facchinei, C. Kanzow, On unconstrained and constrained stationary points of the implicit Lagrangian, Journal of Optimization Theory and Applications 94 (1997) 99–115. 10.1023/a:1022688013571

[12]

F. Facchinei, A. Fischer, C. Kanzow, Inexact Newton methods for semismooth equations with applications to variational inequality problems, in: G. Di Pillo, F. Giannessi (Eds.), Nonlinear Optimization and Applications., Plenum Press, New York, 1996, pp. 125–139. 10.1007/978-1-4899-0289-4_9

[13]

F. Facchinei, J. Soares, Testing a new class of algorithms for nonlinear complementarity problems, in: F. Giannessi, A. Maugeri (Eds.), Variational Inequalities and Network Equilibrium Problems, Plenum Press, New York, 1995, pp. 69–83.

[14]

F. Facchinei, J. Soares, A new merit function for nonlinear complementarity problems and a related algorithm, SIAM Journal on Optimization 7 (1997) 225–247. 10.1137/s1052623494279110

[15]

A. Fischer, A special Newton-type optimization method, Optimization 24 (1992) 269–284. 10.1080/02331939208843795

[16]

A. Fischer, An NCP-function and its use for the solution of complementarity problems, in: D.-Z. Du, L. Qi, R. Womersley, (Eds.), Recent Advances in Nonsmooth Optimization, World Scientific, Singapore, 1995, pp. 88–105. 10.1142/9789812812827_0006

[17]

A. Fischer, A Newton-type method for positive semidefinite linear complementarity problems, Journal of Optimization Theory and Applications 86 (1995) 585–608. 10.1007/bf02192160

[18]

A. Fischer, On the local superlinear convergence of a Newton-type method for LCP under weak conditions, Optimization Methods and Software 6 (1995) 83–107. 10.1080/10556789508805627

[19]

A. Fischer, Solution of the monotone complementarity problem with locally Lipschitzian functions, Mathematical Programming 76 (1997) 513–532.

[20]

Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems

Masao Fukushima

Mathematical Programming 1992 10.1007/bf01585696

[21]

M. Fukushima, Merit functions for variational inequality and complementarity problems, in: G. Di Pillo, F. Giannessi (Eds.), Nonlinear Optimization and Applications, Plenum Press, New York, 1996, pp. 155–170. 10.1007/978-1-4899-0289-4_11

[22]

C. Geiger, C. Kanzow, On the resolution of monotone complementarity problems., Computational Optimization and Applications 5 (1996) 155–173. 10.1007/bf00249054

[23]

A preliminary version appeared in Proceedings of the 26th Annual ACM Symposium on Theory of Computing 1994.

[24]

D.W. Hearn, The gap function of a convex program, Operations Research Letters 1 (1982) 67–71. 10.1016/0167-6377(82)90049-9

[25]

C. Helmberg, F. Rendl, R.J. Vanderbei, H. Wolkowicz, An interior-point method for semidefinite programming, SIAM Journal on Optimization 6 (1996) 342–361. 10.1137/0806020

[26]

Matrix Analysis

Roger A. Horn, Charles R. Johnson

1985 10.1017/cbo9780511810817

[27]

F. Jarre, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM Journal on Control and Optimization 31 (1993) 1360–1377. 10.1137/0331064

[28]

H. Jiang, Unconstrained minimization approaches to nonlinear complementarity problems, Journal of Global Optimization 9 (1996) 169–181. 10.1007/bf00121662

[29]

H. Jiang, L. Qi, A new nonsmooth equations approach to nonlinear complementarities, SIAM Journal on Control and Optimization 35 (1997) 178–193. 10.1137/s0363012994276494

[30]

C. Kanzow, Some equation-based methods for the nonlinear complementarity problem, Optimization Methods and Software 3 (1994) 327–340. 10.1080/10556789408805573

[31]

C. Kanzow, Global convergence properties of some iterative methods for linear complementarity problems, SIAM Journal on Optimization 6 (1996) 326–341. 10.1137/0806019

[32]

C. Kanzow, Nonlinear complementarity as unconstrained optimization, Journal of Optimization Theory and Applications 88 (1996) 139–155. 10.1007/bf02192026

[33]

C. Kanzow, M. Fukushima, Equivalence of the generalized complementarity problem to differentiable unconstrained minimization, Journal of Optimization Theory and Applications 90 (1996) 581–603. 10.1007/bf02189797

[34]

C. Kanzow, H. Kleinmichel, A class of Newton-type methods for equality and inequality constrained optimization, Optimization Methods and Software 5 (1995) 173–198. 10.1080/10556789508805608

[35]

M. Kojima, S. Shindoh, S. Hara, Interior-point methods for the monotone semidefinite linear complementarity problems, SIAM Journal of Optimization 7 (1997) 86–125. 10.1137/s1052623494269035

[36]

T. Larsson, M. Patriksson, A class of gap functions for variational inequalities. Mathermatical Programming 64 (1994) 53–79. 10.1007/bf01582565

[37]

X.-D. Luo, P. Tseng, On a global projection-type error bound for the linear complernentarity problem, Linear Algebra and Its Applications 253 (1997) 251–278. 10.1016/0024-3795(95)00707-5

[38]

Z.-Q. Luo, O.L. Mangasarian, J. Ren, M.V. Solodov, New error bounds for the linear complementarity problem, Mathematics of Operations Research 19 (1994) 880–892. 10.1287/moor.19.4.880

[39]

Z.-Q. Luo, J.-S. Pang. Error bounds for analytic systems and their applications, Mathematical Programming 67 (1995) 1–28. 10.1007/bf01582210

[40]

Z.-Q. Luo, P. Tseng, On a global error bound for a class of monotone affine variational inequality problems, Operations Research Letters 11 (1992) 159–165. 10.1016/0167-6377(92)90080-m

[41]

Z.-Q., Luo, P. Tseng, Error bounds and convergence analysis of feasible descent methods: A general approach, Annals of Operations Research 46 (1993) 157–178. 10.1007/bf02096261

[42]

Z.-Q. Luo, P. Tseng, A new class of merit functions for the nonlinear complementarity problem, in: M.C. Ferris, J.S. Pang (Eds.), Complementarity and Variational Problems: State of the Art, SIAM, Philadelphia, 1997, pp. 204–225.

[43]

O.L. Mangasarian, Equivalence of the complementarity problem, to a system of nonlinear equations, SIAM Journal of Applied Mathematics 31 (1976) 89–92. 10.1137/0131009

[44]

O.L. Mangasarian, M.V. Solodov, Nonlinear complementarity as unconstrained and constrained minimization, Mathematical Programming 62 (1993) 277–297. 10.1007/bf01585171

[45]

R. Mathias, J.-S. Pang, Error bounds for the linear complementarity problem with aP-matrix, Linear Algebra and Its Applications 132 (1990) 123–136. 10.1016/0024-3795(90)90058-k

[46]

Y.E. Nesterov, A.S. Nemirovskii, Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, 1993.

[47]

Y.E. Nesterov, M.J. Todd, Primal-dual interior-point methods for self-scaled cones, Technical report 1125, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, 1995; revised February 1996.

[48]

J.-S. Pang. A Posteriori Error bounds for the linearly-constrained variational inequality problem, Mathematics of Operations Research 12 (1987) 474–484. 10.1287/moor.12.3.474

[49]

J.-S. Pang, Complementarity problems, in: R. Horst, P. Pardalos (Eds.), Handbook on Global Optimization, Kluwer Academic Publishers, Norwell, 1995, pp. 271–338. 10.1007/978-1-4615-2025-2_6

[50]

J.-S. Pang, S.A. Gabriel, NE/SQP: A robust algorithm for the nonlinear complementarity problem, Mathematical Programming 60 (1993) 295–337. 10.1007/bf01580617

Showing 50 of 66 references

Cited By

48

Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems

Yi-Fen Ke · 2020

Numerical Algorithms

Metrics

48

Citations

66

References

Details

Published: Jan 01, 1998
Vol/Issue: 83(1-3)
Pages: 159-185
License: View

Authors

P

Paul Tseng

Cite This Article

Paul Tseng (1998). Merit functions for semi-definite complemetarity problems. Mathematical Programming, 83(1-3), 159-185. https://doi.org/10.1007/bf02680556

Merit functions for semi-definite complemetarity problems

You May Also Like