메뉴 건너뛰기




Volumn 109, Issue 2-3, 2007, Pages 445-475

Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems

Author keywords

Behavioral measure; Complementarity; Condition number; Degeneracy; Interior point method; Semi definite programming

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; CORRELATION METHODS; ITERATIVE METHODS; MEASUREMENT THEORY; PROBLEM SOLVING;

EID: 33846673704     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-006-0035-y     Document Type: Conference Paper
Times cited : (14)

References (23)
  • 1
    • 0031141136 scopus 로고    scopus 로고
    • Complementarity and nondegeneracy in semidefinite programming
    • Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77, 111-128 (1997)
    • (1997) Math. Program , vol.77 , pp. 111-128
    • Alizadeh, F.1    Haeberly, J.P.A.2    Overton, M.L.3
  • 2
    • 0032327612 scopus 로고    scopus 로고
    • Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results
    • Alizadeh, F., Haeberly, J.P.A., Overton, M.L.: Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8(3), 746-768 (1998)
    • (1998) SIAM J. Optim , vol.8 , Issue.3 , pp. 746-768
    • Alizadeh, F.1    Haeberly, J.P.A.2    Overton, M.L.3
  • 3
    • 0004151496 scopus 로고    scopus 로고
    • Springer, Berlin Heidelberg New York
    • Bhatia, R.: Matrix Analysis. Springer, Berlin Heidelberg New York (1997)
    • (1997) Matrix Analysis
    • Bhatia, R.1
  • 4
    • 33846694720 scopus 로고    scopus 로고
    • On two measures of problem complexity and their explanatory value for the performance of SeDuMi on second-order cone problems
    • in press
    • Cai, Z., Freund, R.M.: On two measures of problem complexity and their explanatory value for the performance of SeDuMi on second-order cone problems. Comput Optim Appl (in press)
    • Comput Optim Appl
    • Cai, Z.1    Freund, R.M.2
  • 5
    • 30944452830 scopus 로고    scopus 로고
    • Computation of condition numbers for linear programming problems using Peña's method
    • Chai, J., Toh, K.: Computation of condition numbers for linear programming problems using Peña's method. Optim. Methods Softw. 21, 419-443 (2006)
    • (2006) Optim. Methods Softw , vol.21 , pp. 419-443
    • Chai, J.1    Toh, K.2
  • 6
    • 0242679721 scopus 로고    scopus 로고
    • On the primal-dual geometry of level sets in linear and conic optimization
    • Freund, R.M.: On the primal-dual geometry of level sets in linear and conic optimization. SIAM J. Optim. 13(4) (2003)
    • (2003) SIAM J. Optim , vol.13 , Issue.4
    • Freund, R.M.1
  • 7
    • 21044445470 scopus 로고    scopus 로고
    • Complexity of convex optimization using geometry-based measures and a reference point
    • Freund, R.M.: Complexity of convex optimization using geometry-based measures and a reference point. Math. Program. 99, 197-221 (2004)
    • (2004) Math. Program , vol.99 , pp. 197-221
    • Freund, R.M.1
  • 8
    • 0000553640 scopus 로고    scopus 로고
    • Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system
    • Freund, R.M., Vera, J.R.: Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. Math. Program. 86(2), 225-260 (1999)
    • (1999) Math. Program , vol.86 , Issue.2 , pp. 225-260
    • Freund, R.M.1    Vera, J.R.2
  • 9
    • 3142694756 scopus 로고    scopus 로고
    • On the complexity of computing estimates of condition measures of a conic linear system
    • Freund, R.M., Vera, J.R.: On the complexity of computing estimates of condition measures of a conic linear system. Math. Oper. Rese. 28(4), 625-648 (2003)
    • (2003) Math. Oper. Rese , vol.28 , Issue.4 , pp. 625-648
    • Freund, R.M.1    Vera, J.R.2
  • 10
    • 0033265683 scopus 로고    scopus 로고
    • On the local convergence of a predictor-corrector method for semidefinite programming
    • Ji, J., Potra, F., Sheng, R.: On the local convergence of a predictor-corrector method for semidefinite programming. SIAM J. Optim 10(1), 195-210 (1999)
    • (1999) SIAM J. Optim , vol.10 , Issue.1 , pp. 195-210
    • Ji, J.1    Potra, F.2    Sheng, R.3
  • 11
    • 0000376618 scopus 로고    scopus 로고
    • Local convergence of predictor-corrector infeasible-interior-point algorithms for sdps and sdlcps
    • Kojima, M., Shida, M., Shindoh, S.: Local convergence of predictor-corrector infeasible-interior-point algorithms for sdps and sdlcps. Math. Program. 80(2), 129-160 (1998)
    • (1998) Math. Program , vol.80 , Issue.2 , pp. 129-160
    • Kojima, M.1    Shida, M.2    Shindoh, S.3
  • 13
    • 0032345991 scopus 로고    scopus 로고
    • Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming
    • Luo, Z.Q., Sturm, J., Zhang, S.: Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM J. Optim. 8(1), 59-81 (1998)
    • (1998) SIAM J. Optim , vol.8 , Issue.1 , pp. 59-81
    • Luo, Z.Q.1    Sturm, J.2    Zhang, S.3
  • 14
    • 2442587863 scopus 로고    scopus 로고
    • Computational experience and the explanatory value of condition measures for linear optimization
    • Ordóñez, F., Freund, R.M.: Computational experience and the explanatory value of condition measures for linear optimization. SIAM J. Optim. 14(2), 307-333 (2003)
    • (2003) SIAM J. Optim , vol.14 , Issue.2 , pp. 307-333
    • Ordóñez, F.1    Freund, R.M.2
  • 15
    • 30944470060 scopus 로고    scopus 로고
    • Two properties of condition numbers for convex programs via implicitly defined barrier functions
    • Peña, J.: Two properties of condition numbers for convex programs via implicitly defined barrier functions. Math. Program. 93(1), 55-57 (2002)
    • (2002) Math. Program , vol.93 , Issue.1 , pp. 55-57
    • Peña, J.1
  • 16
    • 0039990267 scopus 로고    scopus 로고
    • Superlinear convergence of interior-point algorithms for semidefinite programming
    • Potra, F., Sheng, R.: Superlinear convergence of interior-point algorithms for semidefinite programming. J. Optim. Theory Appl. 99(1), 103-119 (1998)
    • (1998) J. Optim. Theory Appl , vol.99 , Issue.1 , pp. 103-119
    • Potra, F.1    Sheng, R.2
  • 18
    • 0028426653 scopus 로고
    • Some perturbation theory for linear programming
    • Renegar, J.: Some perturbation theory for linear programming. Math. Program. 65(1), 73-91 (1994)
    • (1994) Math. Program , vol.65 , Issue.1 , pp. 73-91
    • Renegar, J.1
  • 19
    • 0029195774 scopus 로고
    • Linear programming, complexity theory, and elementary functional analysis
    • Renegar, J.: Linear programming, complexity theory, and elementary functional analysis. Math. Program. 70(3), 279-351 (1995)
    • (1995) Math. Program , vol.70 , Issue.3 , pp. 279-351
    • Renegar, J.1
  • 20
    • 0017491126 scopus 로고
    • A characterization of stability in linear programming
    • Robinson, S.M.: A characterization of stability in linear programming. Oper. Res. 25(3), 435-447 (1977)
    • (1977) Oper. Res , vol.25 , Issue.3 , pp. 435-447
    • Robinson, S.M.1
  • 21
    • 4043058006 scopus 로고    scopus 로고
    • Solving large scale semidefinite programs via an iterative solver on the augmented systems
    • Toh, K.C.: Solving large scale semidefinite programs via an iterative solver on the augmented systems. SIAM J. Optim. 14, 670-698 (2004)
    • (2004) SIAM J. Optim , vol.14 , pp. 670-698
    • Toh, K.C.1
  • 22
    • 3142743708 scopus 로고    scopus 로고
    • Solving semidefinite-quadratic-linear programs using sdpt3
    • Tütüncü, R.H., Toh, K.C., Todd, M.J.: Solving semidefinite-quadratic-linear programs using sdpt3. Math. Program. 95(2), 189-217 (2003)
    • (2003) Math. Program , vol.95 , Issue.2 , pp. 189-217
    • Tütüncü, R.H.1    Toh, K.C.2    Todd, M.J.3


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