메뉴 건너뛰기




Volumn , Issue , 2010, Pages 93-102

Local convergence of sequential convex programming for nonconvex optimization

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84860700009     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-12598-0_9     Document Type: Chapter
Times cited : (172)

References (14)
  • 2
    • 14944366899 scopus 로고    scopus 로고
    • A global algorithm for nonlinear semidefinite programming
    • R. Correa and H. Ramirez C (2004). A global algorithm for nonlinear semidefinite programming. SIAM J. Optim., 15(1):303-318.
    • (2004) SIAM J. Optim. , vol.15 , Issue.1 , pp. 303-318
    • Correa, R.1    Ramirez, C.H.2
  • 3
    • 0030521635 scopus 로고    scopus 로고
    • Characterizations of strong regularity for variational inequalities over polyhedral convex sets
    • A. L. Dontchev and T. R. Rockafellar (1996). Characterizations of strong regularity for variational inequalities over polyhedral convex sets. SIAM J. Optim., 6(4):1087-1105.
    • (1996) SIAM J. Optim. , vol.6 , Issue.4 , pp. 1087-1105
    • Dontchev, A.L.1    Rockafellar, T.R.2
  • 4
    • 0036930053 scopus 로고    scopus 로고
    • Robust control via sequential semidefinite programming
    • B. Fares, D. Noll, and P. Apkarian (2002). Robust control via sequential semidefinite programming. SIAM J. Control Optim., 40:1791-1820.
    • (2002) SIAM J. Control Optim. , vol.40 , pp. 1791-1820
    • Fares, B.1    Noll, D.2    Apkarian, P.3
  • 5
    • 33846652605 scopus 로고    scopus 로고
    • Nonlinear semidefinite programming: Sensitivity, convergence, and an application in passive reduced-order modeling
    • R. W. Freund, F. Jarre, and C. H. Vogelbusch (2007). Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling. Mathemat- ical Programming, Ser. B, 109:581-611.
    • (2007) Mathematical Programming, Ser. B , vol.109 , pp. 581-611
    • Freund, R.W.1    Jarre, F.2    Vogelbusch, C.H.3
  • 6
    • 0242595924 scopus 로고    scopus 로고
    • A sequential quadratically constrained quadratic programming method for differentiable convex minimization
    • M. Fukushima, Z.-Q. Luo, and P. Tseng (2003). A sequential quadratically constrained quadratic programming method for differentiable convex minimization. SIAM J. Optimiza- tion, 13(4):1098-1119.
    • (2003) SIAM J. Optimization , vol.13 , Issue.4 , pp. 1098-1119
    • Fukushima, M.1    Luo, Z.-Q.2    Tseng, P.3
  • 7
    • 0036655867 scopus 로고    scopus 로고
    • Direct solution of nonlinear optimal control problems using quasilinearization and Chebyshev polynomials
    • H. Jaddu (2002). Direct solution of nonlinear optimal control problems using quasilinearization and Chebyshev polynomials. Journal of the Franklin Institute, 339:479-498.
    • (2002) Journal of the Franklin Institute , vol.339 , pp. 479-498
    • Jaddu, H.1
  • 8
    • 84892255687 scopus 로고    scopus 로고
    • On an approximation of the Hessian of the Lagrangian
    • F. Jarre (2003). On an approximation of the Hessian of the Lagrangian. Optimization Online (http://www.optimization-online.org/DB HTML/2003/12/800. html).
    • (2003) Optimization Online
    • Jarre, F.1
  • 13
    • 0018977011 scopus 로고
    • Strong regularity generalized equations
    • S. M. Robinson (1980). Strong regularity generalized equations, Mathematics of Operation Research, 5(1):43-62.
    • (1980) Mathematics of Operation Research , vol.5 , Issue.1 , pp. 43-62
    • Robinson, S.M.1


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