메뉴 건너뛰기




Volumn 14, Issue 1, 2004, Pages 35-52

An infeasible active set method for quadratic problems with simple bounds

Author keywords

Convex programming; Primal dual active set method

Indexed keywords


EID: 1542321068     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623400376135     Document Type: Article
Times cited : (36)

References (16)
  • 1
    • 0034353740 scopus 로고    scopus 로고
    • A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems
    • M. BERGOUNIOUX, M. HADDOU, M. HINTERMÜLLER, AND K. KUNISCH, A comparison of a Moreau-Yosida-based active set strategy and interior point methods for constrained optimal control problems, SIAM J. Optim., 11 (2000), pp. 495-521.
    • (2000) SIAM J. Optim. , vol.11 , pp. 495-521
    • Bergounioux, M.1    Haddou, M.2    Hintermüller, M.3    Kunisch, K.4
  • 2
    • 0032635368 scopus 로고    scopus 로고
    • Primal-dual strategy for constrained optimal control problems
    • M. BERGOUNIOUX, K. ITO, AND K. KUNISCH, Primal-dual strategy for constrained optimal control problems, SIAM J. Control Optim., 37 (1999), pp. 1176-1194.
    • (1999) SIAM J. Control Optim. , vol.37 , pp. 1176-1194
    • Bergounioux, M.1    Ito, K.2    Kunisch, K.3
  • 4
    • 0030303844 scopus 로고    scopus 로고
    • An interior trust region approach for nonlinear minimization subject to bounds
    • T.F. COLEMAN AND Y. LIN, An interior trust region approach for nonlinear minimization subject to bounds, SIAM J. Optim., 6 (1996), pp. 418-445.
    • (1996) SIAM J. Optim. , vol.6 , pp. 418-445
    • Coleman, T.F.1    Lin, Y.2
  • 5
    • 0001173687 scopus 로고    scopus 로고
    • An interior Newton method for quadratic programming
    • T.F. COLEMAN AND J. LIU, An interior Newton method for quadratic programming, Math. Program., 85 (1999), pp. 491-523.
    • (1999) Math. Program. , vol.85 , pp. 491-523
    • Coleman, T.F.1    Liu, J.2
  • 7
    • 1542276933 scopus 로고    scopus 로고
    • A Parallel Implementation of a Potential Reduction Algorithm for Box-Constrained Quadratic Programming
    • Center for Research on Parallel Computing and Supercomputers, Napoli, Italy
    • M. D'APUZZO, M. MARINO, P.M. PARDALOS, AND G. TORALDO, A Parallel Implementation of a Potential Reduction Algorithm for Box-Constrained Quadratic Programming, Tech. report, Center for Research on Parallel Computing and Supercomputers, Napoli, Italy, 2000.
    • (2000) Tech. Report
    • D'Apuzzo, M.1    Marino, M.2    Pardalos, P.M.3    Toraldo, G.4
  • 10
    • 0000860416 scopus 로고    scopus 로고
    • Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption
    • H. HEINKENSCHLOSS, M. ULBRICH, AND S. ULBRICH, Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption, Math. Program., 86 (1999), pp. 615-635.
    • (1999) Math. Program. , vol.86 , pp. 615-635
    • Heinkenschloss, H.1    Ulbrich, M.2    Ulbrich, S.3
  • 11
    • 0023433751 scopus 로고
    • Multigrid algorithms for variational inequalities
    • R.H.W. HOPPE, Multigrid algorithms for variational inequalities, SIAM J. Numer. Anal., 24 (1987), pp. 1046-1065.
    • (1987) SIAM J. Numer. Anal. , vol.24 , pp. 1046-1065
    • Hoppe, R.H.W.1
  • 12
    • 21344491632 scopus 로고
    • An iterative two-step algorithm for linear complementarity problems
    • M. KOČVARA AND J. ZOWE, An iterative two-step algorithm for linear complementarity problems, Numer. Math., 68 (1994), pp. 95-106.
    • (1994) Numer. Math. , vol.68 , pp. 95-106
    • Kočvara, M.1    Zowe, J.2
  • 13
    • 0033436056 scopus 로고    scopus 로고
    • Newton's method for large bound-constrained optimization problems
    • C.-J. LIN AND J.J. MORÉ, Newton's method for large bound-constrained optimization problems, SIAM J. Optim., 9 (1999), pp. 1100-1127.
    • (1999) SIAM J. Optim. , vol.9 , pp. 1100-1127
    • Lin, C.-J.1    Moré, J.J.2
  • 14
    • 34249966957 scopus 로고
    • Algorithms for bound constrained quadratic problems
    • J.J. MORÉ AND G. TORALDO, Algorithms for bound constrained quadratic problems, Numer. Math., 55 (1989), pp. 377-400.
    • (1989) Numer. Math. , vol.55 , pp. 377-400
    • Moré, J.J.1    Toraldo, G.2
  • 15
    • 33845418028 scopus 로고
    • On the solution of large quadratic programming problems with bound constraints
    • J.J. MORÉ AND G. TORALDO, On the solution of large quadratic programming problems with bound constraints, SIAM J. Optim., 1 (1991), pp. 93-113.
    • (1991) SIAM J. Optim. , vol.1 , pp. 93-113
    • Moré, J.J.1    Toraldo, G.2


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