咨询与建议

限定检索结果

文献类型

  • 54 篇 期刊文献
  • 4 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 44 篇 理学
    • 42 篇 数学
    • 1 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 27 篇 工学
    • 11 篇 计算机科学与技术...
    • 9 篇 电气工程
    • 6 篇 软件工程
    • 5 篇 控制科学与工程
    • 2 篇 信息与通信工程
    • 1 篇 仪器科学与技术
    • 1 篇 动力工程及工程热...
    • 1 篇 电子科学与技术(可...
    • 1 篇 石油与天然气工程
  • 27 篇 管理学
    • 27 篇 管理科学与工程(可...
  • 3 篇 经济学
    • 2 篇 理论经济学
    • 1 篇 应用经济学

主题

  • 59 篇 convex program
  • 6 篇 pointwise iterat...
  • 5 篇 ergodic iteratio...
  • 4 篇 duality
  • 4 篇 basis pursuit
  • 4 篇 relative error c...
  • 4 篇 alternating dire...
  • 3 篇 sparse solutions
  • 3 篇 algorithms
  • 3 篇 linear program
  • 3 篇 hybrid extragrad...
  • 2 篇 strict convexity
  • 2 篇 90c25
  • 2 篇 compressed sensi...
  • 2 篇 combinatorial al...
  • 2 篇 second-order sol...
  • 2 篇 convex programmi...
  • 2 篇 root-finding
  • 2 篇 global optimalit...
  • 2 篇 convergence

机构

  • 3 篇 univ british col...
  • 3 篇 georgia inst tec...
  • 2 篇 hong kong polyte...
  • 2 篇 univ washington ...
  • 2 篇 georgia inst tec...
  • 2 篇 univ fed goias i...
  • 2 篇 univ fed goias i...
  • 1 篇 north china univ...
  • 1 篇 samsung res amer...
  • 1 篇 henan univ sch m...
  • 1 篇 univ paris 05 la...
  • 1 篇 department of ma...
  • 1 篇 res off res lab ...
  • 1 篇 univ new brunswi...
  • 1 篇 google res ny 10...
  • 1 篇 beihang univ sch...
  • 1 篇 natl univ irelan...
  • 1 篇 laboratory for i...
  • 1 篇 univ washington ...
  • 1 篇 baikal state uni...

作者

  • 4 篇 goncalves max l....
  • 3 篇 melo jefferson g...
  • 3 篇 tseng p
  • 3 篇 friedlander mich...
  • 2 篇 goncalves m. l. ...
  • 2 篇 monteiro rdc
  • 2 篇 bertsekas dp
  • 2 篇 yang xq
  • 2 篇 zlobec s
  • 2 篇 melo j. g.
  • 2 篇 zhou fj
  • 2 篇 van den berg ewo...
  • 2 篇 jarre f
  • 2 篇 vazirani vijay v...
  • 2 篇 adona vando a.
  • 2 篇 adona v. a.
  • 1 篇 elbassioni khale...
  • 1 篇 liang sc
  • 1 篇 lou g
  • 1 篇 de la fortelle a

语言

  • 57 篇 英文
  • 2 篇 其他
检索条件"主题词=Convex Program"
59 条 记 录,以下是11-20 订阅
排序:
A convex programMING APPROACH FOR DISCRETE-TIME MARKOV DECISION PROCESSES UNDER THE EXPECTED TOTAL REWARD CRITERION
收藏 引用
SIAM JOURNAL ON CONTROL AND OPTIMIZATION 2020年 第4期58卷 2535-2566页
作者: Dufour, Francois Genadot, Alexandre Univ Bordeaux Inst Math Bordeaux Inst Polytech Bordeaux INRIA Bordeaux Sud OuestTeam CQFD Bordeaux France
In this work, we study discrete-time Markov decision processes (MDPs) under constraints with Borel state and action spaces and where all the performance functions have the same form of the expected total reward (ETR) ... 详细信息
来源: 评论
SOLVING CONE-CONSTRAINED convex-programS BY DIFFERENTIAL-INCLUSIONS
收藏 引用
MATHEMATICAL programMING 1994年 第1期65卷 107-121页
作者: FLAM, SD SEEGER, A UNIV AVIGNON DEPT MATH F-84000 AVIGNON FRANCE
A differential inclusion is designed for solving cone-constrained convex programs. The method is of subgradient-projection type. It involves projection, penalties and Lagrangian relaxation. Non-smooth data can be acco... 详细信息
来源: 评论
A continuous dynamical splitting method for solving 'strongly plus weakly' convex programming problems
收藏 引用
OPTIMIZATION 2020年 第6期69卷 1335-1359页
作者: Zhu, Ming Hu, Rong Fang, Ya-Ping Sichuan Univ Dept Math Chengdu Sichuan Peoples R China Chengdu Univ Informat Technol Dept Appl Math Chengdu Sichuan Peoples R China
The Douglas-Rachford splitting method is a classical and powerful method for minimizing the sum of two convex functions. In this paper, we introduce two dynamical systems based on this method for solving the minimum v... 详细信息
来源: 评论
ON THE CONVERGENCE OF A CLASS OF OUTER APPROXIMATION ALGORITHMS FOR convex-programS
收藏 引用
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 1984年 第2期10卷 147-156页
作者: FUKUSHIMA, M UNIV WATERLOO WATERLOO N2L 3G1ONTARIOCANADA KYOTO UNIV FAC ENGNDEPT APPL MATH & PHYSKYOTO 606JAPAN
This paper presents a new class of outer approximation methods for solving general convex programs. The methods solve at each iteration a subproblem whose constraints contain the feasible set of the original problem. ... 详细信息
来源: 评论
PIECEWISE convex programS
收藏 引用
MATHEMATICAL programMING 1978年 第1期15卷 53-62页
作者: LOUVEAUX, FV CORE Université Catholique de Louvain Belgium
A piecewise convex program is a convex program such that the constraint set can be decomposed in a finite number of closed convex sets, called the cells of the decomposition, and such that on each of these cells the o... 详细信息
来源: 评论
A SIMPLE CONSTRAINT QUALIFICATION IN convex-programMING
收藏 引用
MATHEMATICAL programMING 1993年 第3期61卷 385-397页
作者: ZHOU, X MOKHTARIAN, FS ZLOBEC, S MCGILL UNIV DEPT MATH & STAT BURNSIDE HALL 805 SHERBROOKE ST W MONTREAL H3A 2K6 QUEBEC CANADA
We introduce and characterize a class of differentiable convex functions for which the Karush-Kuhn-Tucker condition is necessary for optimality. If some constraints do not belong to this class, then the characterizati... 详细信息
来源: 评论
Methods of Support Cones and Simplices in convex programming and Their Applications to Physicochemical Systems
收藏 引用
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS 2008年 第11期48卷 1955-1970页
作者: Belykh, T. I. Bulatov, V. P. Baikal State Univ Econ & Law Irkutsk 664033 Russia Russian Acad Sci Melentiev Energy Syst Inst Siberian Branch Irkutsk 664033 Russia
A variant of the embedding technique proposed earlier by the second author is suggested in which the sets to be embedded are support cones. Replacing the cones by simplices gives a modification with a polynomial conve... 详细信息
来源: 评论
A PRACTICAL INTERIOR-POINT METHOD FOR convex-programMING
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1995年 第1期5卷 149-171页
作者: JARRE, F SAUNDERS, MA STANFORD UNIV DEPT OPERAT RESSYST OPTIMIZAT LABSTANFORDCA 94305
The authors present a primal interior-point algorithm for solving convex programs with nonlinear constraints. The algorithm uses a predictor-corrector strategy to follow a smooth path that leads from a given starting ... 详细信息
来源: 评论
A PARALLEL ALGORITHM FOR A CLASS OF convex-programS
收藏 引用
SIAM JOURNAL ON CONTROL AND OPTIMIZATION 1988年 第2期26卷 345-355页
作者: HAN, SP LOU, G
A parallel algorithm is proposed in this paper for solving the problem $\min \{ q(x)|x \in C_1 \cap \cdots \cap C_m \} $ where q is an uniformly convex function and $C_i$ are closed convex sets in $R^n$. In each it... 详细信息
来源: 评论
Sketching Low-Rank Matrices With a Shared Column Space by convex programming
IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY
收藏 引用
IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2023年 4卷 54-60页
作者: Srinivasa, Rakshith S. Kim, Seonho Lee, Kiryung Samsung Res Amer Mountain View CA 94043 USA Ohio State Univ Dept Elect & Comp Engn Columbus OH 43220 USA
In many practical applications including remote sensing, multi-task learning, and multi-spectrum imaging, data are described as a set of matrices sharing a common column space. We consider the joint estimation of such... 详细信息
来源: 评论