메뉴 건너뛰기




Volumn 49, Issue , 2011, Pages 261-271

Identifying active Manifolds in regularization problems

Author keywords

Active constraint identification; Nonconvex optimization; Partly smooth; Prox regular

Indexed keywords


EID: 84976505402     PISSN: 19316828     EISSN: 19316836     Source Type: Book Series    
DOI: 10.1007/978-1-4419-9569-8_13     Document Type: Chapter
Times cited : (21)

References (7)
  • 1
    • 65949084493 scopus 로고    scopus 로고
    • A proximal method for identifying active manifolds
    • Hare, W.L.: A proximal method for identifying active manifolds. Comput. Optim. Appl. 43, 295–306 (2009)
    • (2009) Comput. Optim. Appl , vol.43 , pp. 295-306
    • Hare, W.L.1
  • 2
    • 4544378568 scopus 로고    scopus 로고
    • Identifying active constraints via partial smoothness and proxregularity
    • Hare, W.L., Lewis, A.S.: Identifying active constraints via partial smoothness and proxregularity. J. Convex Anal. 11, 251–266 (2004)
    • (2004) J. Convex Anal , vol.11 , pp. 251-266
    • Hare, W.L.1    Lewis, A.S.2
  • 3
    • 34547179792 scopus 로고    scopus 로고
    • Prox-regularity and stability of the proximal mapping
    • Hare, W.L., Poliquin, R.A.: Prox-regularity and stability of the proximal mapping. J. Convex Anal 14, 589–606 (2007)
    • (2007) J. Convex Anal , vol.14 , pp. 589-606
    • Hare, W.L.1    Poliquin, R.A.2
  • 4
    • 0042031309 scopus 로고    scopus 로고
    • Active sets, nonsmoothness, and sensitivity
    • Lewis, A.S.: Active sets, nonsmoothness, and sensitivity. SIAM J. Optim. 13, 702–725 (2003)
    • (2003) SIAM J. Optim , vol.13 , pp. 702-725
    • Lewis, A.S.1
  • 5
    • 0007633319 scopus 로고    scopus 로고
    • Prox-regular functions in variational analysis
    • Poliquin, R.A., Rockafellar, R.T.: Prox-regular functions in variational analysis. Trans. Amer. Math. Soc. 348, 1805–1838 (1996)
    • (1996) Trans. Amer. Math. Soc , vol.348 , pp. 1805-1838
    • Poliquin, R.A.1    Rockafellar, R.T.2
  • 7
    • 46749146509 scopus 로고    scopus 로고
    • A coordinate gradient descent method for nonsmooth separable minimization
    • Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Programming (Ser. B) 117, 387–423 (2009)
    • (2009) Math. Programming (Ser. B) , vol.117 , pp. 387-423
    • Tseng, P.1    Yun, S.2


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