咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是31-40 订阅
排序:
Global optimization of nonlinear fractional programming problems in engineering design
收藏 引用
ENGINEERING OPTIMIZATION 2005年 第4期37卷 399-409页
作者: Tsai, JF Natl Taiwan Univ Technol Dept Business Management Taipei 106 Taiwan
This study proposes a novel method to solve nonlinear fractional programming (NFP) problems occurring frequently in engineering design and management. Fractional terms composed of signomial functions are first decompo... 详细信息
来源: 评论
PROBING THE PARETO FRONTIER FOR BASIS PURSUIT SOLUTIONS
收藏 引用
SIAM JOURNAL ON SCIENTIFIC COMPUTING 2008年 第2期31卷 890-912页
作者: van den Berg, Ewout Friedlander, Michael P. Univ British Columbia Dept Comp Sci Vancouver BC V6T 1Z4 Canada
The basis pursuit problem seeks a minimum one-norm solution of an underdetermined least-squares problem. Basis pursuit denoise (BPDN) fits the least-squares problem only approximately, and a single parameter determine... 详细信息
来源: 评论
DUAL ASCENT METHODS FOR PROBLEMS WITH STRICTLY convex COSTS AND LINEAR CONSTRAINTS - A UNIFIED APPROACH
收藏 引用
SIAM JOURNAL ON CONTROL AND OPTIMIZATION 1990年 第1期28卷 214-242页
作者: TSENG, P Massachusetts Inst of Technology MA United States
Consider problems of the form \[({\text{P}})\qquad min \{ . {f(x)} |Ex \geqq b\} ,\] where f is a strictly convex (possibly nondifferentiable) function and E and b are, respectively, a matrix and a vector. A popular m... 详细信息
来源: 评论
SPARSE OPTIMIZATION WITH LEAST-SQUARES CONSTRAINTS
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2011年 第4期21卷 1201-1229页
作者: van den Berg, Ewout Friedlander, Michael P. Univ British Columbia Dept Comp Sci Vancouver BC V6T 1Z4 Canada
The use of convex optimization for the recovery of sparse signals from incomplete or compressed data is now common practice. Motivated by the success of basis pursuit in recovering sparse vectors, new formulations hav... 详细信息
来源: 评论
IMPROVED POINTWISE ITERATION-COMPLEXITY OF A REGULARIZED ADMM AND OF A REGULARIZED NON-EUCLIDEAN HPE FRAMEWORK
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2017年 第1期27卷 379-407页
作者: Goncalves, Max L. N. Melo, Jefferson G. Monteiro, Renato D. C. Univ Fed Goias Inst Math & Stat Campus 2Caixa Postal 131 BR-74001970 Goiania Go Brazil Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA
This paper describes a regularized variant of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex programs. It is shown that the pointwise iteration-complexity of the new var... 详细信息
来源: 评论
Large deviations rate function for polling systems
收藏 引用
QUEUEING SYSTEMS 2002年 第1-2期41卷 13-44页
作者: Delcoigne, F de la Fortelle, A Univ Paris 10 UFR SEGMI F-92000 Nanterre France Inst Natl Rech Informat & Automat F-78153 Le Chesnay France
In this paper, we identify the local rate function governing the sample path large deviation principle for a rescaled process n(-1)Q(nt), where Q(t) represents the joint number of clients at time t in a polling system... 详细信息
来源: 评论
Geometric dual formulation for first-derivative-based univariate cubic L1 splines
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2008年 第4期40卷 589-621页
作者: Zhao, Y. B. Fang, S. -C. Lavery, J. E. N Carolina State Univ Raleigh NC 27695 USA Chinese Acad Sci Inst Appl Math AMSS Beijing 100080 Peoples R China Tsinghua Univ Dept Math Sci & Ind Engn Beijing 100084 Peoples R China USA Res Off Res Lab Div Math Res Triangle Pk NC 27709 USA
With the objective of generating "shape-preserving" smooth interpolating curves that represent data with abrupt changes in magnitude and/or knot spacing, we study a class of first-derivative-based C-1-smooth... 详细信息
来源: 评论
A Partially Inexact Proximal Alternating Direction Method of Multipliers and Its Iteration-Complexity Analysis
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2019年 第2期182卷 640-666页
作者: Adona, Vando A. Goncalves, Max L. N. Melo, Jefferson G. Univ Fed Goias IME BR-74001970 Goiania Go Brazil
This paper proposes a partially inexact proximal alternating direction method of multipliers for computing approximate solutions of a linearly constrained convex optimization problem. This method allows its first subp... 详细信息
来源: 评论
An inexact version of the symmetric proximal ADMM for solving separable convex optimization
收藏 引用
NUMERICAL ALGORITHMS 2023年 第1期94卷 1-28页
作者: Adona, Vando A. Goncalves, Max L. N. Univ Fed Goias IME Campus 2131 BR-74001970 Goiania GO Brazil
In this paper, we propose and analyze an inexact version of the symmetric proximal alternating direction method of multipliers (ADMM) for solving linearly constrained optimization problems. Basically, the method allow... 详细信息
来源: 评论
EXPLICIT DUALITY FOR convex HOMOGENEOUS programS
收藏 引用
MATHEMATICAL programMING 1976年 第2期10卷 176-191页
作者: GLASSEY, CR UNIV CALIF BERKELEY BERKELEYCA 94720
When all the functions that define a convex program are positively homogeneous, then a dual convex program can be constructed which is defined in terms of the primal data only (the primal variables do not appear). Fur... 详细信息
来源: 评论