메뉴 건너뛰기




Volumn 36, Issue 2-3, 2007, Pages 195-219

An interior-point approach for primal block-angular problems

Author keywords

Interior point methods; Large scale optimization; Normal equations; Preconditioned conjugate gradient; Structured problems

Indexed keywords

CONSTRAINT THEORY; GRADIENT METHODS; LARGE SCALE SYSTEMS; MATLAB; OPTIMIZATION; STRUCTURED PROGRAMMING;

EID: 34248206256     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-006-9000-1     Document Type: Article
Times cited : (25)

References (27)
  • 1
    • 34248153208 scopus 로고    scopus 로고
    • Ali, A., Kennington, J.L.: Mnetgen program documentation. Technical Report 77003, Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas (1977)
    • Ali, A., Kennington, J.L.: Mnetgen program documentation. Technical Report 77003, Department of Industrial Engineering and Operations Research, Southern Methodist University, Dallas (1977)
  • 2
    • 0000728112 scopus 로고    scopus 로고
    • Implementation of interior point methods for large scale linear programming
    • Terlaky, T, ed, Kluwer, Dordrecht
    • Andersen, E.D., Gondzio, J., Mészáros, C., Xu, X.: Implementation of interior point methods for large scale linear programming. In: Terlaky, T. (ed.) Interior Point Methods in Mathematical Programming, pp. 189-252. Kluwer, Dordrecht (1996)
    • (1996) Interior Point Methods in Mathematical Programming , pp. 189-252
    • Andersen, E.D.1    Gondzio, J.2    Mészáros, C.3    Xu, X.4
  • 3
    • 3543086890 scopus 로고    scopus 로고
    • Preconditioning indefinite systems in interior point methods for optimization
    • Bergamaschi, L., Gondzio, J., Zilli, G.: Preconditioning indefinite systems in interior point methods for optimization. Comput. Optim. Appl. 28, 149-171 (2004)
    • (2004) Comput. Optim. Appl , vol.28 , pp. 149-171
    • Bergamaschi, L.1    Gondzio, J.2    Zilli, G.3
  • 5
    • 4544219528 scopus 로고    scopus 로고
    • Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
    • Bienstock, D., Raskina, O.: Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. 91, 479-492 (2002)
    • (2002) Math. Program , vol.91 , pp. 479-492
    • Bienstock, D.1    Raskina, O.2
  • 6
    • 0036239414 scopus 로고    scopus 로고
    • Solving real-world linear programs: A decade and more of progress
    • Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50, 3-15 (2002)
    • (2002) Oper. Res , vol.50 , pp. 3-15
    • Bixby, R.E.1
  • 7
    • 34248177845 scopus 로고    scopus 로고
    • Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice - Closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization. Methods, Theory and Applications, pp. 19-49. Kluwer, Boston (2000)
    • Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice - Closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modelling and Optimization. Methods, Theory and Applications, pp. 19-49. Kluwer, Boston (2000)
  • 8
    • 0025404122 scopus 로고
    • An empirical evaluation of the KORBX algorithms for military airlift applications
    • Carolan, W.J., Hill, J.E., Kennington, J.L., Niemi, S., Wichmann, S.J.: An empirical evaluation of the KORBX algorithms for military airlift applications. Oper. Res. 38, 240-248 (1990)
    • (1990) Oper. Res , vol.38 , pp. 240-248
    • Carolan, W.J.1    Hill, J.E.2    Kennington, J.L.3    Niemi, S.4    Wichmann, S.J.5
  • 9
    • 0034389613 scopus 로고    scopus 로고
    • A specialized interior-point algorithm for multicommodity network flows
    • Castro, J.: A specialized interior-point algorithm for multicommodity network flows. SIAM J. Optim. 10, 852-877 (2000)
    • (2000) SIAM J. Optim , vol.10 , pp. 852-877
    • Castro, J.1
  • 10
    • 3542996935 scopus 로고    scopus 로고
    • Solving difficult multicommodity problems through a specialized interior-point algorithm
    • Castro, J.: Solving difficult multicommodity problems through a specialized interior-point algorithm. Ann. Oper. Res. 124, 35-48 (2003)
    • (2003) Ann. Oper. Res , vol.124 , pp. 35-48
    • Castro, J.1
  • 11
    • 84904344439 scopus 로고    scopus 로고
    • Solving quadratic multicommodity problems through an interior-point algorithm
    • Sachs, E.W, Tichatschke, R, eds, Kluwer, Boston
    • Castro, J.: Solving quadratic multicommodity problems through an interior-point algorithm. In: Sachs, E.W., Tichatschke, R. (eds.) System Modelling and Optimization XX, pp. 199-212. Kluwer, Boston (2003)
    • (2003) System Modelling and Optimization XX , pp. 199-212
    • Castro, J.1
  • 12
    • 15044349954 scopus 로고    scopus 로고
    • Quadratic interior-point methods in statistical disclosure control
    • Castro, J.: Quadratic interior-point methods in statistical disclosure control. Comput. Manag. Sci. 2, 107-121 (2005)
    • (2005) Comput. Manag. Sci , vol.2 , pp. 107-121
    • Castro, J.1
  • 13
    • 28044467158 scopus 로고    scopus 로고
    • Minimum-distance controlled perturbation methods for large-scale tabular data protection
    • Castro, J.: Minimum-distance controlled perturbation methods for large-scale tabular data protection. Eur. J. Oper. Res. 171, 39-52 (2006)
    • (2006) Eur. J. Oper. Res , vol.171 , pp. 39-52
    • Castro, J.1
  • 14
    • 0036508254 scopus 로고    scopus 로고
    • Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems
    • Chardaire, P., Lisser, A.: Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems. Oper. Res. 50, 260-276 (2002)
    • (2002) Oper. Res , vol.50 , pp. 260-276
    • Chardaire, P.1    Lisser, A.2
  • 15
    • 34248193820 scopus 로고
    • Iterative algorithm for solving linear programming from engineering applications. Ph.D. thesis, University of Waterloo
    • Chin, P.: Iterative algorithm for solving linear programming from engineering applications. Ph.D. thesis, University of Waterloo (1995)
    • (1995)
    • Chin, P.1
  • 16
    • 33745802440 scopus 로고    scopus 로고
    • Exploiting structure in parallel implementation of interior point methods for optimization
    • Technical Report MS-04-004, School of Mathematics, University of Edinburgh
    • Gondzio, J., Grothey, A.: Exploiting structure in parallel implementation of interior point methods for optimization. Technical Report MS-04-004, School of Mathematics, University of Edinburgh (2005)
    • (2005)
    • Gondzio, J.1    Grothey, A.2
  • 17
    • 0029636095 scopus 로고
    • Solving a class of LP problems with a primal-dual logarithmic barrier method
    • Gondzio, J., Makowski, M.: Solving a class of LP problems with a primal-dual logarithmic barrier method. Eur. J. Oper. Res. 80, 184-192 (1995)
    • (1995) Eur. J. Oper. Res , vol.80 , pp. 184-192
    • Gondzio, J.1    Makowski, M.2
  • 18
    • 13544254921 scopus 로고    scopus 로고
    • Parallel interior point solver for structured linear programs
    • Gondzio, J., Sarkissian, R.: Parallel interior point solver for structured linear programs. Math. Program. 96, 561-584 (2003)
    • (2003) Math. Program , vol.96 , pp. 561-584
    • Gondzio, J.1    Sarkissian, R.2
  • 19
    • 0033723062 scopus 로고    scopus 로고
    • A decomposition bases pricing procedure for large scale linear programs: An application to the linear multicommodity flow problem
    • Mamer, J., McBride, R.: A decomposition bases pricing procedure for large scale linear programs: an application to the linear multicommodity flow problem. Manag. Sci. 46, 693-709 (2000)
    • (2000) Manag. Sci , vol.46 , pp. 693-709
    • Mamer, J.1    McBride, R.2
  • 20
    • 0000018801 scopus 로고
    • Block sparse Cholesky algorithms on advanced uniprocessor computers
    • Ng, E., Peyton, B.W.: Block sparse Cholesky algorithms on advanced uniprocessor computers. SIAM J. Sci. Comput. 14, 1034-1056 (1993)
    • (1993) SIAM J. Sci. Comput , vol.14 , pp. 1034-1056
    • Ng, E.1    Peyton, B.W.2
  • 21
    • 7544246763 scopus 로고    scopus 로고
    • A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
    • Oliveira, A.R.L., Sorensen, D.C.: A new class of preconditioners for large-scale linear systems from interior point methods for linear programming. Linear Algebra Appl. 394, 1-24 (2005)
    • (2005) Linear Algebra Appl , vol.394 , pp. 1-24
    • Oliveira, A.R.L.1    Sorensen, D.C.2
  • 22
    • 0001157796 scopus 로고
    • An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapacitated networks
    • Resende, M.G.C., Veiga, G.: An implementation of the dual affine scaling algorithm for minimum-cost flow on bipartite uncapacitated networks. SIAM J. Optim. 3, 516-537 (1993)
    • (1993) SIAM J. Optim , vol.3 , pp. 516-537
    • Resende, M.G.C.1    Veiga, G.2
  • 23
    • 0025415365 scopus 로고
    • The maximum concurrent flow problem
    • Shahrokhi, F., Matula, D.W.: The maximum concurrent flow problem. J. ACM 37, 318-334 (1990)
    • (1990) J. ACM , vol.37 , pp. 318-334
    • Shahrokhi, F.1    Matula, D.W.2
  • 25
    • 0034560396 scopus 로고    scopus 로고
    • Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
    • Wang, W., O'Leary, D.P.: Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming. Numer. Algorithms 25, 387-406 (2000)
    • (2000) Numer. Algorithms , vol.25 , pp. 387-406
    • Wang, W.1    O'Leary, D.P.2
  • 27
    • 0032303559 scopus 로고    scopus 로고
    • Solving large-scale linear programs by interior-point methods under the MATLAB environment
    • Zhang, Y.: Solving large-scale linear programs by interior-point methods under the MATLAB environment. Optim. Methods Software 10, 1-31 (1998)
    • (1998) Optim. Methods Software , vol.10 , pp. 1-31
    • Zhang, Y.1


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