메뉴 건너뛰기




Volumn 21, Issue 3, 2002, Pages 301-310

A note on the calculation of step-lengths in interior-point methods for semidefinite programming

Author keywords

Interior point methods; Lanczos iteration; Semidefinite programming; Step length

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CALCULATIONS; EIGENVALUES AND EIGENFUNCTIONS; ERROR ANALYSIS; ITERATIVE METHODS; MATRIX ALGEBRA; VECTORS;

EID: 0036498567     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013777203597     Document Type: Article
Times cited : (19)

References (23)
  • 8
    • 0008524061 scopus 로고    scopus 로고
    • Solving semidefinite programming in mathematica
    • Department of Mathematics, University of Iowa, Reports on Computational Mathematics, No 97/1996, October
    • (1996)
    • Brixius, N.1    Potra, F.A.2    Sheng, R.3
  • 9
    • 0033294941 scopus 로고    scopus 로고
    • SDPHA: A Matlab implementation of homogeneous interior-point algorithms for semidefinite programming, optimization methods and software
    • (1999) , vol.11-12 , pp. 583-596
    • Brixius, N.1    Potra, F.A.2    Sheng, R.3
  • 10
    • 0003694452 scopus 로고    scopus 로고
    • SDPA (semidefinite programming algorithm) user's manual-version 4.10
    • Department of Mathematical and Computing Science, Tokyo Institute of Technology, Research Report, Tokyo, May; in pub/OpRes/software/SDPA
    • (1998)
    • Fujisawa, K.1    Kojima, M.2    Nakata, K.3


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