메뉴 건너뛰기




Volumn 16, Issue 2, 2006, Pages 587-609

A two-sided relaxation scheme for mathematical programs with equilibrium constraints

Author keywords

Barrier methods; Complementarity constraints; Constrained minimization; Interior point methods; Mathematical programs with equilibrium constraints; Nonlinear programming; Primal dual methods

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; NUMERICAL ANALYSIS; PROBLEM SOLVING; RELAXATION PROCESSES;

EID: 33646718434     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/04060754x     Document Type: Article
Times cited : (66)

References (24)
  • 1
    • 0042497911 scopus 로고    scopus 로고
    • On solving mathematical programs with complementarity constraints as non-linear programs
    • Argonne National Laboratory, Argonne, IL
    • M. ANITESCU, On Solving Mathematical Programs with Complementarity Constraints as Non-linear Programs, Tech. Report ANL/MCS-P864-1200, Argonne National Laboratory, Argonne, IL, 2000.
    • (2000) Tech. Report ANL/MCS-P864-1200
    • Anitescu, M.1
  • 2
    • 33644688593 scopus 로고    scopus 로고
    • Global convergence of an elastic mode approach for a class of mathematical programs with complementarity constraints
    • Argonne National Laboratory, Argonne, IL
    • M. ANITESCU, Global Convergence of an Elastic Mode Approach for a Class of Mathematical Programs with Complementarity Constraints, Tech. Report ANL/MCS-P1143-0404, Argonne National Laboratory, Argonne, IL, 2004.
    • (2004) Tech. Report ANL/MCS-P1143-0404
    • Anitescu, M.1
  • 3
    • 13844317705 scopus 로고    scopus 로고
    • Interior-point algorithms, penalty methods and equilibrium problems
    • Operations Research and Financial Engineering, Princeton University, Princeton, NJ
    • H. Y. BENSON, A. SEN, D. F. SHANNO, AND R. J. VANDERBEI, Interior-Point Algorithms, Penalty Methods and Equilibrium Problems, Tech. Report ORFE-03-02, Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 2003.
    • (2003) Tech. Report ORFE-03-02
    • Benson, H.Y.1    Sen, A.2    Shanno, D.F.3    Vanderbei, R.J.4
  • 4
    • 1542321969 scopus 로고    scopus 로고
    • Interior-point methods for nonconvex nonlinear programming: Complementarity constraints
    • Operations Research and Financial Engineering, Princeton University, Princeton, NJ
    • H. Y. BENSON, D. F. SHANNO, AND R. J. VANDERBEI, Interior-Point Methods for Nonconvex Nonlinear Programming: Complementarity Constraints, Tech. Report ORFE-02-02, Operations Research and Financial Engineering, Princeton University, Princeton, NJ, 2002.
    • (2002) Tech. Report ORFE-02-02
    • Benson, H.Y.1    Shanno, D.F.2    Vanderbei, R.J.3
  • 5
    • 0031352141 scopus 로고    scopus 로고
    • Engineering and economic applications of complementarity problems
    • M. C. FERRIS AND J. S. PANG, Engineering and economic applications of complementarity problems, SIAM Rev., 39 (1997), pp. 669-713.
    • (1997) SIAM Rev. , vol.39 , pp. 669-713
    • Ferris, M.C.1    Pang, J.S.2
  • 6
    • 0013159608 scopus 로고    scopus 로고
    • Local convergence of SQP methods for mathematical programs with equilibrium constraints
    • University of Dundee, Dundee, Scotland, UK
    • R. FLETCHER, S. LEYFFER, D. RALPH, AND S. SCHOLTES, Local Convergence of SQP Methods for Mathematical Programs with Equilibrium Constraints, Tech. Report NA-209, University of Dundee, Dundee, Scotland, UK, 2002.
    • (2002) Tech. Report NA-209
    • Fletcher, R.1    Leyffer, S.2    Ralph, D.3    Scholtes, S.4
  • 7
    • 0043138172 scopus 로고    scopus 로고
    • Numerical experience with solving MPECs as NLPs
    • University of Dundee, Dundee, Scotland, UK, August
    • R. FLETCHER AND S. LEYFFER, Numerical Experience with Solving MPECs as NLPs, Tech. Report NA-210, University of Dundee, Dundee, Scotland, UK, August, 2002.
    • (2002) Tech. Report NA-210
    • Fletcher, R.1    Leyffer, S.2
  • 8
    • 19844373567 scopus 로고    scopus 로고
    • A globally convergent linearly constrained Lagran-gian method for nonlinear optimization
    • M. P. FRIEDLANDER AND M. A. SAUNDERS, A globally convergent linearly constrained Lagran-gian method for nonlinear optimization, SIAM J. Optim., 15 (2004), pp. 863-897.
    • (2004) SIAM J. Optim. , vol.15 , pp. 863-897
    • Friedlander, M.P.1    Saunders, M.A.2
  • 9
    • 8644263217 scopus 로고    scopus 로고
    • Convergence of a penalty method for mathematical programming with complementarity constraints
    • X. HU AND D. RALPH, Convergence of a penalty method for mathematical programming with complementarity constraints, J. Optim. Theory Appl., 123 (2004), pp. 365-390.
    • (2004) J. Optim. Theory Appl. , vol.123 , pp. 365-390
    • Hu, X.1    Ralph, D.2
  • 10
    • 33646755456 scopus 로고    scopus 로고
    • Interior Methods for Mathematical Programs with Complementarity Constraints
    • Argonne National Laboratory, Argonne, IL
    • S. LEYFFER, G. LOPEZ-CALVA, AND J. NOCEDAL, Interior Methods for Mathematical Programs with Complementarity Constraints, Tech. Report ANL/MCS-P-1211-1204, Argonne National Laboratory, Argonne, IL, 2004.
    • (2004) Tech. Report ANL/MCS-P-1211-1204
    • Leyffer, S.1    Lopez-Calva, G.2    Nocedal, J.3
  • 12
    • 33646730534 scopus 로고    scopus 로고
    • Generalized stationary points and an interior point method for mathematical programs with equilibrium constraints
    • National University of Singapore, Singapore
    • X. LIU AND J. SUN, Generalized Stationary Points and an Interior Point Method for Mathematical Programs with Equilibrium Constraints, Tech. Report, National University of Singapore, Singapore, 2001.
    • (2001) Tech. Report
    • Liu, X.1    Sun, J.2
  • 14
    • 21044448471 scopus 로고    scopus 로고
    • An augmented lagrangian interior-point method using directions of negative curvature
    • J. MOGUERZA AND F. PRIETO, An augmented lagrangian interior-point method using directions of negative curvature, Math. Program. A, 95 (2003), pp. 573-616.
    • (2003) Math. Program. A , vol.95 , pp. 573-616
    • Moguerza, J.1    Prieto, F.2
  • 15
    • 0003446306 scopus 로고
    • Tech. Report 83-20R, Systems Optimization Laboratory, Department of Management Science and Engineering, Stanford University, Stanford, CA, December
    • B. A. MURTAGH AND M. A. SAUNDERS, MINOS 5.5 User's Guide, Tech. Report 83-20R, Systems Optimization Laboratory, Department of Management Science and Engineering, Stanford University, Stanford, CA, December, 1983.
    • (1983) MINOS 5.5 User's Guide
    • Murtagh, B.A.1    Saunders, M.A.2
  • 18
    • 6344242214 scopus 로고    scopus 로고
    • Interior point methods for mathematical programs with complementarity constraints
    • Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA
    • A. U. RAGHUNATHAN AND L. T. BIEGLER, Interior Point Methods for Mathematical Programs with Complementarity Constraints, Tech. Report, Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, PA, 2003.
    • (2003) Tech. Report
    • Raghunathan, A.U.1    Biegler, L.T.2
  • 19
    • 6344283372 scopus 로고    scopus 로고
    • Some properties of regularization schemes for MPECs
    • Computer Sciences, University of Wisconsin, Madison, Wisconsin, December
    • D. RALPH AND S. J. WRIGHT, Some Properties of Regularization Schemes for MPECs, Tech. Report 03-04, Computer Sciences, University of Wisconsin, Madison, Wisconsin, December, 2003.
    • (2003) Tech. Report 03-04
    • Ralph, D.1    Wright, S.J.2
  • 20
    • 0034139059 scopus 로고    scopus 로고
    • Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity
    • H. SCHEEL AND S. SCHOLTES, Mathematical programs with complementarity constraints: Stationarity, optimality, and sensitivity, Math. Operat. Res., 25 (2000), pp. 1-22.
    • (2000) Math. Operat. Res. , vol.25 , pp. 1-22
    • Scheel, H.1    Scholtes, S.2
  • 21
    • 0344718017 scopus 로고    scopus 로고
    • Exact penalization of mathematical programs with equilibrium constraints
    • S. SCHOLTES AND M. STÖHR, Exact penalization of mathematical programs with equilibrium constraints, SIAM J. Control and Optim., 37 (1999), pp. 617-652.
    • (1999) SIAM J. Control and Optim. , vol.37 , pp. 617-652
    • Scholtes, S.1    Stöhr, M.2
  • 22
    • 0035603908 scopus 로고    scopus 로고
    • Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
    • S. SCHOLTES, Convergence properties of a regularization scheme for mathematical programs with complementarity constraints, SIAM J. Optim., 11 (2001), pp. 918-936.
    • (2001) SIAM J. Optim. , vol.11 , pp. 918-936
    • Scholtes, S.1
  • 23
    • 0000287204 scopus 로고    scopus 로고
    • An interior-point algorithm for nonconvex nonlinear programming
    • D. SHANNO AND R. VANDERBEI, An interior-point algorithm for nonconvex nonlinear programming, Comput. Optim. Appl., 13 (1999), pp. 231-252.
    • (1999) Comput. Optim. Appl. , vol.13 , pp. 231-252
    • Shanno, D.1    Vanderbei, R.2
  • 24
    • 0000273506 scopus 로고    scopus 로고
    • Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization
    • H. YAMASHITA AND H. YABE, Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization, Math. Program., 75 (1996), pp. 377-397.
    • (1996) Math. Program. , vol.75 , pp. 377-397
    • Yamashita, H.1    Yabe, H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.