메뉴 건너뛰기




Volumn 7, Issue 3, 1997, Pages 697-716

Analysis of a cutting plane method that uses weighted analytic center and multiple cuts

Author keywords

Analytic center; Column generation; Convex feasibility problem; Cutting planes; Potential reduction

Indexed keywords


EID: 0031285914     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S105262349427652X     Document Type: Article
Times cited : (14)

References (10)
  • 2
    • 0029340922 scopus 로고
    • A cutting plane algorithm for convex programming that uses analytic centers
    • D. S. ATKINSON AND P. M. VAIDYA, A cutting plane algorithm for convex programming that uses analytic centers, Math. Programming B, 69 (1995), pp. 1-44.
    • (1995) Math. Programming B , vol.69 , pp. 1-44
    • Atkinson, D.S.1    Vaidya, P.M.2
  • 3
    • 0010832424 scopus 로고
    • Ph.D. dissertation, Coordinated Science Laboratory, College of Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
    • D. S. ATKINSON, Scaling and Interior Point Methods in Optimization, Ph.D. dissertation, Coordinated Science Laboratory, College of Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, 1992.
    • (1992) Scaling and Interior Point Methods in Optimization
    • Atkinson, D.S.1
  • 4
    • 43949150075 scopus 로고
    • Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming
    • O. BAHN, O. DU MERLE, J.-L. GOFFIN, AND J.-P. VIAL, Experimental behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming, Discrete Appl. Math., 49 (1994), pp. 3-23.
    • (1994) Discrete Appl. Math. , vol.49 , pp. 3-23
    • Bahn, O.1    Du Merle, O.2    Goffin, J.-L.3    Vial, J.-P.4
  • 5
    • 0029336061 scopus 로고
    • A cutting plane method from analytic centers for stochastic programming
    • O. BAHN, O. DU MERLE, J.-L. GOFFIN, AND J.-P. VIAL, A cutting plane method from analytic centers for stochastic programming, Math. Programming B, 69 (1995), pp. 45-74.
    • (1995) Math. Programming B , vol.69 , pp. 45-74
    • Bahn, O.1    Du Merle, O.2    Goffin, J.-L.3    Vial, J.-P.4
  • 6
    • 0030303856 scopus 로고    scopus 로고
    • Complexity analysis of an interior cutting plane method for convex feasibility problems
    • J.-L. GOFFIN, Z.-Q. LUO, AND Y. YE, Complexity analysis of an interior cutting plane method for convex feasibility problems, SIAM J. Optim., 6 (1996), pp. 638-652.
    • (1996) Siam J. Optim. , vol.6 , pp. 638-652
    • Goffin, J.-L.1    Luo, Z.-Q.2    Ye, Y.3
  • 7
    • 0029338609 scopus 로고
    • Cutting plane algorithms from analytic centers: Efficiency estimates
    • Y. NESTEROV, Cutting plane algorithms from analytic centers: Efficiency estimates, Math. Programming B, 69 (1995), pp. 149-176.
    • (1995) Math. Programming B , vol.69 , pp. 149-176
    • Nesterov, Y.1
  • 8
    • 0001668563 scopus 로고
    • New algorithms in convex programming based on a notion of 'centre' (for systems of analytic inequalities) and on rational extrapolation
    • K. H. Hoffmann, J. B. Hiriat-Urruty, C. Lemarechal, and J. Zowe, eds., West Germany, April
    • G. SONNEVEND, New algorithms in convex programming based on a notion of 'centre' (for systems of analytic inequalities) and on rational extrapolation, in Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization in Irsee, K. H. Hoffmann, J. B. Hiriat-Urruty, C. Lemarechal, and J. Zowe, eds., West Germany, April 1986.
    • (1986) Trends in Mathematical Optimization: Proceedings of the 4th French-german Conference on Optimization in Irsee
    • Sonnevend, G.1
  • 9
    • 0003036055 scopus 로고
    • A potential reduction algorithm allowing column generation
    • Y. YE, A potential reduction algorithm allowing column generation, SIAM J. Optim., 2 (1992), pp. 7-20.
    • (1992) Siam J. Optim. , vol.2 , pp. 7-20
    • Ye, Y.1
  • 10
    • 85033075798 scopus 로고    scopus 로고
    • Complexity analysis of the analytic center cutting plane method that uses multiple cuts
    • to appear
    • Y. YE, Complexity analysis of the analytic center cutting plane method that uses multiple cuts, Math. Programming, to appear.
    • Math. Programming
    • Ye, Y.1


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