咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
收藏 引用
MATHEMATICAL PROGRAMMING 2008年 第1期115卷 105-149页
作者: Monteiro, Renato D. C. Tsuchiya, Takashi Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA Inst Stat Math Minato Ku Tokyo 1068569 Japan
The main goals of this paper are to: i) relate two iteration-complexity bounds derived for the Mizuno-Todd-Ye predictor-corrector (MTY P-C) algorithm for linear programming (LP), and;ii) study the geometrical structur... 详细信息
来源: 评论
primal-dual path-following algorithms for semidefinite programming
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1997年 第3期7卷 663-678页
作者: Monteiro, RDC Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA
This paper deals with a class of primal-dual interior-point algorithms for semidefinite programming (SDP) which was recently introduced by Kojima, Shindoh, and Kara [SIAM J. Optim., 7 (1997), pp. 86-125]. These author... 详细信息
来源: 评论
Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems
收藏 引用
OPTIMIZATION METHODS & SOFTWARE 1998年 第2期10卷 275-296页
作者: Kojima, M Tunçel, L Tokyo Inst Technol Dept Math & Informat Sci Meguro Ku Tokyo 152 Japan Univ Waterloo Fac Math Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada
We present primal-dual interior-point algorithms with polynomial iteration bounds to find approximate solutions of semidefinite programming problems. Our algorithms achieve the current best iteration bounds and, in ev... 详细信息
来源: 评论
Monotonicity of primal-dual Interior-point algorithms for Semidefinite Programming Problems
收藏 引用
Optimization Methods and Software 1999年 第2期10卷 275-296页
作者: Kojima, Masakazu Tuncel, Levent Dept. of Math. and Info. Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama Meguro-ku Tokyo 152 Japan Dept. Combinatorics and Optimization Faculty of Mathematics University of Waterloo Waterloo Ont. N2L 3G1 Canada
We present primal-dual interior-point algorithms with polynomial iteration bounds to find approximate solutions of semidefinite programming problems. Our algorithms achieve the current best iteration bounds and, in ev... 详细信息
来源: 评论
On the ergodic convergence rates of a first-order primal-dual algorithm
收藏 引用
MATHEMATICAL PROGRAMMING 2016年 第1-2期159卷 253-287页
作者: Chambolle, Antonin Pock, Thomas CNRS Ecole Polytech CMAP F-91128 Palaiseau France Graz Univ Technol Inst Comp Graph & Vis A-8010 Graz Austria AIT Austrian Inst Technol GmbH Digital Safety & Secur Dept A-1220 Vienna Austria
We revisit the proofs of convergence for a first order primal-dual algorithm for convex optimization which we have studied a few years ago. In particular, we prove rates of convergence for a more general version, with... 详细信息
来源: 评论
Approximate proof-labeling schemes
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 811卷 112-124页
作者: Censor-Hillel, Keren Paz, Ami Perry, Mor Technion Dept Comp Sci Haifa Israel CNRS IRIF Paris France Univ Paris Diderot Paris France Tel Aviv Univ Dept Elect Engn Tel Aviv Israel
We study a new model of verification of boolean predicates over distributed networks. Given a network configuration, the proof-labeling scheme (PIS) model defines a distributed proof in the form of a label that is giv... 详细信息
来源: 评论
Solving a non-smooth eigenvalue problem using operator-splitting methods
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2007年 第6期84卷 825-846页
作者: Majava, K. Glowinski, R. Karkkainen, T. Univ Jyvaskyla Dept Math Informat Technol SF-40014 Jyvaskyla Finland Univ Houston Dept Math Houston TX 77204 USA
In this paper, we study the solution of a certain non-smooth eigenvalue problem, using operator-splitting methods to solve an equivalent, constrained minimization problem. We present the Marchuk-Yanenko and Peaceman-R... 详细信息
来源: 评论
A POLYNOMIAL PREDICTOR-CORRECTOR TRUST-REGION ALGORITHM FOR LINEAR PROGRAMMING
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2009年 第4期19卷 1918-1946页
作者: Lan, Guanghui Monteiro, Renato D. C. Tsuchiya, Takashi Georgia Inst Technol Sch ISyE Atlanta GA 30332 USA Inst Stat Math Minato Ku Tokyo 1068569 Japan
In this paper we present a scaling-invariant, interior-point, predictor-corrector type algorithm for linear programming (LP) whose iteration-complexity is polynomially bounded by the dimension and the logarithm of a c... 详细信息
来源: 评论
On stackelberg pricing with computationally bounded customers
收藏 引用
NETWORKS 2012年 第1期60卷 31-44页
作者: Briest, Patrick Guala, Luciano Hoefer, Martin Ventre, Carmine Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany Univ Liverpool Dept Comp Sci Liverpool Merseyside England Univ Roma Tor Vergata Dipartimento Matemat I-00173 Rome Italy Univ Paderborn Dept Comp Sci Paderborn Germany
In Stackelberg pricing a leader sets prices for items to maximize revenue from a follower purchasing a feasible subset of items. We consider computationally bounded followers who cannot optimize exactly over the range... 详细信息
来源: 评论
A new iteration-complexity bound for the MTY predictor-corrector algorithm
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2005年 第2期15卷 319-347页
作者: Monteiro, RDC Tsuchiya, T Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA Inst Stat Math Minato Ku Tokyo 1068569 Japan
In this paper we present a new iteration-complexity bound for the Mizuno-Todd-Ye predictor-corrector (MTY P-C) primal-dual interior-point algorithm for linear programming. The analysis of the paper is based on the imp... 详细信息
来源: 评论