A conditional gradient method with linear rate of convergence for solving convex linear systems

Mathematical Methods of Operations Research

Volumn 59, Issue 2, 2004, Pages 235-247

  Beck, Amir ^a   Teboulle, Marc ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Conditional gradient; Conic linear systems; Efficiency and rate of convergence analysis; Slater's condition

Indexed keywords

ALGORITHMS; ITERATIVE METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

CONDITIONAL GRADIENT; CONIC LINEAR SYSTEMS; CONVEX LINEAR SYSTEMS (CLS); SLATER'S CONDITION;

LINEAR SYSTEMS;

EID: 21144445984     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860300327     Document Type: Article

References (9)

1. Ben-Tal A, Margalit T, Nemirovski, A (2001) The ordered subsets mirror descent optimization method with applications to tomography. SIAM J. Optimization 12:79-108
2. Bertsekas D (1999) Nonlinear Programming. Athena Scientific, Belmont Massachussets, second edition
3. Cannon MD, Cullum CD (1968) A tight upper bound on the rate of convergence of the Frank-Wolfe algorithm. SIAM J. Control Optimization 6:509-516
4. Dunn JC (1979) Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals. SIAM J. Control Optim 17:187-211
5. Epelman M, Freund RM (2000) Condition number complexity of an elementry algorithm for computing a reliable solution of a conic linear system. Math. Program. 88:451-485
6. Frank M, Wolfe P (1956) An algorithm for quadratic programming. Naval Research Logistics Quaterly 3:95-110
7. Levitin ES, Polyak BT (1966) Minimization methods in the presence of constraints. USSR Computational Math, and Math. Phys. 6:787-823
8. Polyak BT (1987) Introduction to Optimization. Optimization Software Inc., New York
9. Rockafellar RT (1970) Convex Analysis. Princeton University Press, Princeton, NJ