咨询与建议

限定检索结果

文献类型

  • 79 篇 期刊文献
  • 21 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 72 篇 理学
    • 69 篇 数学
    • 7 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 69 篇 工学
    • 43 篇 计算机科学与技术...
    • 33 篇 软件工程
    • 10 篇 电气工程
    • 5 篇 光学工程
    • 5 篇 控制科学与工程
    • 4 篇 信息与通信工程
    • 1 篇 石油与天然气工程
  • 33 篇 管理学
    • 33 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 6 篇 医学
    • 6 篇 临床医学
  • 2 篇 经济学
    • 1 篇 理论经济学
    • 1 篇 应用经济学

主题

  • 100 篇 primal-dual algo...
  • 18 篇 convex optimizat...
  • 15 篇 approximation al...
  • 9 篇 interior-point m...
  • 8 篇 polynomial compl...
  • 8 篇 linear programmi...
  • 5 篇 distributed opti...
  • 5 篇 interior-point a...
  • 4 篇 saddle-point pro...
  • 4 篇 strongly polynom...
  • 4 篇 path-following
  • 4 篇 total variation
  • 4 篇 central path
  • 4 篇 semidefinite pro...
  • 4 篇 predictor-correc...
  • 4 篇 nonlinear progra...
  • 4 篇 randomized algor...
  • 4 篇 condition number
  • 3 篇 optimization
  • 3 篇 duality theory

机构

  • 5 篇 univ waterloo de...
  • 5 篇 inst stat math m...
  • 4 篇 graz univ techno...
  • 4 篇 georgia inst tec...
  • 3 篇 katholieke univ ...
  • 3 篇 univ maryland de...
  • 3 篇 cornell univ dep...
  • 2 篇 korea adv inst s...
  • 2 篇 alan turing inst...
  • 2 篇 kyoto univ res i...
  • 2 篇 univ houston dep...
  • 2 篇 bell labs murray...
  • 2 篇 univ cambridge d...
  • 2 篇 univ waterloo fa...
  • 2 篇 univ minnesota d...
  • 2 篇 ben gurion univ ...
  • 2 篇 arizona state un...
  • 2 篇 graz univ inst m...
  • 2 篇 yahoo res sunnyv...
  • 2 篇 univ evry val es...

作者

  • 4 篇 patrinos panagio...
  • 4 篇 chambolle antoni...
  • 4 篇 pock thomas
  • 4 篇 tuncel levent
  • 4 篇 latafat puya
  • 3 篇 schonlieb carola...
  • 3 篇 monteiro rdc
  • 3 篇 gasnikov alexand...
  • 3 篇 karimi mehdi
  • 3 篇 tunçel l
  • 3 篇 ehrhardt matthia...
  • 3 篇 tsuchiya takashi
  • 3 篇 mestre julian
  • 3 篇 vazirani vijay v...
  • 3 篇 tsuchiya t
  • 2 篇 elbassioni khale...
  • 2 篇 richtarik peter
  • 2 篇 chwa kyung-yong
  • 2 篇 jung hyunwoo
  • 2 篇 lucidi s

语言

  • 97 篇 英文
  • 3 篇 其他
检索条件"主题词=primal-dual algorithms"
100 条 记 录,以下是21-30 订阅
排序:
primal-dual BLOCK-PROXIMAL SPLITTING FOR A CLASS OF NON-CONVEX PROBLEMS
收藏 引用
ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS 2020年 52卷 509-552页
作者: Mazurenko, Stanislav Jauhiainen, Jyrki Valkonen, Tuomo Masaryk Univ Loschmidt Labs Brno Czech Republic Univ Eastern Finland Kuopio Finland Escuela Politec Nacl ModeMat Quito Ecuador Univ Helsinki Dept Math & Stat Helsinki Finland
We develop block structure-adapted primal-dual algorithms for non-convex non-smooth optimisation problems, whose objectives can be written as compositions G(x) + F(K(x)) of non-smooth block-separable convex functions ... 详细信息
来源: 评论
Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
收藏 引用
MATHEMATICAL PROGRAMMING 2019年 第1-2期176卷 207-245页
作者: Hajinezhad, Davood Hong, Mingyi SAS Inst Cary NC USA Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA
In this paper, we propose a perturbed proximal primal-dual algorithm (PProx-PDA) for an important class of linearly constrained optimization problems, whose objective is the sum of smooth (possibly nonconvex) and conv... 详细信息
来源: 评论
WARPd: A Linearly Convergent First-Order primal-dual Algorithm for Inverse Problems with Approximate Sharpness Conditions*
收藏 引用
SIAM JOURNAL ON IMAGING SCIENCES 2022年 第3期15卷 1539-1575页
作者: Colbrook, Matthew J. Ecole Normale Super Ctr Sci Donnees Paris France
Sharpness conditions directly control the recovery performance of restart schemes for first-order optimization methods without the need for restrictive assumptions such as strong convexity. However, they are challengi... 详细信息
来源: 评论
CONVERGENCE RATE ANALYSIS OF primal-dual SPLITTING SCHEMES
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2015年 第3期25卷 1912-1943页
作者: Davis, Damek Univ Calif Los Angeles Dept Math Los Angeles CA 90025 USA Cornell Univ Sch Operat Res & Informat Engn Ithaca NY 14850 USA
primal-dual splitting schemes are a class of powerful algorithms that solve complicated monotone inclusions and convex optimization problems that are built from many simpler pieces. They decompose problems that are bu... 详细信息
来源: 评论
Practical Acceleration of the Condat-Vu Algorithm
收藏 引用
SIAM JOURNAL ON IMAGING SCIENCES 2024年 第4期17卷 2076-2109页
作者: Driggs, Derek Ehrhardt, Matthias J. Schonlieb, Carola-Bibiane Tang, Junqi Univ Cambridge Dept Appl Math & Theoret Phys Cambridge CB3 0WA England Univ Bath Dept Math Sci Bath BA2 7AY England Univ Birmingham Sch Math Birmingham B15 2TT England
The Condat-Vu algorithm is a widely used primal-dual method for optimizing composite objectives of three functions. Several algorithms for optimizing composite objectives of two functions are special cases of Condat-V... 详细信息
来源: 评论
A dual approach for optimal algorithms in distributed optimization over networks
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 2021年 第1期36卷 171-210页
作者: Uribe, Cesar A. Lee, Soomin Gasnikov, Alexander Nedic, Angelia MIT Lab Informat & Decis Syst 77 Massachusetts Ave Cambridge MA 02139 USA MIT Inst Data Syst & Soc 77 Massachusetts Ave Cambridge MA 02139 USA Yahoo Res Sunnyvale CA USA Moscow Inst Phys & Technol Dept Math Fdn Control Dolgoprudnyi Russia Inst Informat Transmiss Dolgoprudnyi Russia Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ USA
We study dual-based algorithms for distributed convex optimization problems over networks, where the objective is to minimize a sum of functions over in a network. We provide complexity bounds for four different cases... 详细信息
来源: 评论
Approximating k-forest with resource augmentation: A primal-dual approach
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 788卷 12-20页
作者: Angel, Eric Nguyen Kim Thang Singh, Shikha Univ Evry Val Essonne IBISC Evry France Wellesley Coll Wellesley MA 02181 USA
In this paper, we study the k-forest problem in the model of resource augmentation. In the k-forest problem, given an edge-weighted graph G (V, E), a parameter k, and a set of m demand pairs subset of V x V, the objec... 详细信息
来源: 评论
Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
收藏 引用
MATHEMATICAL PROGRAMMING 2024年 1-39页
作者: Latafat, Puya Themelis, Andreas Stella, Lorenzo Patrinos, Panagiotis Katholieke Univ Leuven Dept Elect Engn ESAT STADIUS Kasteelpk Arenberg 10 B-3001 Leuven Belgium Kyushu Univ Fac Informat Sci & Elect Engn ISEE 744 MotookaNishi Ku Fukuoka 8190395 Japan Amazon Web Serv Berlin Germany
Backtracking linesearch is the de facto approach for minimizing continuously differentiable functions with locally Lipschitz gradient. In recent years, it has been shown that in the convex setting it is possible to av... 详细信息
来源: 评论
FEASIBILITY ISSUES IN A primal dual INTERIOR-POINT METHOD FOR LINEAR-PROGRAMMING
收藏 引用
MATHEMATICAL PROGRAMMING 1990年 第2期49卷 145-162页
作者: LUSTIG, IJ 1. Program in Statistics and Operations Research Department of Civil Engineering and Operations Research School of Engineering and Applied Science Princeton University 08544 Princeton NJ USA
A new method for obtaining an initial feasible interior-point solution to a linear program is presented. This method avoids the use of a "big-M", and is shown to work well on a standard set of test problems.... 详细信息
来源: 评论
A Weighted Difference of Anisotropic and Isotropic Total Variation for Relaxed Mumford--Shah Color and Multiphase Image Segmentation
收藏 引用
SIAM JOURNAL ON IMAGING SCIENCES 2021年 第3期14卷 1078-1113页
作者: Bui, Kevin Park, Fredrick Lou, Yifei Xin, Jack Univ Calif Irvine Dept Math Irvine CA 92697 USA Whittier Coll Dept Math & Comp Sci Whittier CA 90602 USA Univ Texas Dallas Dept Math Sci Richardson TX 75080 USA
In a class of piecewise-constant image segmentation models, we propose to incorporate a weighted difference of anisotropic and isotropic total variation (AITV) to regularize the partition boundaries in an image. In pa... 详细信息
来源: 评论