咨询与建议

限定检索结果

文献类型

  • 2,001 篇 期刊文献
  • 445 篇 会议
  • 24 篇 学位论文
  • 1 篇 科技报告

馆藏范围

  • 2,471 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,510 篇 理学
    • 1,360 篇 数学
    • 101 篇 物理学
    • 67 篇 系统科学
    • 47 篇 统计学(可授理学、...
    • 17 篇 生物学
    • 11 篇 化学
    • 11 篇 地质学
    • 8 篇 地球物理学
  • 1,470 篇 工学
    • 571 篇 电气工程
    • 556 篇 计算机科学与技术...
    • 298 篇 软件工程
    • 252 篇 控制科学与工程
    • 218 篇 信息与通信工程
    • 50 篇 电子科学与技术(可...
    • 45 篇 仪器科学与技术
    • 26 篇 力学(可授工学、理...
    • 23 篇 石油与天然气工程
    • 22 篇 机械工程
    • 18 篇 交通运输工程
    • 16 篇 光学工程
    • 13 篇 土木工程
    • 12 篇 地质资源与地质工...
    • 11 篇 化学工程与技术
    • 8 篇 材料科学与工程(可...
    • 7 篇 建筑学
  • 705 篇 管理学
    • 698 篇 管理科学与工程(可...
    • 23 篇 工商管理
  • 46 篇 经济学
    • 35 篇 应用经济学
    • 11 篇 理论经济学
  • 29 篇 医学
    • 24 篇 临床医学
  • 5 篇 农学
  • 2 篇 法学
  • 2 篇 教育学
  • 2 篇 文学
  • 1 篇 军事学

主题

  • 2,471 篇 semidefinite pro...
  • 122 篇 convex optimizat...
  • 80 篇 optimization
  • 71 篇 polynomial optim...
  • 61 篇 sum of squares
  • 61 篇 linear programmi...
  • 59 篇 linear matrix in...
  • 59 篇 global optimizat...
  • 51 篇 approximation al...
  • 47 篇 interior-point m...
  • 44 篇 convex relaxatio...
  • 43 篇 optimal power fl...
  • 42 篇 combinatorial op...
  • 42 篇 robust optimizat...
  • 38 篇 second-order con...
  • 36 篇 quadratic progra...
  • 31 篇 mathematical pro...
  • 31 篇 linear matrix in...
  • 29 篇 sums of squares
  • 29 篇 duality

机构

  • 30 篇 univ iowa dept m...
  • 27 篇 univ waterloo de...
  • 24 篇 natl univ singap...
  • 23 篇 georgia inst tec...
  • 17 篇 univ waterloo fa...
  • 14 篇 cnrs laas f-3107...
  • 14 篇 chinese univ hon...
  • 13 篇 princeton univ d...
  • 13 篇 univ minnesota d...
  • 13 篇 univ konstanz fa...
  • 13 篇 stanford univ de...
  • 12 篇 tilburg univ til...
  • 11 篇 stanford univ de...
  • 11 篇 caltech dept com...
  • 11 篇 univ calif berke...
  • 10 篇 mit cambridge ma...
  • 10 篇 caltech dept ele...
  • 10 篇 tampere univ tec...
  • 10 篇 cnrs laas 7 ave ...
  • 10 篇 tilburg univ dep...

作者

  • 32 篇 de klerk etienne
  • 30 篇 henrion didier
  • 24 篇 magron victor
  • 23 篇 laurent monique
  • 22 篇 lasserre jean b.
  • 21 篇 sotirov renata
  • 21 篇 povh janez
  • 21 篇 anjos miguel f.
  • 20 篇 burer samuel
  • 17 篇 ahmadi amir ali
  • 17 篇 parrilo pablo a.
  • 16 篇 wiegele angelika
  • 16 篇 klep igor
  • 15 篇 monteiro rdc
  • 15 篇 wolkowicz henry
  • 15 篇 lisser abdel
  • 15 篇 tuncel levent
  • 14 篇 vandenberghe lie...
  • 14 篇 xia yong
  • 14 篇 wolkowicz h

语言

  • 2,361 篇 英文
  • 91 篇 其他
  • 12 篇 中文
  • 2 篇 土耳其文
  • 1 篇 法文
检索条件"主题词=Semidefinite Programming"
2471 条 记 录,以下是2441-2450 订阅
排序:
Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT
收藏 引用
INFORMATION PROCESSING LETTERS 1998年 第6期65卷 305-311页
作者: Andersson, G Engebretsen, L Royal Inst Technol Dept Numer Anal & Comp Sci S-10044 Stockholm Sweden
We construct new approximation algorithms for MAX SET SPLITTING and MAX NOT-ALL-EQUAL SAT which when combined with existing algorithms give the best approximation results so far for these problems. Furthermore, we sol... 详细信息
来源: 评论
Spectral methods for graph bisection problems
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1998年 第7-8期25卷 519-530页
作者: Tu, CC Cheng, HJ Natl Tsing Hua Univ Dept Math Hsinchu 30043 Taiwan NYU Courant Inst Math Sci Dept Comp Sci New York NY 10012 USA
In this paper, we study the spectral methods for graph bisection problems and conclude certain numerical results. Spectral methods contain two topics: eigenvalue bounds for graph bisection width and bisection algorith... 详细信息
来源: 评论
Optimization problems with perturbations: A guided tour
收藏 引用
SIAM REVIEW 1998年 第2期40卷 228-264页
作者: Bonnans, JF Shapiro, A Inst Natl Rech Informat & Automat F-78153 Le Chesnay France Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA
This paper presents an overview of some recent, and significant, progress in the theory of optimization problems with perturbations. We put the emphasis on methods based on upper and lower estimates of the objective f... 详细信息
来源: 评论
From potential theory to matrix iterations in six steps
收藏 引用
SIAM REVIEW 1998年 第3期40卷 547-578页
作者: Driscoll, TA Toh, KC Trefethen, LN Univ Colorado Dept Appl Math Boulder CO 80309 USA Natl Univ Singapore Dept Math Singapore Singapore Univ Oxford Comp Lab Oxford OX1 3QD England
The theory of the convergence of Krylov subspace iterations for linear systems of equations (conjugate gradients, biconjugate gradients, GMRES, QMR, Bi-CGSTAB, and so on) is reviewed. For a computation of this kind, a... 详细信息
来源: 评论
Determinant maximization with linear matrix inequality constraints
收藏 引用
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 1998年 第2期19卷 499-533页
作者: Vandenberghe, L Boyd, S Wu, SP Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA Stanford Univ Dept Elect Engn Informat Syst Lab Stanford CA 94305 USA
The problem of maximizing the determinant of a matrix subject to linear matrix inequalities (LMIs) arises in many fields, including computational geometry, statistics, system identification, experiment design, and inf... 详细信息
来源: 评论
Sensitivity Analysis in semidefinite programming and its Application to Uncertain Control Systems
收藏 引用
IFAC Proceedings Volumes 1996年 第1期29卷 3580-3584页
作者: Yuji Wakasa Tetsuzo Tanino Tohru Katayama Department of Information Technology Faculty of Engineering Okayama University Okayama 700 Japan Department of Applied Mathematics and Physics Graduate School of Engineering Kyoto University Kyoto 606-01 Japan
There are a large number of problems in systems and control that can be formulated as semidefinite programming problems: minimize a linear function subject to linear matrix inequality constraints. In this paper we stu... 详细信息
来源: 评论
A geometric approach to betweenness
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 1998年 第4期11卷 511-523页
作者: Chor, B Sudan, M Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel MIT Comp Sci Lab Cambridge MA 02139 USA IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie inside the interval defined by the other... 详细信息
来源: 评论
Robust solutions to uncertain semidefinite programs
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1998年 第1期9卷 33-52页
作者: El Ghaoui, L Oustry, F Lebret, H Ecole Natl Super Tech Avancees F-75739 Paris France
In this paper we consider semidefinite programs (SDPs) whose data depend on some unknown but bounded perturbation parameters. We seek "robust" solutions to such programs, that is, solutions which minimize th... 详细信息
来源: 评论
The Chebyshev polynomials of a matrix
收藏 引用
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 1998年 第2期20卷 400-419页
作者: Toh, KC Trefethen, LN Natl Univ Singapore Dept Math Singapore 119260 Singapore Univ Oxford Comp Lab Oxford OX1 3QD England
A Chebyshev polynomial of a square matrix A is a monic polynomial p of specified degree that minimizes parallel to p(A)parallel to(2). The study of such polynomials is motivated by the analysis of Krylov subspace iter... 详细信息
来源: 评论
Nondegeneracy and quantitative stability of parameterized optimization problems with multiple solutions
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1998年 第4期8卷 940-946页
作者: Bonnans, JF Shapiro, A Inst Natl Rech Informat & Automat F-78153 Le Chesnay France Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA
This paper presents some results on quantitative stability of optimal solutions of parameterized optimization problems having nonisolated optima. The analysis is based on the introduced concept of nondegeneracy, which... 详细信息
来源: 评论