.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. Semidefinite programming unifies several standard problems (e.g., linear and quadratic programming) and finds many applications in engineering and combinatorial optimization. Although semidefinite programs are much more general than linear programs, they are not much harder to solve. Most interior-point methods for linear programming have been generalized to semidefinite programs. As in linear programming, these methods have polynomial worst-case complexity and perform very well in practice. This paper gives a survey of the theory and applications of semidefinite programs and an introduction to primal-dual interior-point methods for their solution.
Keyword:
semidefinite programming
convex optimization
interior-point methods
eigenvalue optimization
combinatorial optimization
system and control theory
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.1
论文数:
888
被引数:
1.2W
机构
暂无机构信息
引用论文
Performance-Based Design and Optimization of Buckling Restrained Knee Braced Truss Moment Frame.png)
PREAI
.png){kind=icon}
分享.png){kind=icon}
收藏
Track deflection and stiffness measurements from a track recording car.png)
Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid Transit
Proceedings of the Institution of Mechanical Engineers, Part F: Journal of Rail and Rapid TransitIF0
PREAI
分享收藏
查看更多内容