메뉴 건너뛰기




Volumn 8, Issue 1, 2001, Pages 109-126

A higher-order smoothing technique for polyhedral convex functions: geometric and probabilistic considerations

Author keywords

Linear programming; Polyhedral convex function; Smooth approximation; Subgradient

Indexed keywords


EID: 25444461966     PISSN: 09446532     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (2)

References (2)
  • 1
    • 0003135358 scopus 로고
    • Asymptotic analysis of the exponential penalty trajectory in linear programming
    • R. Cominetti, J. San Martin: Asymptotic analysis of the exponential penalty trajectory in linear programming, Math. Programming 67 (1994) 169-187.
    • (1994) Math. Programming , vol.67 , pp. 169-187
    • Cominetti, R.1    San Martin, J.2
  • 2
    • 0030648982 scopus 로고    scopus 로고
    • On the entropic regularization method for solving min-max problems with applications
    • S. C. Fang, X. S. Li: On the entropic regularization method for solving min-max problems with applications, Math. Methods of Operations Research 46 (1997) 119-130.
    • (1997) Math. Methods of Operations Research , vol.46 , pp. 119-130
    • Fang, S.C.1    Li, X.S.2


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