메뉴 건너뛰기




Volumn 99, Issue 1, 2004, Pages 149-174

Augmented self-concordant barriers and nonlinear optimization problems with finite complexity

Author keywords

Augmented barrier; Finite methods; Nonlinear optimization; Self concordant functions

Indexed keywords

COMPUTATION THEORY; MATRIX ALGEBRA; OPTIMIZATION; POLYNOMIALS; TRAJECTORIES;

EID: 21044446526     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0392-8     Document Type: Article
Times cited : (4)

References (5)
  • 1
    • 0034551041 scopus 로고    scopus 로고
    • Multiple cuts in the analytic center cutting plane method
    • Goffin, J.-L., Vial, J.-Ph.: Multiple cuts in the analytic center cutting plane method. SIAM Journal on Optimization 11, 266-288 (2000)
    • (2000) SIAM Journal on Optimization , vol.11 , pp. 266-288
    • Goffin, J.-L.1    Vial, J.-Ph.2
  • 3
    • 0003254250 scopus 로고
    • Interior point polynomial algorithms in convex programming
    • Philadelphia
    • Nesterov, Yu., Nemirovsky, A.: Interior Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia, 1994
    • (1994) SIAM
    • Nesterov, Yu.1    Nemirovsky, A.2
  • 4
    • 0033469369 scopus 로고    scopus 로고
    • Homogeneous analytic center cutting plane methods for convex problems and variational inequalities
    • Nesterov, Yu., Vial, J.-Ph.: Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities. SIAM Journal on Optimization 9, 707-728 (1999)
    • (1999) SIAM Journal on Optimization , vol.9 , pp. 707-728
    • Nesterov, Yu.1    Vial, J.-Ph.2
  • 5
    • 21044458678 scopus 로고    scopus 로고
    • A mathematical view of interior-point methods in convex optimization
    • Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. CORE Lecture Series, 1999
    • (1999) CORE Lecture Series
    • Renegar, J.1


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