A random coordinate descent algorithm for large-scale sparse nonconvex optimization

2013 European Control Conference, ECC 2013

Volumn , Issue , 2013, Pages 2789-2794

  Patrascu, Andrei ^a   Necoara, Ion ^a  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED PARAMETER CONTROL SYSTEMS; DYNAMICAL SYSTEMS; EIGENVALUES AND EIGENFUNCTIONS;

COMPLEMENTARITY PROBLEMS; COMPOSITE OBJECTIVE FUNCTION; COORDINATE DESCENT METHODS; MECHANICAL STRUCTURES; NONCONVEX OPTIMIZATION; NONCONVEX OPTIMIZATION PROBLEM; RESONANCE FREQUENCIES; STABILITY OF DYNAMICAL SYSTEMS;

ITERATIVE METHODS;

EID: 84893240973     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.23919/ecc.2013.6669531     Document Type: Conference Paper

References (19)

1. D. Bertsekas, Nonlinear Programming, Athena Scientific, 1999.
2. P. Dorato, Quantified Multivariate Polynomial Inequalities: The Mathematics of Practical Control Design Problems, IEEE Control Systems Magazine, 20(5), 48-58, 2000.
3. J. Judice, M. Raydan, S.S. Rosa and S. A. Santos, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, Computational Optimization and Applications, 47, 391-407, 2008.
4. J. Kurose and R. Simha, Microeconomic approach to optimal resource allocation in distributed computer systems, IEEE Transactions on Computers, 38, 705-717, 1989.
5. M. Mongeau and M. Torki, Computing eigenelements of real symmetric matrices via optimization, Computational Optimization and Applications, 29, 263-287, 2004.
6. I. Necoara and A. Patrascu, A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints, submitted to Computational Optimization and Applications, 2012.
7. I. Necoara, Y. Nesterov and F. Glineur, A random coordinate descent method on large optimization problems with linear constraints, Technical Report, University Politehnica Bucharest, 2011, http://acse.pub.ro/person/ion-necoara/.
8. Y. Nesterov, Efficiency of coordinate descent methods on huge-scale optimization problems, Core Discussion Paper 2/2010, 2010.
9. Y. Nesterov, Gradient methods for minimizing composite objective function, CORE Discussion Papers 76/2007, 2007.
10. M. Queiroz, J. Judice and C. Humes, The symmetric eigenvalue complementarity problem, Mathematics of Computation, 73(248), 1849- 1863, 2004.
11. B.N. Parlett, The Symmetric Eigenvalue Problem. Classics in Applied Mathematics, SIAM, Philadelphia, 1997.
12. A. Patrascu and I. Necoara, Random coordinate descent methods for structured nonconvex optimization problems, Technical Report, University Politehnica Bucharest, http://acse.pub.ro/person/ion-necoara/.
13. P. Richtarik and M. Takac, Iteration complexity of randomized blockcoordinate descent methods for minimizing a composite function, submitted to Mathematical Programming, 2012.
14. R. T. Rockafeller, The elementary vectors of a subspace in RN, Combinatorial Mathematics and its Applications, Proceedings of Chapel Hill Conference, 104-127, 1969.
15. R.T. Rockafeller, Network flows and Monotropic Optimization, Athena Scientific, 1998.
16. A. Seeger, Eigenvalue analysis of equilibrium processes defined by linear complementarity conditions, Linear Algebra and Its Applications, 292, 1-14, 1999.
17. H. A. L. Thi, M. Moeini, T.P. Dihn and J. Judice, A DC programming approach for solving the symmetric Eigenvalue Complementarity Problem, Computational Optimization and Applications, 51, 1097- 1117, 2012.
18. P. Tseng and S. Yun, A coordinate gradient descent for nonsmooth separable minimization, Technical Report, Department of Mathematics, University of Washington, to appear in Mathematical Programming Series B, 2007.
19. P. Tseng and S. Yun, A block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, Journal of Optimization Theory and Applications, 140, 513-535, 2009.