ICCOPT 2013 Cluster Sparse optimization and information processing
 Cluster Co-chairs: Michael P. Friedlander, Wotao Yin

Scientific Program
Mon.A.12 Recent advances in first and second order methods for some structured sparse optimization problems Organized Session, Room 1.2, Monday, July 29, 11:30-13:00
  Defeng Sun, An adaptive semi-nuclear norm approach for rank optimization problems with hard constraints [...]
  Xiaoming Yuan, A strictly contractive Peaceman-Rachford splitting method for convex programming [...]
  Kim-Chuan Toh, A proximal point algorithm for log-determinant optimization with group lasso regularization [...]
Mon.B.12 Algorithms for eigenvalue optimization Organized Session, Room 1.2, Monday, July 29, 14:30-16:00
  Xin Liu, Trace-penalty minimization for large-scale eigenspace computation [...]
  Chao Yang, A preconditioner for accelerating a fixed point iteration in electronic structure calculations [...]
  Zaiwen Wen, Adaptive regularized self-consistent field iteration with exact Hessian [...]
Tue.A.12 Regularization with polyhedral norms Organized Session, Room 1.2, Tuesday, July 30, 11:30-13:00
  Frank Schöpfer, Exact regularization of polyhedral norms [...]
  Michael Möller, Multiscale methods for polyhedral regularizations [...]
  Dirk Lorenz, The linearized Bregman method and its generalizations as an algorithm for split feasibility problems [...]
Wed.A.12 Recent advances in first order optimization methods Organized Session, Room 1.2, Wednesday, July 31, 11:30-13:00
  Shoham Sabach, A first order method for finding minimal norm-like solutions of convex optimization problems [...]
  Ron Shefi, Rate of convergence analysis for proximal-Lagrangian methods [...]
  Marc Teboulle, A first order algorithm for a class of nonconvex-nonsmooth minimization [...]
Wed.B.12 Exploiting structure in machine learning applications Organized Session, Room 1.2, Wednesday, July 31, 14:30-16:00
  Simon Lacoste-Julien, Block-coordinate Frank-Wolfe optimization for machine learning [...]
  Yuekai Sun, Proximal Newton-type methods for minimizing composite functions [...]
  Cristobal Guzman, Lower bounds on the oracle complexity of convex optimization using information theory [...]
Wed.D.12 Semi-continuous sparse reconstruction Organized Session, Room 1.2, Wednesday, July 31, 18:00-19:30
  Yohan de Castro, A result on the spike localization from inaccurate samplings [...]
  Carlos Fernandez-Granda, Robust super-resolution via convex programming [...]
  Konstantin Pieper, Finite element error analysis for an optimal control problem with sparse solutions [...]
Thu.A.12 Robust formulations and algorithms for large scale sparse programs Organized Session, Room 1.2, Thursday, August 1, 09:00-10:30
  Hao Wang, Matrix-free solvers for systems of inclusions [...]
  Hassan Mansour, A fast randomized Kaczmarz algorithm for sparse solutions of consistent linear systems [...]
  Aleksandr Y. Aravkin, Sparse/robust estimation with nonsmooth log-concave densities [...]

 Go to: Clusters
 Go to: unframed Scientific Program

 Go to: ICCOPT 2013 Main Webpage