Improving complexity of structured convex optimization problems using self-concordant barriers

European Journal of Operational Research

Volumn 143, Issue 2, 2002, Pages 291-310

  Glineur, François ^a  

^a FACULTÉ POLYTECHNIQUE DE MONS   (Belgium)

Author keywords

Convex optimization; Entropy optimization; Geometric optimization; Interior point methods; lp norm optimization; Self concordant barriers

Indexed keywords

COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; SET THEORY;

CONVEX OPTIMIZATION;

OPERATIONS RESEARCH;

EID: 0036883814     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00297-7     Document Type: Conference Paper

References (19)

1. Implementation of interior-point methods for large scale linear programs
2. A sufficient condition for self-concordance with application to some classes of structured convex programming problems
3. On the classical logarithmic barrier method for a class of smooth convex programming problems
4. Implementation of interior-point algorithms for some entropy optimization problems
5. Interior-point methods for classes of convex programs
6. Interior-point polynomial methods in convex programming
7. Self-regular proximities and new search directions for linear and semidefinite optimization
8. A quadratically convergent polynomial interior-point algorithm for solving entropy optimization problems
9. A mathematical view of interior-point methods in convex optimization
10. Theory and algorithms for linear optimization. An interior point approach
11. p programming