A Subspace Decomposition Framework for Nonlinear Optimization

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:liyn000
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  We present a parallel subspace decomposition framework for nonlinear optimization,which can be regarded as an extension of the domain decomposition method for PDEs.
其他文献
  This talk will discuss general algebraic connectivity representing consensus convergence rate in multi-agent systems with directed topologies.
会议
  This study mainly focuses on the convergence rate of the consensus of linear multi-agent systems.It is assumed that each agent is described by the generic l
会议
  This paper investigates the distributed finite-time tracking problem of networked agents with Euler-Lagrange dynamics.To achieve finite-time tracking,with t
会议
  Many real large-scale systems can be modeled as networked agent systems,where typical examples include Internet,WWW,smart grids,etc.
会议
  Consensus of multi-agent system has recently received considerable attention from various scientific communities due to its potential applications in engine
会议
  We consider a probabilistic construction of sparse matrices with provable restricted isometry constants(RICS)using l1 norms.
会议
  We will discuss a very simple deep network for image classification which comprises only the very basic data processing components: cascaded principal compo
会议
  We introduce algorithms for tensor completion which are based on rank-one tensor updating.At each iteration,a rank-one tensor is selected by computing the t
会议
  Conic integral geometry provides deep insights as well as-exactformulas for the probabilities of important events such as-success of the compressed sensing
会议
  This min-symposium considers a variety of ill-posed inverse problems associated with information theory,signal processing,and image processing.
会议