咨询与建议

限定检索结果

文献类型

  • 335 篇 期刊文献
  • 5 篇 会议

馆藏范围

  • 340 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 325 篇 理学
    • 324 篇 数学
    • 5 篇 物理学
    • 4 篇 统计学(可授理学、...
    • 1 篇 系统科学
  • 135 篇 管理学
    • 135 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 69 篇 工学
    • 23 篇 软件工程
    • 22 篇 计算机科学与技术...
    • 17 篇 控制科学与工程
    • 10 篇 信息与通信工程
    • 7 篇 石油与天然气工程
    • 6 篇 电气工程
    • 2 篇 光学工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 交通运输工程
    • 1 篇 生物医学工程(可授...
  • 7 篇 经济学
    • 5 篇 应用经济学
    • 2 篇 理论经济学
  • 3 篇 医学
    • 2 篇 临床医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 特种医学

主题

  • 340 篇 proximal point a...
  • 42 篇 maximal monotone...
  • 27 篇 strong convergen...
  • 22 篇 convex optimizat...
  • 21 篇 resolvent
  • 19 篇 monotone operato...
  • 17 篇 fixed point
  • 16 篇 nonexpansive map...
  • 16 篇 hadamard space
  • 15 篇 variational ineq...
  • 14 篇 variational ineq...
  • 13 篇 convex minimizat...
  • 13 篇 banach space
  • 12 篇 weak convergence
  • 12 篇 augmented lagran...
  • 11 篇 convex minimizat...
  • 11 篇 convex programmi...
  • 11 篇 alternating dire...
  • 10 篇 convergence rate
  • 9 篇 hilbert space

机构

  • 19 篇 nanjing univ dep...
  • 9 篇 tokyo inst techn...
  • 8 篇 natl univ singap...
  • 7 篇 technion israel ...
  • 7 篇 hong kong baptis...
  • 6 篇 univ zanjan dept...
  • 6 篇 luoyang normal u...
  • 6 篇 china med univ c...
  • 6 篇 tech univ darmst...
  • 5 篇 hangzhou dianzi ...
  • 5 篇 univ zanjan dept...
  • 5 篇 natl univ singap...
  • 5 篇 china med univ c...
  • 5 篇 cent european un...
  • 5 篇 univ washington ...
  • 5 篇 gyeongsang natl ...
  • 4 篇 hangzhou normal ...
  • 4 篇 yunnan univ fina...
  • 4 篇 nanjing univ fin...
  • 4 篇 romanian acad si...

作者

  • 11 篇 khatibzadeh hadi
  • 9 篇 yuan xiaoming
  • 8 篇 toh kim-chuan
  • 8 篇 kumam poom
  • 8 篇 cho yeol je
  • 8 篇 yao jen-chih
  • 7 篇 he bingsheng
  • 7 篇 matsushita shin-...
  • 6 篇 chang shih-sen
  • 6 篇 wang fenghui
  • 6 篇 reich simeon
  • 6 篇 takahashi wataru
  • 5 篇 xu hong-kun
  • 5 篇 morosanu gheorgh...
  • 5 篇 he hongjin
  • 5 篇 li min
  • 5 篇 mohebbi vahid
  • 5 篇 leustean laurent...
  • 5 篇 ranjbar sajad
  • 5 篇 rockafellar r. t...

语言

  • 307 篇 英文
  • 31 篇 其他
  • 2 篇 中文
检索条件"主题词=proximal point algorithm"
340 条 记 录,以下是301-310 订阅
排序:
Interior proximal extragradient method for equilibrium problems
收藏 引用
OPTIMIZATION 2015年 第10期64卷 2145-2161页
作者: Langenberg, Nils Univ Trier Fachbereich 4 Abt Math Trier Germany
The Bregman function-based proximal point algorithm (BPPA) is an efficient tool for solving equilibrium problems and fixed-point problems. Extending rather classical proximal regularization methods, the main additiona... 详细信息
来源: 评论
PPA-Like Contraction Methods for Convex Optimization:A Framework Using Variational Inequality Approach
收藏 引用
Journal of the Operations Research Society of China 2015年 第4期3卷 391-420页
作者: Bing-Sheng He Department of Mathematics Nanjing UniversityNanjing 210093China
Linearly constrained convex optimization has many *** first-order optimal condition of the linearly constrained convex optimization is a monotone variational inequality(VI).For solving VI,the proximal point algorithm(... 详细信息
来源: 评论
Composite iterative schemes for maximal monotone operators in reflexive Banach spaces
收藏 引用
FIXED point THEORY AND APPLICATIONS 2011年 第1期2011卷 1-10页
作者: Cholamjiak, Prasit Cho, Yeol Je Suantai, Suthep Gyeongsang Natl Univ Dept Math Educ Chinju 660701 South Korea Gyeongsang Natl Univ RINS Chinju 660701 South Korea Univ Phayao Sch Sci Phayao 56000 Thailand Chiang Mai Univ Fac Sci Dept Math Chiang Mai 50200 Thailand
In this article, we introduce composite iterative schemes for finding a zero point of a finite family of maximal monotone operators in a reflexive Banach space. Then, we prove strong convergence theorems by using a sh... 详细信息
来源: 评论
A component-wise EM algorithm for mixtures
收藏 引用
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS 2001年 第4期10卷 697-712页
作者: Celeux, G Chrétien, S Forbes, F Mkhadri, A INRIA Rhone Alpes ZIRST F-38334 Saint Ismier France Univ Franche Comte Dept Math F-25030 Besancon France Univ Cadi Ayyad Marrahesh Fac Sci Semlalie Dept Math Marrakech Morocco
Maximum likelihood estimation in finite mixture distributions is typically approached as an incomplete data problem to allow application of the expectation-maximization (EM) algorithm. In its general formulation, the ... 详细信息
来源: 评论
proximal interior point approach in convex programming (ILL-posed problems)
收藏 引用
Optimization 1999年 第1-4期45卷 117-147页
作者: Kaplan, A. Tichatschke, R. Department of Mathematics University Trier D-54290 Trier Universitätsring 15 Germany
The paper deals with the theoretical analysis of a regularized logarithmic barrier method for solving ill-posed convex programming problems. In this method a multi-step proximal regularization of the auxiliary problem... 详细信息
来源: 评论
A DECOMPOSITION METHOD FOR CONVEX MINIMIZATION PROBLEMS AND ITS APPLICATION
收藏 引用
Acta Mathematicae Applicatae Sinica 2001年 第1期17卷 20-28页
作者: 徐以汎 吴方 School of Management Fudan University Shanghai China he Academy of Mathematics and Systems Sciences Institute of Applied Mathematics Beijing China Institute of Applied Mathematics the Chinese Academy of Sciences Beijing China
In this paper, we present a modified decomposition algorithm and its bundle style variant for convex programming problems with separable structure. We prove that these methods are globally and linearly convergent and ... 详细信息
来源: 评论
proximal DECOMPOSITION ON THE GRAPH OF A MAXIMAL MONOTONE OPERATOR
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1995年 第2期5卷 454-466页
作者: MAHEY, P OUALIBOUCH, S TAO, PD INST INFORMAT & INTELLIGENCE ARTIFICIELLE CH-2000 NEUCHATELSWITZERLAND INSA LMAIF-76131 MONT ST AIGNANFRANCE
We present an algorithm to solve: Find (x, y) epsilon A x A perpendicular to such that y epsilon Tx, where A is a subspace and T is a maximal monotone operator. The algorithm is based on the proximal decomposition on ... 详细信息
来源: 评论
An implementation of Halpern-type proximal algorithms for nonsmooth problems
An implementation of Halpern-type proximal algorithms for no...
收藏 引用
2016 IEEE Advanced Information Management,Communicates,Electronic and Automation Control Conference(IMCEC 2016)
作者: Lei Sun Heng Chen Xiaodong Fan College of Information Science and Technology Bohai University 78046 Uint Chinese People's Liberation Army Department of Mathematics Bohai University
This paper develops two implementations of Halpern-type proximal algorithms(HPA1 and HPA2) solving nonsmooth *** prove their convergence to the solutions of the problems under the new *** this idea to the Basis Pursui... 详细信息
来源: 评论
ACCELERATED proximal algorithmS FOR L1-MINIMIZATION PROBLEM  11
ACCELERATED PROXIMAL ALGORITHMS FOR L1-MINIMIZATION PROBLEM
收藏 引用
11th International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)
作者: Zhang, Xiao-Ya Wang, Hong-Xia Zhang, Hui Natl Univ Def Technol Coll Sci Changsha 410073 Hunan Peoples R China
Linearized Bregman algorithm is effective on solving l1-minimization problem, but its parameter's selection must rely on prior information. In order to ameliorate this weakness, we proposed a new algorithm in this... 详细信息
来源: 评论
Variational Convexity and the Local Monotonicity of Subgradient Mappings
收藏 引用
VIETNAM JOURNAL OF MATHEMATICS 2019年 第3期47卷 547-561页
作者: Rockafellar, R. Tyrrell Univ Washington Dept Math Box 354350 Seattle WA 98195 USA
It is well known that the subgradient mapping associated with a lower semicontinuous function is maximal monotone if and only if the function is convex, but what characterization can be given for the case in which a s... 详细信息
来源: 评论