咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是2311-2320 订阅
排序:
On convex quadratic approximation
收藏 引用
STATISTICA NEERLANDICA 2002年 第3期56卷 376-385页
作者: den Hertog, D de Klerk, E Roos, K Tilburg Univ Dept Econometr NL-5000 LE Tilburg Netherlands Delft Univ Technol Fac Informat Technol & Syst Dept TWI SSOR NL-2600 GA Delft Netherlands
Let n greater than or equal to 1 and f : R-n --> R a convex function. Given distinct points z(1), z(2).... z(N) in R-n we consider the problem of finding a quadratic function g : Rn --> R such that parallel to[f... 详细信息
来源: 评论
An explicit equivalent positive semidefinite program for nonlinear 0-1 programs
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2002年 第3期12卷 756-769页
作者: Lasserre, JB CNRS LAAS F-31077 Toulouse France
We consider the general nonlinear optimization problem in 0-1 variables and provide an explicit equivalent positive semidefinite program in 2(n)-1 variables. The optimal values of both problems are identical. From eve... 详细信息
来源: 评论
The central path in smooth convex semidefinite programs
收藏 引用
OPTIMIZATION 2002年 第2期51卷 207-233页
作者: Drummond, LMG Peterzil, Y Univ Fed Rio de Janeiro COPPE Programa Engn Sistemas Comp BR-21915970 Rio De Janeiro Brazil Univ Haifa Dept Math IL-31905 Haifa Israel
In this paper we study the welldefinedness of the central path associated to a nonlinear convex semidefinite programming problem with smooth objective and constraint functions. Under standard assumptions, we prove tha... 详细信息
来源: 评论
semidefinite positive relaxation of the maximum-likelihood criterion applied to multiuser detection in a CDMA context
收藏 引用
IEEE SIGNAL PROCESSING LETTERS 2002年 第6期9卷 165-167页
作者: Abdi, M El Nahas, H Jard, A Moulines, E Nortel Networks F-78928 Yvelines 9 France Ecole Natl Super Telecommun Bretagne Dept Traitement Signal & Images F-75013 Paris France
Many signal processing applications reduce to solving combinatorial optimization problems. Recently, semidefinite programming (SDP) has been shown to be a very promising approach to combinatorial optimization, where S... 详细信息
来源: 评论
Polynomials nonnegative on a grid and discrete optimization
收藏 引用
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY 2002年 第2期354卷 631-649页
作者: Lasserre, JB CNRS LAAS F-31077 Toulouse France
We characterize the real-valued polynomials on R(n) that are nonnegative (not necessarily strictly positive) on a grid K of points of R(n), in terms of a weighted sum of squares whose degree is bounded and known in ad... 详细信息
来源: 评论
Convergent infeasible interior-point trust-region methods for constrained minimization
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2002年 第2期13卷 432-469页
作者: Tseng, P Univ Washington Dept Math Seattle WA 98195 USA
We study an infeasible primal-dual interior-poin trust-region method for constrained minimization. This method uses a log-barrier function for the slack variables and updates the slack variables using second-order cor... 详细信息
来源: 评论
Generating convex polynomial inequalities for mixed 0-1 programs
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2002年 第3期24卷 311-332页
作者: Stubbs, RA Mehrotra, S Northwestern Univ Dept Ind Engn & Management Sci Evanston IL 60208 USA
We develop a method for generating valid convex quadratic inequalities for mixed 0-1 convex programs. We also show how these inequalities can be generated in the linear case by defining cut generation problems using a... 详细信息
来源: 评论
Some fundamental properties of successive convex relaxation methods on LCP and related problems
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2002年 第3期24卷 333-348页
作者: Kojima, M Tunçel, L Univ Waterloo Fac Math Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Tokyo Inst Technol Dept Math & Comp Sci Meguro Ku Tokyo 1528552 Japan Fields Inst Toronto ON Canada
General successive convex relaxation methods (SRCMs) can be used to compute the convex hull of any compact set, in an Euclidean space, described by a system of quadratic inequalities and a compact convex set. Linear c... 详细信息
来源: 评论
Optimal Hoffman-type estimates in eigenvalue and semidefinite inequality constraints
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2002年 第2期24卷 133-147页
作者: Azé, D Hiriart-Urruty, JB Univ Toulouse 3 UMR CNRS MIP F-31062 Toulouse France
Starting from a general Hoffman-type estimate for inequalities defined via convex functions, we derive estimates of the same type for inequality constraints expressed in terms of eigenvalue functions (as in eigenvalue... 详细信息
来源: 评论
Statistical inference of Minimum Rank Factor Analysis
收藏 引用
PSYCHOMETRIKA 2002年 第1期67卷 79-94页
作者: Shapiro, A Ten Berge, JMF Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA Univ Groningen Heymans Inst Psychol Res NL-9700 AB Groningen Netherlands
For any given number of factors, Minimum Rank Factor Analysis yields optimal communalities for an observed covariance matrix in the sense that the unexplained common variance with that number of factors is minimized, ... 详细信息
来源: 评论